>(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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4048,\n \"score_of_the_acc\": -0.0066,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0530_4861302\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3948,\n \"score_of_the_acc\": -0.0056,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0530_4819268\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3412,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0530_4740984\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 7316,\n \"score_of_the_acc\": -0.8979,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_0530_4686468\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 50132,\n \"score_of_the_acc\": -1.4158,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_0530_4686465\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 50124,\n \"score_of_the_acc\": -1.4158,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_0530_4379988\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5600,\n \"score_of_the_acc\": -0.0942,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_0530_4379969\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5576,\n \"score_of_the_acc\": -0.094,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_0530_4379022\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 6696,\n \"score_of_the_acc\": -0.1771,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_0530_4378992\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 98412,\n \"score_of_the_acc\": -1.9194,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_0530_4153932\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 6352,\n \"score_of_the_acc\": -0.0307,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_0530_3995448\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 54572,\n \"score_of_the_acc\": -1.1764,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_0530_3945369\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3936,\n \"score_of_the_acc\": -0.0055,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0530_3886898\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 53472,\n \"score_of_the_acc\": -1.0935,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_0530_3880799\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4644,\n \"score_of_the_acc\": -0.0128,\n \"final_rank\": 6\n }\n]","isConversational":false}}},{"rowIdx":375,"cells":{"group_id":{"kind":"string","value":"aoj_0525_cpp"},"problem_description":{"kind":"string","value":"おせんべい\n問題\nIOI製菓では，創業以来の伝統の製法で煎餅（せんべい）を焼いている．この伝統の製法は，炭火で一定時間表側を焼き，表側が焼けると裏返して，炭火で一定時間裏側を焼くというものである．この伝統を守りつつ，煎餅を機械で焼いている．この機械は縦 R (1 ≤ R ≤ 10) 行, 横 C (1 ≤ C ≤ 10000) 列の長方形状に煎餅を並べて焼く．通常は自動運転で，表側が焼けたら一斉に煎餅を裏返し裏側を焼く．\nある日，煎餅を焼いていると，煎餅を裏返す直前に地震が起こり何枚かの煎餅が裏返ってしまった．幸いなことに炭火の状態は適切なままであったが，これ以上表側を焼くと創業以来の伝統で定められている焼き時間を超えてしまい，煎餅の表側が焼けすぎて商品として出荷できなくなる．そこで，急いで機械をマニュアル操作に変更し，まだ裏返っていない煎餅だけを裏返そうとした．この機械は，横の行を何行か同時に裏返したり縦の列を何列か同時に裏返したりすることはできるが，残念なことに，煎餅を１枚ごと裏返すことはできない．\n裏返すのに時間がかかると，地震で裏返らなかった煎餅の表側が焼けすぎて商品として出荷できなくなるので，横の何行かを同時に１回裏返し，引き続き，縦の何列かを同時に１回裏返して，表側を焼きすぎずに両面を焼くことのできる煎餅，つまり，「出荷できる煎餅」の枚数をなるべく多くすることにした．横の行を１行も裏返さない，あるいは，縦の列を１列も裏返さない場合も考えることにする．出荷できる煎餅の枚数の最大値を出力するプログラムを書きなさい．\n地震の直後に，煎餅が次の図のような状態になったとする．黒い丸が表側が焼ける状態を，白い丸が裏側が焼ける状態を表している．\n1行目を裏返すと次の図のような状態になる．\nさらに， 1列目と5列目を裏返すと次の図のような状態になる．この状態では，出荷できる煎餅は9枚である．\nヒント\nR の上限 10 は C の上限 10000 に比べて小さいことに注意せよ．\n入力\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．\n入力の1行目には2つの整数 R, C (1 ≤ R ≤ 10, 1 ≤ C ≤ 10 000) が空白を区切りとして書かれている．続く R 行は地震直後の煎餅の状態を表す． (i+1) 行目 (1 ≤ i ≤ R) には， C 個の整数 a\ni,1\n, a\ni,2\n, ……, a\ni,C\nが空白を区切りとして書かれており， a\ni,j\nは i 行 j 列 の煎餅の状態を表している. a\ni,j\nが 1 なら表側が焼けることを， 0 なら裏側が焼けることを表す．\nC, R がともに 0 のとき入力の終了を示す. データセットの数は 5 を超えない．\n出力\nデータセットごとに，出荷できる煎餅の最大枚数を1行に出力する．\n入出力例\n入力例\n2 5\n0 1 0 1 0\n1 0 0 0 1\n3 6\n1 0 0 0 1 0\n1 1 1 0 1 0\n1 0 1 1 0 1 \n0 0\n出力例\n9\n15\n上記問題文と自動審判に使われるデータは、\n情報オリンピック日本委員会\nが作成し公開している問題文と採点用テストデータです。"},"candidates":{"kind":"list like","value":[{"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}],"string":"[\n {\n \"submission_id\": \"aoj_0525_11014462\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3640,\n \"score_of_the_acc\": -0.0504,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0525_10883246\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 720,\n \"memory_kb\": 4116,\n \"score_of_the_acc\": -0.4468,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_0525_10853937\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 650,\n \"memory_kb\": 3504,\n \"score_of_the_acc\": -0.3746,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_0525_10698607\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3852,\n \"score_of_the_acc\": -0.0618,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_0525_10347996\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 3712,\n \"score_of_the_acc\": -0.133,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_0525_10340988\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 3808,\n \"score_of_the_acc\": -0.1437,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_0525_10057112\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 3748,\n \"score_of_the_acc\": -0.09,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_0525_9637771\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3364,\n \"score_of_the_acc\": -0.0075,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0525_9637487\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 3752,\n \"score_of_the_acc\": -0.1407,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_0525_9556642\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 3972,\n \"score_of_the_acc\": -0.1694,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_0525_9515862\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3932,\n \"score_of_the_acc\": -0.0942,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_0525_9466367\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3568,\n \"score_of_the_acc\": -0.041,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0525_9430287\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3396,\n \"score_of_the_acc\": -0.0654,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_0525_9309650\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3368,\n \"score_of_the_acc\": -0.0527,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0525_9301884\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3224,\n \"score_of_the_acc\": -0.0393,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0525_9166108\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 270,\n \"memory_kb\": 3380,\n \"score_of_the_acc\": -0.1545,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_0525_9113641\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 1790,\n \"memory_kb\": 11584,\n \"score_of_the_acc\": -1.4493,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_0525_9097252\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 1130,\n \"memory_kb\": 3244,\n \"score_of_the_acc\": -0.6303,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_0525_9036013\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 3892,\n \"score_of_the_acc\": -0.1763,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_0525_9011380\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 21832,\n \"score_of_the_acc\": -1.0787,\n \"final_rank\": 19\n }\n]","isConversational":false}}},{"rowIdx":376,"cells":{"group_id":{"kind":"string","value":"aoj_0534_cpp"},"problem_description":{"kind":"string","value":"連鎖\n問題\n次のようなゲームがある．\nあるキャラクターが縦 1 列に N 個並んでいる．これらのキャラクターの色は赤，青，黄のいずれかであり，初期状態で同じ色のキャラクターが4つ以上連続して並んでいることはない．プレーヤーは，ある位置のキャラクターを選び他の色に変更することができる．この操作により同じ色のキャラクターが4つ以上連続して並ぶとそれらのキャラクターは消滅する．キャラクターが消滅することにより新たに同じ色のキャラクターが4つ以上連続して並ぶとそれらのキャラクターも消滅し，同じ色のキャラクターが4つ以上連続して並んでいる箇所がなくなるまでこの連鎖は続く．このゲームの目的は，消滅しないで残っているキャラクター数をなるべく少なくすることである．\n例えば，下図の左端の状態で，上から6番目のキャラクターの色を黄色から青に変更すると，青のキャラクターが5つ連続するので消滅し，最終的に3つのキャラクターが消滅せずに残る．\n初期状態における N 個のキャラクターの色の並びが与えられたとき， 1箇所だけキャラクターの色を変更した場合の，消滅しないで残っているキャラクター数の最小値 M を求めるプログラムを作成せよ．\n入力\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．\n1行目はキャラクター数 N (1 ≤ N ≤ 10000) だけからなる．続く N 行には 1, 2, 3 のいずれか1つの整数が書かれており， i + 1 行目 (1 ≤ i ≤ N) は初期状態における上から i 番目のキャラクターの色を表す（1 は赤を，2 は青を，3は黄を表す）．\nN が 0 のとき入力の終了を示す．データセットの数は 5 を超えない．\n出力\nデータセットごとに, 消滅しないで残っているキャラクター数の最小値 M を１行に出力せよ．\n入出力例\n入力例\n12\n3\n2\n1\n1\n2\n3\n2\n2\n2\n1\n1\n3\n12\n3\n2\n1\n1\n2\n3\n2\n1\n3\n2\n1\n3\n0\n出力例\n3\n12\n上記問題文と自動審判に使われるデータは、\n情報オリンピック日本委員会\nが作成し公開している問題文と採点用テストデータです。"},"candidates":{"kind":"list like","value":[{"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))&¶reru((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}],"string":"[\n {\n \"submission_id\": \"aoj_0534_10576688\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 810,\n \"memory_kb\": 3840,\n \"score_of_the_acc\": -0.9005,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_0534_10508638\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 690,\n \"memory_kb\": 3712,\n \"score_of_the_acc\": -0.7653,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_0534_10508629\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 600,\n \"memory_kb\": 3712,\n \"score_of_the_acc\": -0.6653,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_0534_9030803\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 370,\n \"memory_kb\": 69048,\n \"score_of_the_acc\": -1.4,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_0534_8313518\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 910,\n \"memory_kb\": 3528,\n \"score_of_the_acc\": -1.0069,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_0534_8313510\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 910,\n \"memory_kb\": 3696,\n \"score_of_the_acc\": -1.0095,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_0534_8313457\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 910,\n \"memory_kb\": 3600,\n \"score_of_the_acc\": -1.008,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_0534_6444835\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3552,\n \"score_of_the_acc\": -0.0739,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_0534_5933069\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 3752,\n \"score_of_the_acc\": -0.177,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_0534_5734789\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3072,\n \"score_of_the_acc\": -0.0222,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0534_5734787\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3184,\n \"score_of_the_acc\": -0.0239,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0534_5734785\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3156,\n \"score_of_the_acc\": -0.0235,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0534_5734784\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3152,\n \"score_of_the_acc\": -0.0234,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0534_5734781\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3340,\n \"score_of_the_acc\": -0.0263,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_0534_5484179\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 820,\n \"memory_kb\": 3344,\n \"score_of_the_acc\": -0.9041,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_0534_5044568\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3196,\n \"score_of_the_acc\": -0.0241,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_0534_4557071\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 700,\n \"memory_kb\": 3088,\n \"score_of_the_acc\": -0.7669,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_0534_4479589\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 860,\n \"memory_kb\": 3284,\n \"score_of_the_acc\": -0.9477,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_0534_4083948\",\n \"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))&¶reru((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 }\",\n \"accuracy\": 1,\n \"time_ms\": 730,\n \"memory_kb\": 3316,\n \"score_of_the_acc\": -0.8037,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_0534_3866763\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3196,\n \"score_of_the_acc\": -0.0019,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":377,"cells":{"group_id":{"kind":"string","value":"aoj_0535_cpp"},"problem_description":{"kind":"string","value":"薄氷渡り\n問題\n冬の寒いある日，JOI太郎君は広場にはった薄氷を割って遊ぶことにした．広場は長方形で，東西方向に m 個，南北方向に n 個，つまり， m × n の区画に区切られている．また，薄氷が有る区画と無い区画がある． JOI太郎君は，次のルールにしたがって，薄氷を割りながら区画を移動することにした．\n薄氷があるどの区画からも薄氷を割り始めることができる．\n東西南北のいずれかの方向に隣接し， まだ割られていない薄氷のある区画に移動できる．\n移動した先の区画の薄氷をかならず割る．\nJOI太郎君が薄氷を割りながら移動できる区画数の最大値を求めるプログラムを作成せよ．ただし， 1 ≤ m ≤ 90，1 ≤ n ≤ 90 である．与えられる入力データでは，移動方法は20万通りを超えない．\n入力\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．\n入力は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 となる．\nm, n がともに 0 のとき入力の終了を示す. データセットの数は 5 を超えない．\n出力\nデータセットごとに, 移動できる区画数の最大値を１行に出力せよ．\n入出力例\n入力例\n3\n3\n1 1 0\n1 0 1\n1 1 0\n5\n3\n1 1 1 0 1\n1 1 0 0 0\n1 0 0 0 1\n0\n0\n出力例\n5\n5\n1つ目の入力例に対して，最大値を与える移動方法の例\n2つ目の入力例に対して，最大値を与える移動方法の例\n2つ目の入力例に対して，最大値を与えない移動方法の例\n上記問題文と自動審判に使われるデータは、\n情報オリンピック日本委員会\nが作成し公開している問題文と採点用テストデータです。"},"candidates":{"kind":"list like","value":[{"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}],"string":"[\n {\n \"submission_id\": \"aoj_0535_10863977\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3368,\n \"score_of_the_acc\": -0.4422,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_0535_6799098\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3512,\n \"score_of_the_acc\": -0.5364,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_0535_6704612\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 550,\n \"memory_kb\": 3992,\n \"score_of_the_acc\": -1.368,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_0535_6291342\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3488,\n \"score_of_the_acc\": -0.5544,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_0535_5461017\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3092,\n \"score_of_the_acc\": -0.2821,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0535_5196836\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 870,\n \"memory_kb\": 3428,\n \"score_of_the_acc\": -1.3813,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_0535_5043596\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 870,\n \"memory_kb\": 3904,\n \"score_of_the_acc\": -1.6574,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_0535_4569155\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 870,\n \"memory_kb\": 3884,\n \"score_of_the_acc\": -1.6458,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_0535_3741350\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 3780,\n \"score_of_the_acc\": -0.8939,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_0535_3279115\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 880,\n \"memory_kb\": 3892,\n \"score_of_the_acc\": -1.661,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_0535_3095040\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3200,\n \"score_of_the_acc\": -0.3554,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_0535_3064402\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 880,\n \"memory_kb\": 3840,\n \"score_of_the_acc\": -1.6309,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_0535_2918837\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3384,\n \"score_of_the_acc\": -0.5153,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_0535_2759335\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3132,\n \"score_of_the_acc\": -0.2947,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0535_2678921\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 3124,\n \"score_of_the_acc\": -0.5028,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_0535_2649917\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3036,\n \"score_of_the_acc\": -0.2496,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0535_2638655\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 860,\n \"memory_kb\": 4348,\n \"score_of_the_acc\": -1.9043,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_0535_2274929\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 950,\n \"memory_kb\": 3348,\n \"score_of_the_acc\": -1.42,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_0535_2166962\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3116,\n \"score_of_the_acc\": -0.2854,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0535_2132145\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 2624,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":378,"cells":{"group_id":{"kind":"string","value":"aoj_0531_cpp"},"problem_description":{"kind":"string","value":"ペンキの色\n問題\n情報オリンピックの宣伝のために,長方形のベニヤ板にペンキを塗り看板を制作したい.ベニヤ板には色を塗りたくないところにあらかじめ何枚かの長方形のマスキングテープが貼られている.そこでマスキングテープで区切られた領域ごとに別々の色を使いペンキを塗ることにした.例えば,図 5-1 の場合は 5 色のペンキを使う.\n入力としてマスキングテープを貼る位置が与えられた時,使うペンキの色の数を求めるプログラムを作成せよ.ただし,ベニヤ板全体がマスキングテープで覆われることはなく,全てのマスキングテープの辺はベニヤ板のいずれかの辺に平行である.\n入力\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．\n1 行目にはベニヤ板の幅 w (1 ≤ w ≤ 1000000 となる整数) と高さ h (1 ≤ h ≤ 1000000 となる整数) がこの順に空白区切りで書かれている.\n2 行目にはマスキングテープの数 n (1 ≤ n ≤ 1000 となる整数) が書かれている.\n続く 3 行目以降の 2 + i 行目 (1 ≤ i ≤ n) には,i 番目に貼るマスキングテープの左下の座標 (x\n1\n, y\n1\n) と,右上の座標 (x\n2\n, y\n2\n) が x\n1\n, y\n1\n, x\n2\n, y\n2\n(0 ≤ x\n1\n< x\n2\n≤ w, 0 ≤ y\n1\n< y\n2\n≤ h となる整数) の順に空白区切りで書かれている.\nただし,ベニヤ板の左下の角の座標は (0, 0) で右上の角の座標は (w, h) である. 採点用データのうち, 配点の 30% 分は w ≤ 100, h ≤ 100, n ≤ 100 を満たす.\nh, w がともに 0 のとき入力の終了を示す. データセットの数は 20 を超えない．\n出力\nデータセットごとに使うペンキの色数を１行に出力する.\n入出力例\n次の例は図 5-1 の場合である.\n入力例\n15 6\n10\n1 4 5 6\n2 1 4 5\n1 0 5 1\n6 1 7 5\n7 5 9 6\n7 0 9 2\n9 1 10 5\n11 0 14 1\n12 1 13 5\n11 5 14 6\n0 0\n出力例\n5\n上記問題文と自動審判に使われるデータは、\n情報オリンピック日本委員会\nが作成し公開している問題文と採点用テストデータです。"},"candidates":{"kind":"list like","value":[{"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}],"string":"[\n {\n \"submission_id\": \"aoj_0531_10539526\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3968,\n \"score_of_the_acc\": -0.0072,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0531_10229506\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 100804,\n \"score_of_the_acc\": -1.018,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_0531_9858617\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 34228,\n \"score_of_the_acc\": -0.3193,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_0531_9455954\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 38552,\n \"score_of_the_acc\": -0.4118,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_0531_8861902\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 38792,\n \"score_of_the_acc\": -0.3664,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_0531_8861900\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 1690,\n \"memory_kb\": 87552,\n \"score_of_the_acc\": -1.8633,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_0531_8861899\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 40920,\n \"score_of_the_acc\": -0.3943,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_0531_8861895\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 38900,\n \"score_of_the_acc\": -0.3675,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_0531_8861889\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 64176,\n \"score_of_the_acc\": -0.6282,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_0531_8819601\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 38720,\n \"score_of_the_acc\": -0.3716,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_0531_8819600\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 4580,\n \"score_of_the_acc\": -0.0914,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0531_8819599\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 38476,\n \"score_of_the_acc\": -0.3631,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_0531_8819598\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 38960,\n \"score_of_the_acc\": -0.3741,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_0531_8819597\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 38648,\n \"score_of_the_acc\": -0.3709,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_0531_8819593\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 38944,\n \"score_of_the_acc\": -0.368,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_0531_8807548\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3848,\n \"score_of_the_acc\": -0.006,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0531_8807543\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 38956,\n \"score_of_the_acc\": -0.3681,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_0531_8807539\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 48384,\n \"score_of_the_acc\": -0.4773,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_0531_8314331\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 11448,\n \"score_of_the_acc\": -0.0784,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0531_8214878\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 8148,\n \"score_of_the_acc\": -0.0563,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":379,"cells":{"group_id":{"kind":"string","value":"aoj_0536_cpp"},"problem_description":{"kind":"string","value":"Description fetch failed. Please view: https://onlinejudge.u-aizu.ac.jp/problems/0536"},"candidates":{"kind":"list like","value":[{"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}],"string":"[\n {\n \"submission_id\": \"aoj_0536_10319009\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 4048,\n \"score_of_the_acc\": -1,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_0536_9613012\",\n \"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}}\",\n \"accuracy\": 1,\n \"time_ms\": 760,\n \"memory_kb\": 3684,\n \"score_of_the_acc\": -1.5728,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_0536_6357992\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 3196,\n \"score_of_the_acc\": -0.1806,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0536_6357985\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 3488,\n \"score_of_the_acc\": -0.5233,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_0536_6357983\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 3344,\n \"score_of_the_acc\": -0.3959,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0536_6357978\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 3508,\n \"score_of_the_acc\": -0.5468,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_0536_6357977\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 3480,\n \"score_of_the_acc\": -0.5417,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_0536_6357973\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 3460,\n \"score_of_the_acc\": -0.546,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_0536_6357971\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 3344,\n \"score_of_the_acc\": -0.3959,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0536_6357970\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 3428,\n \"score_of_the_acc\": -0.4529,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_0536_6357966\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 3264,\n \"score_of_the_acc\": -0.302,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0536_6357202\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 3460,\n \"score_of_the_acc\": -0.4904,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_0536_6357200\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 340,\n \"memory_kb\": 3460,\n \"score_of_the_acc\": -0.7265,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_0536_6357194\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 3580,\n \"score_of_the_acc\": -0.6313,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_0536_6357185\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 3480,\n \"score_of_the_acc\": -0.5556,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_0536_6357181\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 3344,\n \"score_of_the_acc\": -0.3959,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0536_6357161\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 3480,\n \"score_of_the_acc\": -0.5139,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_0536_6325009\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 3340,\n \"score_of_the_acc\": -0.2801,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0536_6291345\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 3648,\n \"score_of_the_acc\": -0.8777,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_0536_5044271\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 3260,\n \"score_of_the_acc\": -0.3668,\n \"final_rank\": 4\n }\n]","isConversational":false}}},{"rowIdx":380,"cells":{"group_id":{"kind":"string","value":"aoj_0537_cpp"},"problem_description":{"kind":"string","value":"ビンゴ\n問題\nあるプログラミングコンテストでは,競技後の懇親会でビンゴゲームをする習わしがある．しかし,このビンゴゲームで使うビンゴカードは少々特殊で,以下の条件に従って作成される．\nビンゴカードは N 行 N 列のマス目に区切られており，各マス目には正整数が１つずつ書かれている．それらの整数は全て異なる．\nマス目に書かれている整数は 1 以上 M 以下である．\nビンゴカードに書かれているN×N個の整数の合計は S である．\nどの列を見たときも，上から下に向かって整数は昇順に並んでいる．\nどのマス目の整数も，そのマス目より左の列のどの整数よりも大きい．\n以下は， N = 5, M = 50, S = 685 のときのビンゴカードの例である．\n懇親会のために上の条件を満たすビンゴカードをできるだけたくさん作りたい．ただし，同一のカードを2枚以上作ってはならない．作ることができるビンゴカードの枚数の最大値を 100000 で割った余りを出力するプログラムを作成せよ．\n入力\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．\n入力は1行からなり, その行にはビンゴカードのサイズ N (1≤N≤7), マス目に書かれている整数の上限 M (1≤M≤2000),ビンゴカードに書かれている整数の合計 S (1≤S≤3000) を表す3つの正整数が空白区切りで書かれている．ただし, 与えられるどの入力データにおいても，条件を満たすビンゴカードを1枚以上作ることができる．\nN, M, S が 0 のとき入力の終了を示す. データセットの数は 5 を超えない．\n出力\nデータセットごとに, 作ることができるビンゴカードの枚数の最大値を 100000 で割った余りを1行に出力せよ．\n入出力例\n入力例\n3 9 45\n3 100 50\n5 50 685\n0 0 0\n出力例\n1\n7\n74501\n3つ目の入力例に対して，作ることができるビンゴカードの枚数の最大値は 642499974501 であるので， 100000 で割った余りの 74501 を出力する．\n上記問題文と自動審判に使われるデータは、\n情報オリンピック日本委員会\nが作成し公開している問題文と採点用テストデータです。"},"candidates":{"kind":"list like","value":[{"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}],"string":"[\n {\n \"submission_id\": \"aoj_0537_9596124\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 800,\n \"memory_kb\": 5252,\n \"score_of_the_acc\": -1.0549,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_0537_8861602\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 3988,\n \"score_of_the_acc\": -0.1193,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_0537_8861601\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 3960,\n \"score_of_the_acc\": -0.1185,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_0537_8861597\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 3960,\n \"score_of_the_acc\": -0.1757,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_0537_8861596\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 4072,\n \"score_of_the_acc\": -0.1217,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_0537_8861594\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 3300,\n \"score_of_the_acc\": -0.1143,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0537_8861593\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 3784,\n \"score_of_the_acc\": -0.1136,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0537_8836844\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 38880,\n \"score_of_the_acc\": -1.1143,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_0537_8819273\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 3976,\n \"score_of_the_acc\": -0.119,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_0537_8819271\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 3636,\n \"score_of_the_acc\": -0.1094,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0537_8819268\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 3996,\n \"score_of_the_acc\": -0.1338,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_0537_8819264\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 3716,\n \"score_of_the_acc\": -0.126,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_0537_8819263\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 3976,\n \"score_of_the_acc\": -0.1476,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_0537_8819261\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 4168,\n \"score_of_the_acc\": -0.0244,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0537_8819260\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 3816,\n \"score_of_the_acc\": -0.1288,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_0537_8819257\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 4012,\n \"score_of_the_acc\": -0.12,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_0537_8810276\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 3564,\n \"score_of_the_acc\": -0.1217,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_0537_8810275\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 3908,\n \"score_of_the_acc\": -0.1171,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_0537_8810273\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 3816,\n \"score_of_the_acc\": -0.1145,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0537_8810271\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 4008,\n \"score_of_the_acc\": -0.1199,\n \"final_rank\": 10\n }\n]","isConversational":false}}},{"rowIdx":381,"cells":{"group_id":{"kind":"string","value":"aoj_0540_cpp"},"problem_description":{"kind":"string","value":"あみだくじ\n問題\nあなたは J 君と一緒にあみだくじを使って遊んでいる.あみだくじは\nn\n本の縦棒と\nm\n本の横棒からなる.縦棒には左から順に 1 から\nn\nの番号がついており,縦棒\ni\nの下端には正整数\ns\ni\nが書かれている.\n図 3-1 あみだくじの例(\nn\n= 4,\nm\n= 5,\ns\n1\n= 20,\ns\n2\n= 80,\ns\n3\n= 100,\ns\n4\n= 50)\n縦棒\ni\nの一番上から順に道をたどっていき到達した下端に書かれている整数が, 縦\n棒\ni\nを選んだ場合の得点である.例えば,図 3-1 では,縦棒 1 を選ぶと得点は 80 点\nであり,縦棒 2 を選ぶと得点は 100 点である.\n図 3-2 道のたどり方の例\nJ 君は縦棒 1 から縦棒\nk\nまでの連続した\nk\n本を選ぶことにした.それら\nk\n本の縦棒を選んだときの点数の合計が J 君の得点となる.ただし,あなたはあみだくじ内の\n横棒を一本選び,その横棒をあみだくじから削除することができる. (削除しなくてもよい.) もし,あなたが横棒を一本削除した場合は,削除後のあみだくじにおいて,\n縦棒 1 から縦棒\nk\nまでの連続した\nk\n本の縦棒を選んだときの点数の合計が J 君の得点となる.\n入力としてあみだくじの形と J 君の選ぶ縦棒の本数\nk\nが与えられたとき,J 君の得\n点の最小値を求めるプログラムを作成せよ.\n入力\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．\n1 行目には 4 つの整数\nn\n,\nm\n,\nh\n,\nk\nが空白区切りで書かれている.\nn\n(2 ≤\nn\n≤ 1000) は縦棒の本数を,\nm\n(1 ≤\nm\n≤ 100000) は横棒の本数を,\nh\n(2 ≤\nh\n≤ 1000) は縦棒の長さを,\nk\n(1 ≤\nk\n≤ n) は J 君が選ぶ縦棒の本数を表す.\n続く\nn\n行には縦棒の下端に書かれている点数が書かれている.\ni\n+ 1 行目 (1 ≤\ni\n≤ n)には正整数\ns\ni\nが書かれている. また,\ns\n1\n+\ns\n2\n+ ... +\ns\nn\n≤ 2000000000 = 2 × 10\n9\nを満たす.\n続く\nm\n行には横棒の位置が書かれている.横棒には 1 から\nm\nまでの番号がついている.\ni\n+\nn\n+ 1 行目 (1 ≤\ni\n≤\nm\n) には, 横棒\ni\nの位置を表す 2 つの整数\na\ni\n,\nb\ni\n(1 ≤\na\ni\n≤\nn\n- 1, 1 ≤\nb\ni\n≤\nh\n- 1) が空白区切りで書かれており,横棒\ni\nが縦棒\na\ni\nと縦棒\na\ni\n+ 1 を結び, 横棒\ni\nの上端からの距離が\nb\ni\nであることを表す. ただし,どの 2 つの横棒も端点を共有することはない.\n採点用データのうち,配点の 20 % 分は横棒を削除しない場合に J 君の得点が最少となる.また,配点の 30 % 分は\nn\n≤ 20,\nm\n≤ 30,\nh\n≤ 10 を満たし,配点の 60 % 分は\nm\n≤ 1000 を満たす.\n入力の終わりは 4つのゼロを含む行で示される. データセットの数は 10 を超えない．\n出力\nデータセットごとに, J 君の得点の最小値を1 行に出力する.\n入出力例\n入力例\n4 5 7 2\n20\n80\n100\n50\n1 1\n2 6\n2 3\n1 5\n3 1\n2 2 5 1\n10\n20\n1 1\n1 3\n0 0 0 0\n出力例\n100\n10\n1つ目の例 は図 3-1 に対応し,あなたが横棒 4 (縦棒 1 と縦棒 2 を上端から距離 5 の場所で結ぶ横棒)を削除したとき,J 君の得点は最小になる.例 2 では,あなたが横棒を削除しない場合に J 君の得点が最小になる. (図3-3 を見よ.)\n図 3-3\n上記問題文と自動審判に使われるデータは、\n情報オリンピック日本委員会\nが作成し公開している問題文と採点用テストデータです。"},"candidates":{"kind":"list like","value":[{"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}],"string":"[\n {\n \"submission_id\": \"aoj_0540_10848631\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 6028,\n \"score_of_the_acc\": -0.2268,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_0540_9906738\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4848,\n \"score_of_the_acc\": -0.1518,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_0540_9596147\",\n \"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}}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 5324,\n \"score_of_the_acc\": -0.182,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_0540_9287134\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4880,\n \"score_of_the_acc\": -0.0669,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0540_9280250\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 5140,\n \"score_of_the_acc\": -0.2573,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_0540_9280092\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 19564,\n \"score_of_the_acc\": -2,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_0540_8941355\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3828,\n \"score_of_the_acc\": -0.087,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0540_8309340\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 5124,\n \"score_of_the_acc\": -0.2128,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_0540_7978119\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5344,\n \"score_of_the_acc\": -0.0963,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_0540_7976285\",\n \"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);\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 15044,\n \"score_of_the_acc\": -1.0171,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_0540_6884376\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 5284,\n \"score_of_the_acc\": -0.223,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_0540_6347270\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4080,\n \"score_of_the_acc\": -0.016,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0540_6146442\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5516,\n \"score_of_the_acc\": -0.1507,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_0540_6089697\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5068,\n \"score_of_the_acc\": -0.0788,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0540_5515769\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4584,\n \"score_of_the_acc\": -0.135,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_0540_5484231\",\n \"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\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4320,\n \"score_of_the_acc\": -0.0313,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0540_5201211\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 4268,\n \"score_of_the_acc\": -0.2454,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_0540_5124801\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4600,\n \"score_of_the_acc\": -0.0925,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_0540_4936008\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 12032,\n \"score_of_the_acc\": -0.6083,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_0540_4819373\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5240,\n \"score_of_the_acc\": -0.0897,\n \"final_rank\": 6\n }\n]","isConversational":false}}},{"rowIdx":382,"cells":{"group_id":{"kind":"string","value":"aoj_0538_cpp"},"problem_description":{"kind":"string","value":"IOIOI\n問題\n整数\nn\n(1 ≤\nn\n) に対し,\nn\n+ 1 個の\nI\nと\nn\n個の\nO\nを\nI\nから始めて交互に並べてできる文字列を\nP\nn\nとする.ここで\nI\nと\nO\nはそれぞれ英大文字のアイとオーである.\nP\n1\nIOI\nP\n2\nIOIOI\nP\n3\nIOIOIOI\n.\n.\n.\nP\nn\nIOIOIO ... OI\n(\nO\nが\nn\n個)\n図 1-1 本問で考える文字列\nP\nn\n整数\nn\nと, I と O のみからなる文字列\ns\nが与えられた時,\ns\nの中に\nP\nn\nが何ヶ所含まれているかを出力するプログラムを作成せよ.\n例\nn\nが 1,\ns\nが\nOOIOIOIOIIOII\nの場合,\nP\n1\nは\nIOI\nであり,下図 1-2 に示した 4ヶ所に含まれている.よって,出力は 4 である.\nOO\nIOI\nOIOIIOII\nOOIO\nIOI\nOIIOII\nOOIOIO\nIOI\nIOII\nOOIOIOIOI\nIOI\nI\n図 1-2\nn\nが 1,\ns\nが\nOOIOIOIOIIOII\nの場合の例\nn\nが 2,\ns\nが\nOOIOIOIOIIOII\nの場合,\nP\n2\nは\nIOIOI\nであり,下図 1-3 に示した 2ヶ所に含まれている.よって,出力は 2 である.\nOO\nIOIOI\nOIIOII\nOOIO\nIOIOI\nIOII\n図 1-3\nn\nが 2,\ns\nが\nOOIOIOIOIIOII\nの場合の例\n入力\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．\n1 行目には整数\nn\n(1 ≤\nn\n≤ 1000000) が書かれている.\n2 行目には整数\nm\n(1 ≤\nm\n≤ 1000000) が書かれている.\nm\nは\ns\nの文字数を表す.\n3 行目には文字列\ns\nが書かれている.\ns\nは\nI\nと\nO\nのみからなる.\n全ての採点用データで, 2\nn\n+ 1 ≤\nm\nである.採点用データのうち, 配点の 50% 分については,\nn\n≤ 100,\nm\n≤ 10000 を満たす.\nn\nが 0 のとき入力の終了を示す. データセットの数は 10 を超えない．\n出力\nデータセットごとに,文字列\ns\nに文字列\nP\nn\nが何ヶ所含まれるかを表す 1 つの整数を1 行に出力する.\ns\nに\nP\nn\nが含まれていない場合は,整数として\n0\nを出力せよ.\n入出力例\n入力例\n1\n13\nOOIOIOIOIIOII\n2\n13\nOOIOIOIOIIOII\n0\n出力例\n4\n2\n上記問題文と自動審判に使われるデータは、\n情報オリンピック日本委員会\nが作成し公開している問題文と採点用テストデータです。"},"candidates":{"kind":"list like","value":[{"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}],"string":"[\n {\n \"submission_id\": \"aoj_0538_10864946\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5128,\n \"score_of_the_acc\": -0.023,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0538_6862796\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 9204,\n \"score_of_the_acc\": -0.0923,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_0538_6347200\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 7144,\n \"score_of_the_acc\": -0.0573,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_0538_6131113\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5060,\n \"score_of_the_acc\": -0.0219,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0538_5793290\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4924,\n \"score_of_the_acc\": -0.0196,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0538_5737757\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 3948,\n \"score_of_the_acc\": -0.8977,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_0538_5473629\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3772,\n \"score_of_the_acc\": -0.0526,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0538_5379674\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 3812,\n \"score_of_the_acc\": -0.7902,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_0538_5309003\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 62624,\n \"score_of_the_acc\": -1.1053,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_0538_5196860\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 9380,\n \"score_of_the_acc\": -0.1479,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_0538_5131021\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5080,\n \"score_of_the_acc\": -0.0222,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0538_4677108\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 6816,\n \"score_of_the_acc\": -0.3149,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_0538_4260007\",\n \"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*/\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3908,\n \"score_of_the_acc\": -0.0549,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_0538_4253607\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 11824,\n \"score_of_the_acc\": -0.1368,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_0538_3952860\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4468,\n \"score_of_the_acc\": -0.0645,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_0538_3519159\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 3924,\n \"score_of_the_acc\": -1.0026,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_0538_3396149\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 3820,\n \"score_of_the_acc\": -0.9482,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_0538_3394000\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3912,\n \"score_of_the_acc\": -0.055,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_0538_3367399\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3856,\n \"score_of_the_acc\": -0.0541,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_0538_3340812\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3840,\n \"score_of_the_acc\": -0.0538,\n \"final_rank\": 6\n }\n]","isConversational":false}}},{"rowIdx":383,"cells":{"group_id":{"kind":"string","value":"aoj_0545_cpp"},"problem_description":{"kind":"string","value":"パーティー\n問題\nあなたはクリスマスパーティーに学校内の自分の友達と，自分の友達の友達を招待することにした．\nあなたの通う学校の生徒数は n 人であり，それぞれの生徒には 1 から n までの番号が割り振られている．\nあなたの番号は 1 である．\nあなたの手元には，誰と誰が友達であるかを記したリストがある．\nこのリストをもとに，\nあなたがクリスマスパーティーに招待する生徒数を求めるプログラムを作成せよ．\n入力\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．\nデータセットの1 行目には学校の生徒数 n （2 ≤ n ≤ 500）が，\n2 行目にはリストの長さ m （1 ≤ m ≤ 10000）が書かれている．\n入力は全部で 2+m 行からなる．2+i 行目（1 ≤ i ≤ m）には 2 つの整数 a\ni\nと b\ni\n（1 ≤ a\ni\n< b\ni\n≤ n）が空白区切りで書かれており，番号 a\ni\nと番号 b\ni\nの生徒が友達同士であることを表す．\n3 行目から 2+m 行目には同じ友達関係を表す行が重複して現れることはない．\nn, m がともに 0 のとき入力の終了を示す.データセットの数は 5 を超えない．\n出力\nデータセットごとに，あなたがクリスマスパーティーに招待する生徒数を1 行に出力する．\n入出力例\n入力例\n6\n5\n1 2\n1 3\n3 4\n2 3\n4 5\n6\n5\n2 3\n3 4\n4 5\n5 6\n2 5\n0\n0\n出力例\n3\n0\n1つ目の入力例 において，あなたの友達は番号 2 と番号 3 の生徒の 2 人である．\nまた，番号 3 と番号 4 の生徒は友達同士であるので，\n番号 4 の生徒はあなたの友達の友達である．\n番号 5 と番号 6 の生徒はあなたの友達でもなく，あなたの友達の友達でもない．\nしたがって，あなたは番号 2,3,4 の 3 人の生徒をクリスマスパーティーに招待する．\n2つ目の入力例 において，あなたには友達はいない．\nしたがって，あなたがクリスマスパーティーに招待する生徒数は 0 人である．\n上記問題文と自動審判に使われるデータは、\n情報オリンピック日本委員会\nが作成し公開している問題文と採点用テストデータです。"},"candidates":{"kind":"list like","value":[{"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))&¶reru((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}],"string":"[\n {\n \"submission_id\": \"aoj_0545_3395409\",\n \"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))&¶reru((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 }\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 5096,\n \"score_of_the_acc\": -1.5,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_0545_3037364\",\n \"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 */\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 4068,\n \"score_of_the_acc\": -1.0666,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0545_2964632\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3908,\n \"score_of_the_acc\": -0.9992,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0545_2612349\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 3124,\n \"score_of_the_acc\": -1.1686,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0545_2158260\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 3964,\n \"score_of_the_acc\": -0.9513,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0545_2089822\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 2724,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":384,"cells":{"group_id":{"kind":"string","value":"aoj_0542_cpp"},"problem_description":{"kind":"string","value":"認証レベル\n問題\nあなたは Just Odd Inventions 社を知っているだろうか? この会社の業務は「ただ奇妙な発明 (just odd inventions)」をすることである.ここでは略して JOI 社と呼ぶ.\nJOI 社には 2 つの事務所があり,それぞれ同じ大きさの正方形の部屋がマス目状に並んでできている.辺で接しているすべての部屋の間に,身分証による認証機能の付いた扉がある.JOI 社では様々なレベルの機密情報を扱っているため,部屋ごとに機密レベルという正の整数が設定されており,身分証の事務所ごとに定められた非負整数の認証レベルが,機密レベル以上でないとその部屋に入室することができない.各事務所の出入り口は唯一あるエレベーターホールのみで,エレベーターホールの部屋の機密レベルは最低の 1 である.その事務所についての認証レベルが 0 のときはエレベーターホールに入ることさえできない.\nJOI 社では,社長の突発的な提案で,一般の人に社内を見学してもらうツアーを実施することになった.あなたは見学者に渡す身分証の認証レベルの組み合わせを決める必要がある.見学者は開けられる扉を見つけると必ず開けて中に入る (同じ部屋を何度も訪れることも可能である).そのため,必要以上に見学者の身分証の認証レベルを高くしたくはない.しかし,ツアーに魅力を持たせるため,ツアーではエレベーターホールの部屋を含め 2 つの事務所であわせて R 個以上の部屋を訪れることができるようにする必要がある.身分証の認証レベルを低くしすぎると,この条件を満たすことができないかもしれない.\nJOI 社には事務所が 2 個あり,第\nk\n事務所 (\nk\n= 1, 2) の部屋は東西方向に\nW\nk\n個,南北方向に\nH\nk\n個並んでおり,全部で\nW\nk\n×\nH\nk\n個ある. 西から\ni\n番目,北から\nj\n番目の部屋を (\ni\n,\nj\n)\nk\nで表すことにする.\nW\nk\nと\nH\nk\nと\nR\nの値,エレベーターホールの位置 (\nX\nk\n,\nY\nk\n)\nk\n,各部屋の機密レベルが与えられたとき,見学者が 2 つの事務所であわせて\nR\n個以上の部屋を訪れることができるための,見学者の身分証の認証レベルの和の最小値を求めるプログラムを作成せよ.\nなお,JOI 社が「ただ奇妙な発明」をすることでどうやって利益を得ているかは,社内でも最高機密であり社長以外の誰も知らない.\n入力\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．\n1 行目には正整数 R (1 ≤\nR\n≤ 100000) が書かれている.2 行目以降には,2 つの事務所のデータが順に与えられる.\n事務所のデータは,最初の行に正整数\nW\nk\n,\nH\nk\n,\nX\nk\n,\nY\nk\n(1 ≤\nX\nk\n≤\nW\nk\n≤ 500, 1 ≤\nY\nk\n≤\nH\nk\n≤ 500), 続く\nH\nk\n行の\nj\n行目の\ni\n番目に, 部屋 (\ni\n,\nj\n)\nk\nの機密レベルを表す整数\nL\nk, i,j\n(1 ≤\nL\nk,i,j\n< 100000000 = 10\n8\n) として与えられる.\nまた,\nR\n≤\nW\n1\n×\nH\n1\n+\nW\n2\n×\nH\n2\nを満たす.\n採点用データのうち, 配点の 30% 分については,\nR\n,\nW\nk\n,\nH\nk\n≤ 100 を満たす.\nR\nが 0 のとき入力の終了を示す. データセットの数は 10 を超えない．\n出力\nデータセットごとに,求める身分証の認証レベルの和の最小値を 1 行に出力する.\n入出力例\n入力例\n5\n2 2 1 2\n9 5\n1 17\n3 2 2 1\n6 1 20\n8 18 3\n8\n5 4 1 3\n5 5 4 5 5\n8 2 1 9 7\n1 1 3 5 1\n7 2 7 1 3\n6 5 6 2\n2 3 5 8 2 7\n1 6 9 4 5 1\n2 4 5 4 2 2\n5 4 2 5 3 3\n7 1 5 1 5 6\n6\n3 3 2 2\n2 9 2\n9 1 9\n2 9 2\n2 2 1 1\n1 3\n5 7\n0\n出力例\n15\n4\n9\n1つ目の例 では,見学者に渡す身分証の認証レベルを,事務所 1 の認証レベルが 9,事務所 2 の認証レベルが 6 となるように設定すると,見学者は 5 個の部屋 (事務所 1 の部屋 (1, 1)\n1\n, (1, 2)\n1\n, (2, 1)\n1\nと,事務所 2 の部屋 (1, 1)\n2\n, (2, 1)\n2\n) を訪れることができる.このとき,認証レベルの和は 15 となる.これが合計 5 個以上の部屋を訪れることができるための認証レベルの和の最小値である.\n３つ目の例 では,見学者に渡す身分証の認証レベルを,事務所 1 の認証レベルが 9,事務所 2 の認証レベルが 0 となるように設定すると,見学者は 9 個の部屋 (事務所 1 の部屋 (1, 1)\n1\n, (1, 2)\n1\n, (1, 3)\n1\n, (2, 1)\n1\n, (2, 2)\n1\n, (2, 3)\n1\n, (3, 1)\n1\n, (3, 2)\n1\n, (3, 3)\n1\n) を訪れることができる.事務所 2 の部屋は 1 個も訪れることができない.(エレベーターホール (1, 1)\n2\nにすら入ることができない.) このとき,認証レベルの和は 9 となる.これが合計 6 個以上の部屋を訪れることができるための認証レベルの和の最小値である.\n上記問題文と自動審判に使われるデータは、\n情報オリンピック日本委員会\nが作成し公開している問題文と採点用テストデータです。"},"candidates":{"kind":"list like","value":[{"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}],"string":"[\n {\n \"submission_id\": \"aoj_0542_10854022\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 12120,\n \"score_of_the_acc\": -0.7593,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_0542_10525125\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 6496,\n \"score_of_the_acc\": -0.1117,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0542_9613029\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 10284,\n \"score_of_the_acc\": -0.7182,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_0542_8967568\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 31132,\n \"score_of_the_acc\": -1.315,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_0542_7937638\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 7184,\n \"score_of_the_acc\": -0.2141,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_0542_7937637\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 7280,\n \"score_of_the_acc\": -0.2162,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_0542_7937633\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 7624,\n \"score_of_the_acc\": -0.8326,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_0542_7937603\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 7644,\n \"score_of_the_acc\": -0.3548,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_0542_7937593\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 7352,\n \"score_of_the_acc\": -0.3483,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_0542_7937590\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 7640,\n \"score_of_the_acc\": -0.2678,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_0542_7937561\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 6472,\n \"score_of_the_acc\": -0.1112,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0542_7937560\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 8440,\n \"score_of_the_acc\": -1.0683,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_0542_7937559\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 6452,\n \"score_of_the_acc\": -0.7195,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_0542_7937558\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 7080,\n \"score_of_the_acc\": -0.2118,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0542_7937557\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5768,\n \"score_of_the_acc\": -0.0085,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0542_7937548\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 7552,\n \"score_of_the_acc\": -0.7875,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_0542_7937532\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 7692,\n \"score_of_the_acc\": -0.3559,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_0542_7937520\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 5388,\n \"score_of_the_acc\": -0.1739,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0542_6899438\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 19668,\n \"score_of_the_acc\": -1.2324,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_0542_6331196\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 50096,\n \"score_of_the_acc\": -1.8696,\n \"final_rank\": 20\n }\n]","isConversational":false}}},{"rowIdx":385,"cells":{"group_id":{"kind":"string","value":"aoj_0547_cpp"},"problem_description":{"kind":"string","value":"通勤経路\n問題\nJOIさんが住むカナダのある都市は，南北方向にまっすぐに伸びる w 本の道路と，東西方向にまっすぐに伸びる h 本の道路により，碁盤の目の形に区分けされている．\n南北方向の w 本の道路には，西から順に 1, 2, ... , w の番号が付けられている．また，東西方向の h 本の道路には，南から順に 1, 2, ... , h の番号が付けられている．西から i 番目の南北方向の道路と，南から j 番目の東西方向の道路が交わる交差点を (i, j) で表す．\nJOIさんは，交差点 (1, 1) の近くに住んでおり，交差点 (w, h) の近くの会社に車で通っている．車は道路に沿ってのみ移動することができる．JOIさんは，通勤時間を短くするため，東または北にのみ向かって移動して通勤している．また，この都市では，交通事故を減らすために，次のような交通規則が設けられている：\n交差点を曲がった車は，その直後の交差点で曲がることは出来ない．\nすなわち，交差点で曲がったあとに1ブロックだけ進んで再び曲がることは許されない．このとき，JOIさんの通勤経路は何通り考えられるだろうか．\nw と h が与えられたとき，JOIさんの通勤経路の個数を 100000 で割った余りを出力するプログラムを作成せよ．\n入力\n入力は複数のデータセットからなる．各データセットは1行からなり，空白を区切りとして2個の整数 w, h (2 ≤ w ≤ 100， 2 ≤ h ≤ 100) が書かれている．w は南北方向の道路の本数， h は東西方向の道路の本数を表す．\nw, h がともに 0 のとき入力の終了を示す.データセットの数は 5 を超えない．\n出力\nデータセットごとに，JOIさんの通勤経路の個数を 100000 で割った余りを1行に出力する．\n入出力例\n入力例\n3 4\n15 15\n0 0\n出力例\n5\n43688\n1つ目の入力例におけるJOIさんの通勤経路 ( 5 通り)\n1つ目の入力例において，JOIさんの通勤経路は図のように 5 通り考えられる．したがって，5を出力する．\n2つ目の入力例において，JOIさんの通勤経路は 143688 通り考えられる．したがって，143688 を 100000 で割った余りである 43688 を出力する．\n上記問題文と自動審判に使われるデータは、\n情報オリンピック日本委員会\nが作成し公開している問題文と採点用テストデータです。"},"candidates":{"kind":"list like","value":[{"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}],"string":"[\n {\n \"submission_id\": \"aoj_0547_3813319\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3316,\n \"score_of_the_acc\": -0.0934,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0547_2463342\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 10896,\n \"score_of_the_acc\": -1.3899,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0547_1642647\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 26496,\n \"score_of_the_acc\": -1,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0547_528467\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 17124,\n \"score_of_the_acc\": -1.1334,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0547_228984\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 928,\n \"score_of_the_acc\": -0.5,\n \"final_rank\": 2\n }\n]","isConversational":false}}},{"rowIdx":386,"cells":{"group_id":{"kind":"string","value":"aoj_0539_cpp"},"problem_description":{"kind":"string","value":"ピザ\n問題\nJOI ピザでは,市の中心部を通る全長\nd\nメートルの環状線の沿線上でピザの宅配販\n売を行っている.\nJOI ピザは,環状線上に\nn\n個の店舗\nS\n1\n, ... ,\nS\nn\nを持つ.本店は\nS\n1\nである.\nS\n1\nから\nS\ni\nまで,時計回りに環状線を移動したときの道のりを\nd\ni\nメートルとおく.\nd\n2\n, ... ,\nd\nn\nは 1 以上\nd\n- 1 以下の整数である.\nd\n2\n, ... ,\nd\nn\nは全て異なる. ピザの注文を受けると, ピザが冷めないように, 宅配先までの移動距離がもっとも短い店舗でピザを焼き宅配する.\n宅配先の位置は 0 以上\nd\n- 1 以下の整数\nk\nで表される.これは, 本店\nS\n1\nから宅配先までに時計回りで環状線を移動したときの道のりが\nk\nメートルであることを意味する. ピザの宅配は環状線に沿って行われ, それ以外の道を通ることは許されない. ただし, 環状線上は時計回りに移動しても反時計回りに移動してもよい.\n例えば,店舗の位置と宅配先の位置が下図のようになっている場合 (この例は「入出力の例」の例 1 と対応している),\n宅配先 1 にもっとも近い店舗は\nS\n2\nなので, 店舗\nS\n2\nから宅配する.このとき, 店舗からの移動距離は 1 である.また, 宅配先 2 にもっとも近い店舗は\nS\n1\n(本店) なので, 店舗\nS\n1\n(本店) から宅配する.このとき,店舗からの移動距離は 2 である.\n環状線の全長\nd\n, JOI ピザの店舗の個数\nn\n, 注文の個数\nm\n, 本店以外の位置を表す\nn\n- 1 個の整数\nd\n2\n, ... ,\nd\nn\n, 宅配先の場所を表す整数\nk\n1\n, ... ,\nk\nm\nが与えられたとき, 各注文に対する宅配時の移動距離 (すなわち,最寄店舗から宅配先までの道のり) の全注文にわたる総和を求めるプログラムを作成せよ.\n入力\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．\n1 行目には環状線の全長を表す正整数\nd\n(2 ≤\nd\n≤ 1000000000 = 10\n9\n), 2 行目には店舗の個数を表す正整数\nn\n(2 ≤\nn\n≤ 100000), 3 行目には注文の個数を表す正整数\nm\n(1 ≤\nm\n≤ 10000) が書かれている. 4 行目以降の\nn\n- 1 行には本店以外の店舗の位置を表す整数\nd\n2\n,\nd\n3\n, ... ,\nd\nn\n(1 ≤\nd\ni\n≤\nd\n- 1) がこの順に書かれており,\nn\n+ 3 行目以降の\nm\n行には宅配先の場所を表す整数\nk\n1\n,\nk\n2\n, ... ,\nk\nm\n(0 ≤\nk\ni\n≤\nd\n- 1) がこの順に書かれている.\n採点用データのうち,配点の 40% 分については, n ≤ 10000 を満たす. また,配点の 40% 分については, 求める移動距離の総和と\nd\nの値はともに 1000000 以下である. さらに,全ての採点用データにおいて, 求める移動距離の総和は 1000000000 = 10\n9\n以下である.\nd\nが 0 のとき入力の終了を示す. データセットの数は 10 を超えない．\n出力\nデータセットごとに,宅配時の移動距離の総和を表す 1 つの整数を1 行に出力する.\n入出力例\n入力例\n8\n3\n2\n3\n1\n4\n6\n20\n4\n4\n12\n8\n16\n7\n7\n11\n8\n0\n出力例\n3\n3\n上記問題文と自動審判に使われるデータは、\n情報オリンピック日本委員会\nが作成し公開している問題文と採点用テストデータです。"},"candidates":{"kind":"list like","value":[{"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}],"string":"[\n {\n \"submission_id\": \"aoj_0539_10890669\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3660,\n \"score_of_the_acc\": -0.2552,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_0539_10851299\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3188,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0539_10525085\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4224,\n \"score_of_the_acc\": -0.4667,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_0539_10422110\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3992,\n \"score_of_the_acc\": -0.4047,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_0539_10346687\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 3192,\n \"score_of_the_acc\": -0.4486,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_0539_9804255\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3696,\n \"score_of_the_acc\": -0.2714,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_0539_9804248\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3728,\n \"score_of_the_acc\": -0.2858,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_0539_9028691\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3896,\n \"score_of_the_acc\": -0.3189,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_0539_9023911\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3500,\n \"score_of_the_acc\": -0.1405,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0539_8484198\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3496,\n \"score_of_the_acc\": -0.1387,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0539_8479032\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4012,\n \"score_of_the_acc\": -0.4137,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_0539_8479024\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3620,\n \"score_of_the_acc\": -0.2371,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_0539_8478995\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3756,\n \"score_of_the_acc\": -0.2984,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_0539_7895513\",\n \"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);\",\n \"accuracy\": 1,\n \"time_ms\": 480,\n \"memory_kb\": 5408,\n \"score_of_the_acc\": -2,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_0539_7082700\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3532,\n \"score_of_the_acc\": -0.1975,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0539_6922492\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3720,\n \"score_of_the_acc\": -0.2822,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_0539_6860439\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3524,\n \"score_of_the_acc\": -0.1939,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0539_6739334\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3756,\n \"score_of_the_acc\": -0.2559,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_0539_6444861\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3748,\n \"score_of_the_acc\": -0.2523,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_0539_6347232\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4560,\n \"score_of_the_acc\": -0.618,\n \"final_rank\": 19\n }\n]","isConversational":false}}},{"rowIdx":387,"cells":{"group_id":{"kind":"string","value":"aoj_0546_cpp"},"problem_description":{"kind":"string","value":"カード並べ\n問題\n花子さんは n 枚（4 ≤ n ≤ 10）のカードを並べて遊んでいる．\nそれぞれのカードには 1 以上 99 以下の整数が 1 つずつ書かれている．\n花子さんは，これらのカードの中から k 枚（2 ≤ k ≤ 4）を選び，\n横一列に並べて整数を作ることにした．\n花子さんは全部で何種類の整数を作ることができるだろうか．\n例えば，1, 2, 3, 13, 21 の 5 枚のカードが与えられ，そこから 3 枚を選び整数を作ることを考える．\n2, 1, 13 をこの順に並べると，整数 2113 を作ることができる．\nまた，21, 1, 3 をこの順に並べても，同じ整数 2113 を作ることができる．\nこのように，異なるカードの組み合わせから同じ整数が作られることもある．\nn 枚のカードに書かれた整数が与えられたとき，\nその中から k 枚を選び，横一列に並べることで作ることができる整数の個数を求めるプログラムを作成せよ．\n入力\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．\n各データセットは 2+n 行からなる．\n1 行目にはカードの枚数 n （4 ≤ n ≤ 10）が，\n2 行目にはカードを選ぶ枚数 k （2 ≤ k ≤ 4）が書かれている．\n2+i 行目（1 ≤ i ≤ n）には i 枚目のカードに書かれている 1 以上 99 以下の整数が書かれている．\nn, k がともに 0 のとき入力の終了を示す.データセットの数は 5 を超えない．\n出力\nデータセットごとに，花子さんが作ることができる整数の個数を1 行に出力する．\n入出力例\n入力例\n4\n2\n1\n2\n12\n1\n6\n3\n72\n2\n12\n7\n2\n1\n0\n0\n出力例\n7\n68\n1つ目の入力例 において，\n1, 2, 12, 1 の 4 枚のカードの中から 2 枚を選び，横一列に並べて作ることができる整数は，\n11, 12, 21, 112, 121, 122, 212 の 7 個である．\n上記問題文と自動審判に使われるデータは、\n情報オリンピック日本委員会\nが作成し公開している問題文と採点用テストデータです。"},"candidates":{"kind":"list like","value":[{"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}],"string":"[\n {\n \"submission_id\": \"aoj_0546_10865043\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 980,\n \"memory_kb\": 3596,\n \"score_of_the_acc\": -0.9974,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_0546_10117410\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 1000,\n \"memory_kb\": 8256,\n \"score_of_the_acc\": -1.2041,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_0546_9568221\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 880,\n \"memory_kb\": 3608,\n \"score_of_the_acc\": -0.8969,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_0546_9000957\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 3308,\n \"score_of_the_acc\": -0.2384,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_0546_7638859\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 900,\n \"memory_kb\": 3648,\n \"score_of_the_acc\": -0.9187,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_0546_7622294\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 3528,\n \"score_of_the_acc\": -0.3179,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_0546_6426145\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 860,\n \"memory_kb\": 3348,\n \"score_of_the_acc\": -0.8663,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_0546_5880352\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 28148,\n \"score_of_the_acc\": -1.0505,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_0546_5518000\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 3640,\n \"score_of_the_acc\": -0.1709,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_0546_5054508\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 910,\n \"memory_kb\": 3712,\n \"score_of_the_acc\": -0.9313,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_0546_5048269\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 760,\n \"memory_kb\": 3412,\n \"score_of_the_acc\": -0.7678,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_0546_4576776\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3224,\n \"score_of_the_acc\": -0.0431,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0546_4564684\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 750,\n \"memory_kb\": 3268,\n \"score_of_the_acc\": -0.752,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_0546_4461477\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 740,\n \"memory_kb\": 3424,\n \"score_of_the_acc\": -0.7481,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_0546_4428292\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 3236,\n \"score_of_the_acc\": -0.0941,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_0546_3840633\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3432,\n \"score_of_the_acc\": -0.011,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0546_3834584\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3168,\n \"score_of_the_acc\": -0.051,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_0546_3834582\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3156,\n \"score_of_the_acc\": -0.0505,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0546_3765365\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3196,\n \"score_of_the_acc\": -0.042,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0546_3765362\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3188,\n \"score_of_the_acc\": -0.0417,\n \"final_rank\": 2\n }\n]","isConversational":false}}},{"rowIdx":388,"cells":{"group_id":{"kind":"string","value":"aoj_0548_cpp"},"problem_description":{"kind":"string","value":"方向音痴のトナカイ\n問題\n今年も JOI 町にサンタクロースが空からやってきた．JOI 町にある全ての家には子供がいるので，このサンタクロースは JOI 町の全ての家にプレゼントを配ってまわらなければならない．しかし，今年は連れているトナカイが少々方向音痴であり，また建物の上以外に降りることができないため，全ての家にプレゼントを配るためには少々道順を工夫しなければならないようだ．\nJOI 町は東西南北に区画整理されており，各区画は家，教会，空き地のいずれかである．JOI 町には 1 つだけ教会がある．次のルールに従い，サンタクロースとトナカイは教会から出発し，全ての家に 1 回ずつプレゼントを配った後，教会に戻る．\n今年のトナカイは少々方向音痴であるため，東西南北いずれかの方向にまっすぐ飛ぶことしかできず，空中では方向転換できない．\nまだプレゼントを配っていない家の上は自由に通過できる．まだプレゼントを配っていない家には降りることができる．家に降りた時は必ずプレゼントを配り，その後は東西南北いずれかの方向に飛び立つ．\nJOI 町の家では，クリスマスの夜はサンタクロースが来るまでは暖炉をつけずに過ごしているが，サンタクロースが飛び立った後は暖炉をつける．暖炉をつけると煙突から煙が出るので，プレゼントを配り終えた家の上を通過することはできない．\n教会の上は自由に通過することができる．しかし，教会では礼拝が行われているので，全てのプレゼントを配り終えるまで教会に降りることはできない．\n空き地の上は自由に通過することができるが，空き地に降りることはできない．\n入力として町の構造が与えられたとき，サンタクロースとトナカイがプレゼントを配る道順が何通りあるかを求めるプログラムを作成せよ．\n入力\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．\n各データセットは n+1 行ある．\n1 行目には整数 m (1 ≤ m ≤ 10) と整数 n (1 ≤ n ≤ 10) が空白で区切られて書かれている．\n2 行目から n+1 行目までの各行には，0，1，2 のいずれかが，\n空白で区切られて m 個書かれており，各々が各区画の状態を表している．\n北から i 番目，西から j 番目の区画を (i,j) と記述することにすると\n(1 ≤ i ≤ n, 1 ≤ j ≤ m)，\n第 i+1 行目の j 番目の値は，\n区画 (i,j) が空き地である場合は 0 となり，\n家である場合は 1 となり，\n教会である場合は 2 となる．\n教会の個数は 1 であり，家の個数は 1 以上 23 以下である．\nただし，採点用入力データでは配る道順が 2000000 通りをこえることはない．\nm, n がともに 0 のとき入力の終了を示す.データセットの数は 5 を超えない．\n出力\nデータセットごとに,プレゼントを配る道順が何通りあるかを表す整数を1 行に出力する．\n入出力例\n入力例\n3 2\n1 0 1\n1 0 2\n3 3\n1 1 1\n1 0 1\n1 1 2\n0 0\n出力例\n2\n6\n図: 2つ目の入力例 に対する 6 通り全ての道順\n（数字は配る順序を表す）\n上記問題文と自動審判に使われるデータは、\n情報オリンピック日本委員会\nが作成し公開している問題文と採点用テストデータです。"},"candidates":{"kind":"list like","value":[{"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}],"string":"[\n {\n \"submission_id\": \"aoj_0548_9553935\",\n \"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}}\",\n \"accuracy\": 1,\n \"time_ms\": 680,\n \"memory_kb\": 36228,\n \"score_of_the_acc\": -0.4724,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0548_7000387\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 6330,\n \"memory_kb\": 3036,\n \"score_of_the_acc\": -0.7958,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_0548_6602511\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 700,\n \"memory_kb\": 52628,\n \"score_of_the_acc\": -0.7086,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0548_6602489\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 690,\n \"memory_kb\": 52748,\n \"score_of_the_acc\": -0.7089,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0548_6602474\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 690,\n \"memory_kb\": 52764,\n \"score_of_the_acc\": -0.7091,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_0548_6602464\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 690,\n \"memory_kb\": 52796,\n \"score_of_the_acc\": -0.7096,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_0548_6602332\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 700,\n \"memory_kb\": 52764,\n \"score_of_the_acc\": -0.7105,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_0548_6602262\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 690,\n \"memory_kb\": 52760,\n \"score_of_the_acc\": -0.709,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0548_6602165\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 700,\n \"memory_kb\": 52696,\n \"score_of_the_acc\": -0.7095,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_0548_6602119\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 1020,\n \"memory_kb\": 52728,\n \"score_of_the_acc\": -0.7551,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_0548_6602054\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 1040,\n \"memory_kb\": 52584,\n \"score_of_the_acc\": -0.7558,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_0548_6602012\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 970,\n \"memory_kb\": 52692,\n \"score_of_the_acc\": -0.7475,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_0548_6404082\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 970,\n \"memory_kb\": 52616,\n \"score_of_the_acc\": -0.7464,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_0548_6404073\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 1690,\n \"memory_kb\": 55424,\n \"score_of_the_acc\": -0.8878,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_0548_6366512\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 1720,\n \"memory_kb\": 72956,\n \"score_of_the_acc\": -1.1415,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_0548_6366509\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 1760,\n \"memory_kb\": 72956,\n \"score_of_the_acc\": -1.1472,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_0548_6366456\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 1730,\n \"memory_kb\": 73172,\n \"score_of_the_acc\": -1.146,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_0548_6366384\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 1770,\n \"memory_kb\": 73304,\n \"score_of_the_acc\": -1.1535,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_0548_4996202\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 2610,\n \"memory_kb\": 3132,\n \"score_of_the_acc\": -0.2732,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0548_4564873\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 7780,\n \"memory_kb\": 3152,\n \"score_of_the_acc\": -1.0017,\n \"final_rank\": 16\n }\n]","isConversational":false}}},{"rowIdx":389,"cells":{"group_id":{"kind":"string","value":"aoj_0541_cpp"},"problem_description":{"kind":"string","value":"散歩\n問題\nJOI 町に住む太郎君は, ある日,健康増進のために散歩を日課にしようと思い立った.\n 太郎君の住む JOI 町には,図のように,東西方向に走る (\nH\n+ 1) 本の道路と,南北\n方向に走る (\nW\n+ 1) 本の道路が碁盤目状に通っている.太郎君の家はもっとも北西の\n交差点にあり,ここから散歩を開始する.\n以降,北から\na\n番目,西から\nb\n番目の交差点を (\na\n,\nb\n) で表す.たとえば,太郎君の家がある交差点は (1, 1) である.\n図: JOI 町の図 (\nH\n= 3,\nW\n= 4 の場合).図の上が北,左が西に対応する.\n太郎君は,散歩のルートが日々違ったほうが面白いと考えたので,(1, 1) から (\nH\n,\nW\n) までの\nH\n×\nW\n個の交差点に, 「東」または「南」の文字を書き,次のようなルールに従って毎日散歩を行うことにした.\n文字の書かれた交差点にいる場合,その交差点に書かれている文字が「東」な\n ら「南」に, 「南」なら「東」に文字を書き換え,もともと書かれていた文字の方角にある次の交差点まで進む.\nもっとも東やもっとも南の道路に到達したら散歩を終了する.\nこの計画を考えた後,太郎君は,将来の散歩で自分がどのようなルートをたどる\nことになるのかが気になった.太郎君のために,太郎君の\nN\n回目の散歩のルートを\n予測するプログラムを作成せよ.\n入力\n入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．\n1 行目には,3 つの正整数が空白区切りで書かれている.これらは,問題文中の 3 つの数値\nH\n,\nW\n,\nN\nの値である.\nH\n,\nW\n,\nN\nはそれぞれ, 1 ≤\nH\n≤ 1000, 1 ≤\nW\n≤ 1000, 1 ≤\nN\n≤ 10000000 = 10\n7\nをみたす. 2 行目から\nH\n+ 1 行目には,それぞれ\nW\n個の整数が空白区切りで書かれている.これらは,太郎君が最初に交差点に書いた文字の情報を表す.\ni\n+ 1 行目の\nj\n番目の整数が 0 なら,交差点 (\ni\n,\nj\n) に書かれた文字が「南」であることを, 1 なら, 交差点 (\ni\n,\nj\n) に書かれた文字が「東」であることを表す.\n採点用データのうち,配点の 30%分については,\nH\n≤ 100,\nW\n≤ 100,\nN\n≤ 1000 を満たす.\nH\n,\nW\n,\nN\nがすべて 0 のとき入力の終了を示す. データセットの数は 10 を超えない．\n出力\nデータセットごとに次の形式で出力する.\nN\n回目の散歩において太郎君が散歩を終了する交差点が (\ni\n,\nj\n) のとき,\ni\nと\nj\nをこの順に空白で区切って出力せよ.\n入出力の例\n入力例\n3 4 3\n1 0 1 1\n0 1 0 0\n1 0 1 0\n0 0 0\n出力例\n1 5\n上の例では,1 回目から 3 回目の散歩のルートは次の図のようになる.\n上記問題文と自動審判に使われるデータは、\n情報オリンピック日本委員会\nが作成し公開している問題文と採点用テストデータです。"},"candidates":{"kind":"list like","value":[{"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}],"string":"[\n {\n \"submission_id\": \"aoj_0541_10525122\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 11248,\n \"score_of_the_acc\": -0.0778,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0541_9714248\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 10620,\n \"score_of_the_acc\": -0.7273,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_0541_9559388\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 10920,\n \"score_of_the_acc\": -0.6735,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_0541_9470973\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 10948,\n \"score_of_the_acc\": -0.677,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_0541_9458195\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 10832,\n \"score_of_the_acc\": -0.6626,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_0541_9456458\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 10864,\n \"score_of_the_acc\": -0.6666,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_0541_9416544\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 10812,\n \"score_of_the_acc\": -0.6601,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_0541_8860562\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 10924,\n \"score_of_the_acc\": -1.0377,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_0541_8821782\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 11184,\n \"score_of_the_acc\": -0.2517,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_0541_8214906\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 10996,\n \"score_of_the_acc\": -0.2284,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_0541_8214897\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 10876,\n \"score_of_the_acc\": -1.0317,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_0541_8214896\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 10824,\n \"score_of_the_acc\": -1.0253,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_0541_8207515\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 10824,\n \"score_of_the_acc\": -1.0253,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_0541_8115329\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 10960,\n \"score_of_the_acc\": -0.2239,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0541_8115324\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 10936,\n \"score_of_the_acc\": -0.221,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0541_8115321\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 10936,\n \"score_of_the_acc\": -0.221,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0541_8115319\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 10956,\n \"score_of_the_acc\": -0.2234,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0541_7780395\",\n \"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);\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 18604,\n \"score_of_the_acc\": -1.6255,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_0541_6897251\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 10812,\n \"score_of_the_acc\": -0.7511,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_0541_6739601\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 18692,\n \"score_of_the_acc\": -1.1818,\n \"final_rank\": 19\n }\n]","isConversational":false}}},{"rowIdx":390,"cells":{"group_id":{"kind":"string","value":"aoj_0550_cpp"},"problem_description":{"kind":"string","value":"お菓子の分割\n問題\n長さ N ミリメートルの棒状のお菓子が 1 本ある(ここで N は偶数). 2 人の JOI\n関係者が,このお菓子を複数本に切断して,合計 N/2 ミリメートルずつに分けること\nにした.\n理由は不明であるが,このお菓子は場所によって切断のしやすさが異なっている.\n2 人は,お菓子を左から 1 ミリメートルごとに調べ,各場所で切断に何秒かかるか\nを割り出した.2 人がお菓子を分けるための切断にかかる秒数の最小値を求めるプ\nログラムを作成せよ.\n入力\n入力の 1 行目には,棒の長さ N(2 ≤ N ≤ 10000 ,ただし N は偶数) が書かれてい\nる.入力の i + 1 行目 (1 ≤ i ≤ N − 1) には,左端から i ミリメートル目の場所の切\n断にかかる秒数を表す整数 ti (1 ≤ ti ≤ 10000) が書かれている.切断可能な場所が\nN − 1 箇所であることに注意せよ.\n採点用データのうち,配点の 5% 分については,高々 2 カ所を切断することで最\n小値を実現でき,10% 分については,高々 3 カ所を切断することで最小値を実現で\nきる.配点の 20% 分については,N ≤ 20 である.\n出力\n出力は2 人がお菓子を分るための切断にかかる秒数の最小値を含む 1 行からなる.\n入出力例\n入力例 1\n6\n1\n8\n12\n6\n2\n出力例 1\n7\nこの場合,左端から 1 ミリメートルと 4 ミリメートルの場所で切断するとかかる\n秒数が最小となる.かかる秒数は 1 秒と 6 秒で,合計 7 秒である.\n上記問題文と自動審判に使われるデータは、\n情報オリンピック日本委員会\nが作成し公開している問題文と採点用テストデータです。"},"candidates":{"kind":"list like","value":[{"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}],"string":"[\n {\n \"submission_id\": \"aoj_0550_10854045\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3520,\n \"score_of_the_acc\": -0.2749,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0550_10399699\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -0.3264,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_0550_8859736\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3828,\n \"score_of_the_acc\": -0.4188,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_0550_8859731\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3632,\n \"score_of_the_acc\": -0.3206,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_0550_8859725\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3632,\n \"score_of_the_acc\": -0.3279,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_0550_8859721\",\n \"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}\",\n \"accuracy\": 0.1,\n \"time_ms\": 290,\n \"memory_kb\": 2856,\n \"score_of_the_acc\": -0.0942,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_0550_8859707\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 3328,\n \"score_of_the_acc\": -0.2689,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0550_8838481\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3968,\n \"score_of_the_acc\": -0.476,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_0550_8838476\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3820,\n \"score_of_the_acc\": -0.4119,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_0550_8838461\",\n \"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}\",\n \"accuracy\": 0.1,\n \"time_ms\": 360,\n \"memory_kb\": 3316,\n \"score_of_the_acc\": -0.3075,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_0550_8821395\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 400,\n \"memory_kb\": 3336,\n \"score_of_the_acc\": -0.3301,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_0550_8821388\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 3264,\n \"score_of_the_acc\": -0.2283,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0550_8821384\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 370,\n \"memory_kb\": 3336,\n \"score_of_the_acc\": -0.3193,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_0550_8821377\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3524,\n \"score_of_the_acc\": -0.2765,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_0550_8821376\",\n \"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}\",\n \"accuracy\": 0.05,\n \"time_ms\": 40,\n \"memory_kb\": 3040,\n \"score_of_the_acc\": -0.0788,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_0550_8808931\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3536,\n \"score_of_the_acc\": -0.2886,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_0550_8808928\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3500,\n \"score_of_the_acc\": -0.2776,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_0550_8497775\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3532,\n \"score_of_the_acc\": -0.2761,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0550_8497658\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 2790,\n \"memory_kb\": 5304,\n \"score_of_the_acc\": -2,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_0550_8300796\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3148,\n \"score_of_the_acc\": -0.1302,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":391,"cells":{"group_id":{"kind":"string","value":"aoj_0549_cpp"},"problem_description":{"kind":"string","value":"旅人\n問題\nあなたは JOI 街道を旅する旅人である.JOI 街道は東西にまっすぐに延びた道路で,JOI 街道上には n 個の宿場町がある.宿場町には西から東の順に 1 から n までの番号が付けられている.JOI 街道上の最も西の宿場町が宿場町 1 であり,最も東の宿場町が宿場町 n である.\nあなたは,宿場町 1 から出発して m 日間の旅に出ることになった.あなたの旅程は数列 a1 , a2 , . . . , am に従い,次のように決められている.ai は i 日目の移動方法を表す 0 ではない整数である.i 日目にあなたが出発する宿場町を宿場町 k とおくと,i 日目にあなたは宿場町 k から宿場町 k + ai までまっすぐに移動することを意味する.\n宿場町の個数 n,旅の日数 m,宿場町間の距離の情報と,移動方法を表す数列a1 , a2 , . . . , am が与えられたとき,m 日間の旅におけるあなたの移動距離の合計を100000 = 10\n5\nで割った余りを求めるプログラムを作成せよ.\n入出力の例に対応する図\n入力\n1 行目には整数 n, m が空白区切りで書かれている.n (2 ≤ n ≤ 100000 = 10\n5\n) はJOI 街道上の宿場町の個数を,m (1 ≤ m ≤ 100000 = 10\n5\n) は旅の日数を表す.\n続く n − 1 行は JOI 街道上の宿場町間の距離を表す.i + 1 行目 (1 ≤ i ≤ n − 1) に\nは宿場町 i と宿場町 i + 1 の距離を表す正整数 si (1 ≤ si ≤ 100) が書かれている.\n続く m 行には m 日間の移動方法を表す数列が書かれている.i + n 行目 (1 ≤ i ≤ m)\nには i 日目のあなたの移動方法を表す 0 ではない整数 ai が書かれている.\n採点用データにおいて,宿場町 1 より西に移動することや,宿場町 n より東に移\n動することはない.\n採点用データのうち,配点の 50% 分については,n ≤ 100 かつ m ≤ 100 を満たす.\n出力\n出力 は, m 日間の旅におけるあなたの移動距離の合計を 100000 = 10\n5\nで割った余りを含む 1 行からなる.\n入出力例\n入力例 1\n7 5\n2\n1\n1\n3\n2\n1\n2\n-1\n3\n2\n-3\n出力例 1\n18\n1 日目に,あなたは宿場町 1 から宿場町 3 まで移動する.2 日目に,あなたは宿場\n町 3 から宿場町 2 まで移動する.そして,3 日目に宿場町 2 から宿場町 5 まで移動\nし,4 日目に宿場町 5 から宿場町 7 まで移動し,5 日目に宿場町 7 から宿場町 4 ま\nで移動する.5 日間の旅におけるあなたの移動距離の合計は 18 である.\n上記問題文と自動審判に使われるデータは、\n情報オリンピック日本委員会\nが作成し公開している問題文と採点用テストデータです。"},"candidates":{"kind":"list like","value":[{"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}],"string":"[\n {\n \"submission_id\": \"aoj_0549_10865330\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3792,\n \"score_of_the_acc\": -0.2849,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0549_10851342\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4624,\n \"score_of_the_acc\": -0.6405,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_0549_10399688\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4240,\n \"score_of_the_acc\": -0.4701,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_0549_10351932\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4164,\n \"score_of_the_acc\": -0.4439,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_0549_8957607\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5408,\n \"score_of_the_acc\": -0.9692,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_0549_8520237\",\n \"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}\",\n \"accuracy\": 0.5,\n \"time_ms\": 30,\n \"memory_kb\": 4236,\n \"score_of_the_acc\": -0.481,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_0549_8019795\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 1600,\n \"memory_kb\": 3868,\n \"score_of_the_acc\": -1.3111,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_0549_8019514\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3876,\n \"score_of_the_acc\": -0.3145,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_0549_7416637\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4668,\n \"score_of_the_acc\": -0.6593,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_0549_6893460\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3860,\n \"score_of_the_acc\": -0.314,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0549_6856768\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 5164,\n \"score_of_the_acc\": -0.8775,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_0549_6276705\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3140,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0549_6259871\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4656,\n \"score_of_the_acc\": -0.6604,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_0549_6083747\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4320,\n \"score_of_the_acc\": -0.5106,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_0549_5973930\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3860,\n \"score_of_the_acc\": -0.314,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0549_5849473\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4132,\n \"score_of_the_acc\": -0.4302,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_0549_5794052\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4220,\n \"score_of_the_acc\": -0.4678,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_0549_5786226\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3496,\n \"score_of_the_acc\": -0.1647,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0549_5463261\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 5412,\n \"score_of_the_acc\": -0.9835,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_0549_5199201\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5480,\n \"score_of_the_acc\": -1,\n \"final_rank\": 18\n }\n]","isConversational":false}}},{"rowIdx":392,"cells":{"group_id":{"kind":"string","value":"aoj_0552_cpp"},"problem_description":{"kind":"string","value":"博覧会\n問題\nJOI 市では,とある大規模な博覧会を開催することになった.\n今回の博覧会には 2 つのテーマがあり,JOI 市にある N 個の展示施設でそれぞれ,\n2 つのテーマのうちどちらか一方に沿った展示を行う予定である.\n施設の位置は平面座標 (x, y) で表される.位置 (x, y) にある施設から (x′ , y′) にある施設まで移動するためには, |x − x′| + |y − y′| だけの時間がかかる (整数 a に対して,\n|a| で a の絶対値を表す).同一テーマ内での統一感を出すため,および一方のテーマのみに関心を持つ人に不便を感じさせないために,同一のテーマで展示を行っている 2 つの施設の間の移動時間がなるべく短くなるようにテーマを割りふりたい.すべての展示施設に同じテーマを割りふらない限り, どのようにテーマを割りふってもよい.\n同一のテーマで展示を行っている 2 つの施設の間の移動時間の最大値を M とする. N 個の展示施設の位置が与えられたとき, M の最小値を求めるプログラムを作成せよ.\n入力\n入力の 1 行目には, 施設の個数 N(3 ≤ N ≤ 100000 = 10\n5\n) が書かれている.入力のi + 1 行目 (1 ≤ i ≤ N) には,各施設の座標を表す 2 つの整数 x\ni\n, y\ni\n(|x\ni\n| ≤ 100000 = 10\n5\n, |y\ni\n| ≤ 100000 = 10\n5\n) が空白区切りで書かれている.これは,i 個目の施設の座標が(x\ni\n, y\ni\n) であることを表す. 同一の座標に 2 つ以上の施設が存在することはない.\n採点用データのうち,配点の 40% 分については, N ≤ 2000 である.\n出力\n出力は 1 行のみからなる.同一のテーマで展示を行っている 2 つの施設間の移動時間の最大値 M の最小値を出力せよ.\n入出力例\n入力例 1\n5\n0 0\n1 0\n-1 -2\n0 1\n-1 1\n出力例 1\n3\nこの場合,たとえば座標 (0, 0), (1, 0), (0, 1) にある施設に一方のテーマを,(−1, −2),\n(−1, 1) にある施設にもう一方のテーマを割りふると,同一のテーマで展示を行う 2\nつの施設間の移動時間はすべて 3 以下になる.移動時間をすべて 2 以下にすることはできないので,3 を出力する.\n上記問題文と自動審判に使われるデータは、\n情報オリンピック日本委員会\nが作成し公開している問題文と採点用テストデータです。"},"candidates":{"kind":"list like","value":[{"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}],"string":"[\n {\n \"submission_id\": \"aoj_0552_10852741\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 4312,\n \"score_of_the_acc\": -0.2127,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_0552_10399732\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3732,\n \"score_of_the_acc\": -0.025,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0552_9390263\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 6252,\n \"score_of_the_acc\": -0.3068,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_0552_9089019\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4608,\n \"score_of_the_acc\": -0.123,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_0552_5849546\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 4872,\n \"score_of_the_acc\": -0.2051,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_0552_5480466\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 370,\n \"memory_kb\": 7548,\n \"score_of_the_acc\": -1.0833,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_0552_5480453\",\n \"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}\",\n \"accuracy\": 0.8,\n \"time_ms\": 580,\n \"memory_kb\": 9076,\n \"score_of_the_acc\": -1.6225,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_0552_5366544\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3780,\n \"score_of_the_acc\": -0.0304,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0552_4821738\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3508,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0552_4176048\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 4384,\n \"score_of_the_acc\": -0.1857,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_0552_4106894\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3872,\n \"score_of_the_acc\": -0.0933,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_0552_3938850\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3636,\n \"score_of_the_acc\": -0.0669,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0552_3428291\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3796,\n \"score_of_the_acc\": -0.0848,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0552_3164212\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 4936,\n \"score_of_the_acc\": -0.2123,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_0552_3074744\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 4588,\n \"score_of_the_acc\": -0.226,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_0552_3025263\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 12452,\n \"score_of_the_acc\": -1.2807,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_0552_2974099\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 5568,\n \"score_of_the_acc\": -0.2654,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_0552_2739057\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3892,\n \"score_of_the_acc\": -0.0956,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_0552_2717506\",\n \"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}\",\n \"accuracy\": 0.8,\n \"time_ms\": 250,\n \"memory_kb\": 7364,\n \"score_of_the_acc\": -0.8522,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_0552_2698309\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 5760,\n \"score_of_the_acc\": -0.3044,\n \"final_rank\": 15\n }\n]","isConversational":false}}},{"rowIdx":393,"cells":{"group_id":{"kind":"string","value":"aoj_0551_cpp"},"problem_description":{"kind":"string","value":"つらら\n問題\nカナダに住む JOI 君の家の軒下には,立派なつららが出来ている.せっかくなので,JOI 君はつららについて調べてみることにした.\nJOI 君の家の軒下には N 本(2 ≤ N ≤ 100000 = 10\n5\n)のつららが出来ている.これらのつららは一直線上に並んでおり,軒下の左端から i cm(1 ≤ i ≤ N )の位置に i 本目のつららが出来ている.i 本目のつららの長さは最初 ai cm(ai は 1 以上の整数)である.これらのつららは,次のような規則によって伸びていく:\ni 本目のつららは,i − 1 本目のつららと i + 1 本目のつららの両方よりも長い場合にのみ,1 時間につき 1 cm ずつ伸びる(ただし,両端のつららに関しては片方の隣のみ考える.すなわち,1 本目のつららは 2 本目のつららより長ければ伸び,N 本目のつららは N − 1 本目のつららより長ければ伸びる).\nどのつららも,L cm(2 ≤ L ≤ 50000)に達した瞬間に,根元から折れる(折れたつららは,以後長さ 0 cm のつららとみなす)\n.\n最初の段階で,隣り合う 2 本のつららの長さはすべて異なっている.このとき,十分な時間が経過すれば,N 本すべてのつららが折れて長さ 0 cm となる.JOI 君は,つららがこのような状態になるまでの時間を知りたくなった.\nN 本のつららの最初の長さとつららの限界の長さ L が与えられると,すべてのつららが折れるまでにかかる時間を求めるプログラムを作成せよ.\n入力\n入力の 1 行目には,つららの本数を表す整数 N とつららの限界の長さを表す整数\nL が,空白を区切りとしてこの順に書かれている.入力の i + 1 行目 (1 ≤ i ≤ N) に\nは, i 本目のつららの最初の長さを表す整数 ai (1 ≤ ai < L) が書かれている.\n採点用データのうち,配点の 30% 分については,N ≤\n500 かつ L ≤ \n1000 を満\nたす.\n出力\n出力 は,すべてのつららが折れるまでにかかる時間を表す 1 つの整数のみを含む 1 行からなる.\n入出力例\n入力例 1\n4 6\n4\n2\n3\n5\n出力例 1\n8\n例 1 の場合,1, 2, 3, 4 本目のつららは,それぞれ 2, 8, 4, 1 時間後に折れる.した\nがって,すべてのつららが折れるまでにかかる時間は 8 時間であるので,8 を出力\nする.\n入力例 2\n6 10\n3\n4\n1\n9\n5\n1\n出力例 2\n15\n上記問題文と自動審判に使われるデータは、\n情報オリンピック日本委員会\nが作成し公開している問題文と採点用テストデータです。"},"candidates":{"kind":"list like","value":[{"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}],"string":"[\n {\n \"submission_id\": \"aoj_0551_10946339\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5864,\n \"score_of_the_acc\": -0.9634,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_0551_10889012\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5860,\n \"score_of_the_acc\": -0.4625,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_0551_10399702\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5704,\n \"score_of_the_acc\": -0.4263,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_0551_10343042\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4316,\n \"score_of_the_acc\": -0.1047,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0551_9648066\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5868,\n \"score_of_the_acc\": -0.9643,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_0551_9024614\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 6632,\n \"score_of_the_acc\": -0.6413,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_0551_8475628\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4820,\n \"score_of_the_acc\": -0.2215,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_0551_8130796\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5456,\n \"score_of_the_acc\": -0.3689,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_0551_6354027\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4940,\n \"score_of_the_acc\": -0.2493,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_0551_6131574\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 8180,\n \"score_of_the_acc\": -1.5,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_0551_5849524\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4900,\n \"score_of_the_acc\": -0.74,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_0551_5476831\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5736,\n \"score_of_the_acc\": -0.9337,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_0551_5379154\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3864,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0551_5240407\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3980,\n \"score_of_the_acc\": -0.0269,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0551_4750415\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5988,\n \"score_of_the_acc\": -0.9921,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_0551_4695320\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4208,\n \"score_of_the_acc\": -0.5797,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_0551_4417787\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4044,\n \"score_of_the_acc\": -0.5417,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_0551_4379780\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4684,\n \"score_of_the_acc\": -0.19,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0551_4379759\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4240,\n \"score_of_the_acc\": -0.0871,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0551_4378806\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 5448,\n \"score_of_the_acc\": -1.367,\n \"final_rank\": 19\n }\n]","isConversational":false}}},{"rowIdx":394,"cells":{"group_id":{"kind":"string","value":"aoj_0556_cpp"},"problem_description":{"kind":"string","value":"タイル (Tile)\n問題\nJOI 高校では， 1 × 1 の正方形のタイルを使って N × N の正方形の壁画を作り，文化祭で展示することになった．タイルの色は，赤，青，黄の 3 種類である．壁画のデザインは次の通りである．まず，最も外側の周に赤のタイルを貼り，その内側の周に青のタイルを貼る．さらにその内側の周に黄色のタイルを貼る．これを N × N の正方形が埋め尽くされるまで繰り返す．用いるタイルの色は，一番外側の周から順番に赤，青，黄，赤，青，黄，…である．\n文化祭が近づいてきたある日，壁画のうち K 枚のタイルがはがれていることが判明した．そこで，新しいタイルを購入して，はがれた箇所に新しいタイルを貼ることにした．\n入力として壁画の一辺の長さ N と，はがれたタイルの枚数 K， K 枚のはがれたタイルの位置が与えられたとき，はがれたタイルの色を求めるプログラムを作成せよ．\n例えば，N = 11 の場合，11 × 11 の壁画のデザインは下図の通りである．\nまた，N = 16 の場合，16 × 16 の壁画のデザインは下図の通りである．\n入力\n入力は全部で 2+K 行からなる． 1 行目には，壁画の一辺の長さ N （1 ≤ N ≤ 1000000000 = 10\n9\n）が， 2 行目には，はがれたタイルの枚数 K （1 ≤ K ≤ 1000）が書かれている． 2+i 行目（1 ≤ i ≤ K）には，2 つの整数 ai と bi （1 ≤ ai ≤ N, 1 ≤ bi ≤ N）が空白区切りで書かれており， i 枚目のはがれたタイルが，左から ai 列目，上から bi 行目のタイルであることを表す．\n入力の 3 行目から 2+K 行目には同じタイルを表す行が重複して現れることはない．また，与えられる入力データ 40% では， N ≤ 1000 をみたしている．\n出力\n出力は K 行からなる．各行は 1 つの整数からなり， i 行目（1 ≤ i ≤K）の整数は，i 枚目のはがれたタイルが赤のときは 1 を，青のときは 2 を，黄色のときは 3 を表す．\n入出力例\n入力例 1\n11\n4\n5 2\n9 7\n4 4\n3 9\n出力例 1\n2\n3\n1\n3\n入力例 2\n16\n7\n3 7\n5 2\n11 6\n15 2\n9 7\n8 12\n15 16\n出力例 2\n3\n2\n3\n2\n1\n2\n1\n問題文と自動審判に使われるデータは、\n情報オリンピック日本委員会\nが作成し公開している問題文と採点用テストデータです。"},"candidates":{"kind":"list like","value":[{"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}],"string":"[\n {\n \"submission_id\": \"aoj_0556_2940233\",\n \"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}\",\n \"accuracy\": 0.4,\n \"time_ms\": 70,\n \"memory_kb\": 6980,\n \"score_of_the_acc\": -1.0881,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0556_2940190\",\n \"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}\",\n \"accuracy\": 0.4,\n \"time_ms\": 70,\n \"memory_kb\": 7036,\n \"score_of_the_acc\": -1.0914,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0556_2584779\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3080,\n \"score_of_the_acc\": -0.1116,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0556_2104506\",\n \"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}\",\n \"accuracy\": 0.4,\n \"time_ms\": 90,\n \"memory_kb\": 18372,\n \"score_of_the_acc\": -2,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_0556_2104499\",\n \"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}\",\n \"accuracy\": 0.4,\n \"time_ms\": 90,\n \"memory_kb\": 10456,\n \"score_of_the_acc\": -1.5401,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_0556_2104473\",\n \"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}\",\n \"accuracy\": 0.4,\n \"time_ms\": 90,\n \"memory_kb\": 10304,\n \"score_of_the_acc\": -1.5313,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_0556_2104469\",\n \"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}\",\n \"accuracy\": 0.4,\n \"time_ms\": 80,\n \"memory_kb\": 6640,\n \"score_of_the_acc\": -1.1934,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_0556_1027046\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1160,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0556_997979\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1164,\n \"score_of_the_acc\": -0.0002,\n \"final_rank\": 2\n }\n]","isConversational":false}}},{"rowIdx":395,"cells":{"group_id":{"kind":"string","value":"aoj_0553_cpp"},"problem_description":{"kind":"string","value":"ダンジョン\n問題\nあなたはあるダンジョンの地下 N 階にある財宝を手に入れたいと思っている.最初,あなたは地下 1 階におり,あなたの体力は H(H は正整数) である.下の階に降りるときに,体力が消費される.あらかじめ各階における下の階に降りるときに消費される体力が分かっている.一方,各階には 1 つの回復の泉があり,泉を 1 回使うごとに回復できる体力がそれぞれ定まっている.体力が 0 以下になるとあなたは死んでしまう.また,体力が H よりも高くなることはない.回復の泉は何回でも使うことができるが,回復には時間がかかるので,あなたは泉の使用回数をできるだけ少なくしたいと考えている.\nN ,H ,各階の下の階に降りるときに消費される体力,そして各階で回復の泉を 1 回使用したときに回復する体力が与えられたとき,体力を 0 以下にすることなく地下 N 階まで到達するために必要な泉の使用回数の最小値を求めるプログラムを作成せよ.\nまた,一度下の階に降りると,財宝を手に入れるまで上の階に戻ることはできない.\n入力\n入力は N 行からなる.\n入力の 1 行目には 2 つの整数 N, H(2 ≤ N ≤ 100000 = 10\n5\n, 1 ≤\nH ≤ 10000000 = 10\n7\n) が空白を区切りとして書かれている.N は地下 N 階に財宝があるということを表し,H は初期体力 ( ダンジョンの地下 1 階に到着した段階の体力 ) であり,かつ体力の最大値である ( 回復によって体力が H より大きくなることはない ) .\n続く 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どの採点用データにおいても,地下 N 階にたどり着く方法が存在する.採点用データのうち,配点の 10%分については,N ≤\n1000 かつ H ≤\n1000 を満たす.配点の30%分については,N ≤1000 を満たす.配点の 50%分については,泉の使用回数の最小値が 10\n6\nを超えない.\n出力\n出力は,体力を 0 以下にすることなく地下 N 階に到達するために必要な,泉の使用回数の最小値を含む 1 行からなる.\n注意\nこの問題では,扱う整数の範囲が 32bit に収まらない可能性があることに注意せよ.\n入出力例\n入力例 1\n10 10\n4 2\n2 5\n6 1\n7 3\n6 4\n9 6\n0 8\n4 1\n9 4\n出力例 1\n10\n上記問題文と自動審判に使われるデータは、\n情報オリンピック日本委員会\nが作成し公開している問題文と採点用テストデータです。"},"candidates":{"kind":"list like","value":[{"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}],"string":"[\n {\n \"submission_id\": \"aoj_0553_10399785\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 5784,\n \"score_of_the_acc\": -0.0217,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0553_8860186\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 7132,\n \"score_of_the_acc\": -0.8049,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0553_8214939\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 330,\n \"memory_kb\": 21564,\n \"score_of_the_acc\": -1.9958,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_0553_8214938\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 21584,\n \"score_of_the_acc\": -1.9304,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_0553_8214937\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 21608,\n \"score_of_the_acc\": -1.8985,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_0553_8115384\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 21624,\n \"score_of_the_acc\": -1.8995,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_0553_8115382\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 21584,\n \"score_of_the_acc\": -1.897,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_0553_8115380\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 21608,\n \"score_of_the_acc\": -1.8985,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_0553_8115375\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 21612,\n \"score_of_the_acc\": -1.8988,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_0553_8115370\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 270,\n \"memory_kb\": 21612,\n \"score_of_the_acc\": -1.7988,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_0553_8115367\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 21604,\n \"score_of_the_acc\": -1.8983,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_0553_8115365\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 21620,\n \"score_of_the_acc\": -1.8993,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_0553_8112630\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 21624,\n \"score_of_the_acc\": -1.8995,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_0553_8112628\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 21620,\n \"score_of_the_acc\": -1.6326,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_0553_8112627\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 21608,\n \"score_of_the_acc\": -1.8985,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_0553_8112625\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 21628,\n \"score_of_the_acc\": -1.8998,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_0553_8112623\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 21632,\n \"score_of_the_acc\": -1.9,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_0553_5263959\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 5460,\n \"score_of_the_acc\": -0.2017,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0553_4267255\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 5432,\n \"score_of_the_acc\": -0.0333,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0553_3995899\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 270,\n \"memory_kb\": 7872,\n \"score_of_the_acc\": -0.9506,\n \"final_rank\": 5\n }\n]","isConversational":false}}},{"rowIdx":396,"cells":{"group_id":{"kind":"string","value":"aoj_0561_cpp"},"problem_description":{"kind":"string","value":"古本屋(Books)\nあなたの町にはJOI 古本店という老舗の古本屋があり，あなたはJOI 古本店をよく利用している．それぞれの本には基準価格が定まっており，JOI 古本店に行けばその価格で買い取ってもらえる．\nJOI 古本店では，本を小説,漫画,雑誌など10 種類のジャンルに分類して扱っている．ジャンルには1から10 までの番号が付けられている．JOI 古本店には，同じジャンルの本をまとめて買い取ってもらうと高値で買い取ってくれるというサービスがある．具体的には，同じジャンルの本をまとめてT 冊買い取ってもらう場合，そのジャンルの本の一冊あたりの買取価格が基準価格よりT - 1 円高くなる．例えば，同じジャンルで基準価格100 円，120 円，150 円の本をまとめてJOI 古本店に売ったとすると，買取価格はそれぞれ102 円，122 円，152 円となる．\nさて，あなたは一身上の都合で急遽引越しをすることになった．あなたはN 冊の本を持っているが，新しい住居にすべての本を持っていくことは困難なため，\nN\n冊の本のうち\nK\n冊をJOI 古本店に売ることにした．\n課題\nN\n冊の本それぞれの基準価格とジャンルの番号が与えられるとき，合計買取価格の最大値を求めるプログラムを作成せよ．\n制限\n2 ≤\nN\n≤ 2000 あなたが持っている本の冊数\n1 ≤\nK\n<\nN\nJOI 古本店に売る本の冊数\n1 ≤\nC\ni\n≤ 100000 = 10\n5\ni\n番目の本の基準価格\n1 ≤\nG\ni\n≤ 10\ni\n番目の本のジャンルの番号\n入力\n標準入力から以下の入力を読み込め．\n1 行目には整数\nN\n,\nK\nが空白を区切りとして書かれており，あなたの持っている本の冊数が\nN\nで，そのうち\nK\n冊をJOI 古本店に売ることを表す．\n続く\nN\n行にはあなたの持っている本の情報が書かれている．\ni\n+ 1 行目(1 ≤\ni\n≤\nN\n) には，整数\nC\ni\n,\nG\ni\nが空白を区切りとして書かれており，\ni\n番目の本の基準価格が\nC\ni\nで，ジャンルの番号が\nG\ni\nであることを表す．\n出力\n標準出力に，合計買取価格の最大値を表す整数を1 行で出力せよ．\n採点基準\n採点用データのうち，\n配点の20% 分については，\nN\n≤ 20 を満たす．\n配点の20% 分については，すべての本のジャンルは1 または2 である．\n配点の10% 分については，これら2 つの条件の両方を満たす．\n配点の30% 分については，これら2 つの条件の少なくとも一方を満たす．\n入出力の例\n入力例\n7 4\n14 1\n13 2\n12 3\n14 2\n8 2\n16 3\n11 2\n出力例\n60\nこの入力例では，2 番目，4 番目，6 番目，7 番目の4 冊の本を売ったとき，ジャンル2 の本の買取価格が1 冊あたり2 円高くなるので，これらの本の買取価格は以下のようになる．\n番号\n基準価格\nジャンル\n買取価格\n2\n4\n6\n7\n13\n14\n16\n11\n2\n2\n3\n2\n15\n16\n16\n13\nよって合計買取価格は15 + 16 + 16 + 13 = 60 円である．このとき合計買取価格は最大となる．\n問題文と自動審判に使われるデータは、\n情報オリンピック日本委員会\nが作成し公開している問題文と採点用テストデータです。"},"candidates":{"kind":"list like","value":[{"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}],"string":"[\n {\n \"submission_id\": \"aoj_0561_8115415\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 34960,\n \"score_of_the_acc\": -1,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_0561_8115412\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 34932,\n \"score_of_the_acc\": -0.9991,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_0561_8115408\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 34956,\n \"score_of_the_acc\": -0.9999,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_0561_8115400\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 34812,\n \"score_of_the_acc\": -0.9953,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_0561_6132002\",\n \"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}\",\n \"accuracy\": 0.3,\n \"time_ms\": 20,\n \"memory_kb\": 3412,\n \"score_of_the_acc\": -0.0914,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_0561_4405222\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3292,\n \"score_of_the_acc\": -0.0043,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0561_4404936\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3284,\n \"score_of_the_acc\": -0.004,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0561_4404702\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3184,\n \"score_of_the_acc\": -0.0009,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0561_4404684\",\n \"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}\",\n \"accuracy\": 0.1,\n \"time_ms\": 10,\n \"memory_kb\": 3404,\n \"score_of_the_acc\": -0.0078,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_0561_4404622\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3192,\n \"score_of_the_acc\": -0.0011,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0561_4356186\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3188,\n \"score_of_the_acc\": -0.0843,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_0561_4356168\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3188,\n \"score_of_the_acc\": -0.0843,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_0561_3886644\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3300,\n \"score_of_the_acc\": -0.1712,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_0561_3577180\",\n \"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}\",\n \"accuracy\": 0.1,\n \"time_ms\": 40,\n \"memory_kb\": 3156,\n \"score_of_the_acc\": -0.25,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_0561_3390678\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3312,\n \"score_of_the_acc\": -0.0049,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_0561_3319413\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 3396,\n \"score_of_the_acc\": -1.0075,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_0561_3318741\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 32996,\n \"score_of_the_acc\": -0.9382,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_0561_3309369\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3296,\n \"score_of_the_acc\": -0.0044,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_0561_3165170\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3300,\n \"score_of_the_acc\": -0.0045,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_0561_3164283\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3280,\n \"score_of_the_acc\": -0.0039,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":397,"cells":{"group_id":{"kind":"string","value":"aoj_0562_cpp"},"problem_description":{"kind":"string","value":"JOI 国の買い物事情(Shopping in JOI Kingdom)\nJOI 国には\nN\n個の町があり，それらの間は\nM\n本の双方向に通行可能な道路で結ばれている．\nK\n個の町にはショッピングモールがあり，国民は道路を通ってそれらの町のいずれかに行き買い物をする．\n家の場所によっては，買い物に行くために長い距離を移動する必要があり，それは非常に不便である．国王はこの実情を把握するため，ショッピングモールのある町までの最短距離が家の場所によってどれだけ長くなりうるのかを調べることにした．家は道路の途中に建てられることもあるので(入力例1 の説明を参照)，この調査は非常に大変である．そこで国王は，優秀なプログラマーであるあなたに，調査を行うプログラムの作成を依頼した．\n課題\n道路の情報とショッピングモールのある町の情報が与えられるとき，ショッピングモールのある町からもっとも遠い道路上の点(端点も含む) までの距離を求めるプログラムを作成せよ．町の中を移動するのにかかる距離は無視してよい．\n制限\n2 ≤\nN\n≤ 3000 JOI 国の町の個数\n1 ≤\nM\n≤ 100000 = 10\n5\nJOI 国の道路の本数\n1 ≤\nK\n≤\nN\nショッピングモールがある町の個数\n1 ≤\nl\ni\n≤ 1000\ni\n番目の道路の長さ\n入力\n標準入力から以下の入力を読み込め．\n1 行目には整数\nN\n,\nM\n,\nK\nが空白区切りで書かれている．\nN\nはJOI 国の町の個数を，\nM\nはJOI 国の道路の本数を，i>K\nはショッピングモールがある町の個数をそれぞれ表す．町には1, 2, ...,\nN\nの番号がつけられている．\n続く\nM\n行は道路の情報を表す．\ni\n+ 1 行目(1 ≤\ni\n≤\nM\n) には整数\na\ni\n,\nb\ni\n,\nl\ni\n(1 ≤\na\ni\n≤\nN\n, 1 ≤\nb\ni\n≤\nN\n, 1 ≤\nl\ni\n≤ 1000) が空白区切りで書かれている．これは，\ni\n本目の道路が町\na\ni\nと町\nb\ni\nを結んでおり，長さが\nl\ni\nであることを表す．道路の両端が同じ町であることはない．また，任意の2 つの町\np\n,\nq\nに対し，\np\nと\nq\nを結ぶ道路は2 本以上存在しない．どの町からどの町へもいくつかの道路をたどって行くことができる．\n続く\nK\n行はショッピングモールの情報を表す．\ni\n+\nM\n+1 行目(1 ≤\ni\n≤\nK\n) には1 つの整数\ns\ni\n(1 ≤\ns\ni\n≤\nN\n)が書かれている．これは町\ns\ni\nにショッピングモールがあることを表す．\ns\n1\n, ...,\ns\nK\nの中に同じ値が2\n回以上現れることはない．\n出力\n標準出力に，ショッピングモールのある町までの最短距離の最大値の小数点以下を四捨五入した整数1\nつを出力せよ．\n採点基準\n採点用データのうち，配点の40% 分については，\nK\n= 1 を満たす．\n入出力の例\n入力例1\n3 3 1\n1 2 1\n2 3 1\n3 1 1\n1\n出力例1\n2\n入力例1 は次のような町を表す．道路の長さはすべて1 である．ショッピングモールは町1 にしかない．\nショッピングモールのある町までもっとも遠い点は，町2 と町3 を結ぶ道路上の，町2 から距離0.5 の位置にある点であり，ショッピングモールのある町までの距離は1.5 である．よって，それを四捨五入した値である2 を出力する．\n入力例2\n4 5 2\n1 2 4\n1 3 1\n2 3 2\n2 4 2\n3 4 1\n2\n4\n出力例2\n3\n問題文と自動審判に使われるデータは、\n情報オリンピック日本委員会\nが作成し公開している問題文と採点用テストデータです。"},"candidates":{"kind":"list like","value":[{"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}],"string":"[\n {\n \"submission_id\": \"aoj_0562_10851481\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 7824,\n \"score_of_the_acc\": -0.1487,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_0562_9876070\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 7476,\n \"score_of_the_acc\": -0.1018,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_0562_8500951\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 9168,\n \"score_of_the_acc\": -0.2225,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_0562_7989233\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 6376,\n \"score_of_the_acc\": -0.0285,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0562_7180565\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 7720,\n \"score_of_the_acc\": -0.1417,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_0562_7180512\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 7700,\n \"score_of_the_acc\": -0.1719,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_0562_6781503\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 8992,\n \"score_of_the_acc\": -0.2029,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_0562_6291372\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 14276,\n \"score_of_the_acc\": -0.6574,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_0562_6093630\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 6548,\n \"score_of_the_acc\": -0.04,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_0562_5191511\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 11080,\n \"score_of_the_acc\": -0.4602,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_0562_4819391\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 5964,\n \"score_of_the_acc\": -0.0326,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0562_4818891\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 20952,\n \"score_of_the_acc\": -1.0079,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_0562_4810389\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 1280,\n \"memory_kb\": 6020,\n \"score_of_the_acc\": -1.0048,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_0562_4532434\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 9896,\n \"score_of_the_acc\": -0.2946,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_0562_4487955\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 10196,\n \"score_of_the_acc\": -0.3146,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_0562_4405640\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 6000,\n \"score_of_the_acc\": -0.0113,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0562_4405462\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 7152,\n \"score_of_the_acc\": -0.0881,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_0562_4405158\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 7232,\n \"score_of_the_acc\": -0.0935,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_0562_4404861\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 5948,\n \"score_of_the_acc\": -0.0315,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_0562_4404675\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 5972,\n \"score_of_the_acc\": -0.0331,\n \"final_rank\": 5\n }\n]","isConversational":false}}},{"rowIdx":398,"cells":{"group_id":{"kind":"string","value":"aoj_0568_cpp"},"problem_description":{"kind":"string","value":"パスタ (Pasta)\n問題\nあなたはパスタが大好物であり，毎日，晩御飯にパスタを作って食べている．あなたはトマトソース，クリームソース，バジルソースの 3 種類のパスタを作ることができる．\nN 日間の晩御飯の予定を考えることにした．それぞれの日に 3 種類のパスタから 1 種類を選ぶ．ただし，同じパスタが続くと飽きてしまうので，3 日以上連続して同じパスタを選んではいけない．また，N 日のうちの K 日分のパスタはすでに決めてある．\n入力として N の値と，K 日分のパスタの情報が与えられたとき，条件をみたす予定が何通りあるかを 10000 で割った余りを求めるプログラムを作成せよ．\n入力\n入力は K + 1 行からなる．\n1 行目には 2 つの整数 N, K (3 ≦ N ≦ 100，1 ≦ K ≦ N) が空白を区切りとして書かれている．\n1 + i 行目 (1 ≦ i ≦ K) には 2 つの整数 A\ni\n, B\ni\n(1 ≦ A\ni\n≦ N，1 ≦ B\ni\n≦ 3) が空白を区切りとして書かれている．これは，A\ni\n日目のパスタはすでに決まっており，B\ni\n= 1 のときはトマトソースであり，B\ni\n= 2 のときはクリームソースであり，B\ni\n= 3 のときはバジルソースであることを表す．A\ni\n(1 ≦ i ≦ K) は全て異なる．与えられる入力データにおいて，条件をみたす予定は 1 通り以上あることが保証されている．\n出力\n条件をみたす予定が何通りあるかを 10000 で割った余りを 1 行で出力せよ．\n入出力例\n入力例 1\n5 3\n3 1\n1 1\n4 2\n出力例 1\n6\n入出力例 1 において，あなたは 5 日間の予定を考える．1 日目と 3 日目はトマトソースであり，4 日目はクリームソースである．また，3 日以上連続して同じパスタを選んではいけない．これらの条件をみたす予定は 6 通りある．\n1日目\n2日目\n3日目\n4日目\n5日目\n予定 1\n1\n2\n1\n2\n1\n予定 2\n1\n2\n1\n2\n2\n予定 3\n1\n2\n1\n2\n3\n予定 4\n1\n3\n1\n2\n1\n予定 5\n1\n3\n1\n2\n2\n予定 6\n1\n3\n1\n2\n3\nこの表では，1 はトマトソースを，2 はクリームソースを，3 はバジルソースを表す．\n入力例 2\n20 5\n10 2\n4 3\n12 1\n13 2\n9 1\n出力例 2\n2640\n入出力例 2 において，条件をみたす予定は全部で 4112640 通りある．それを 10000 で割った余りである 2640 を出力する．\n問題文と自動審判に使われるデータは、\n情報オリンピック日本委員会\nが作成し公開している問題文と採点用テストデータです。"},"candidates":{"kind":"list like","value":[{"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}],"string":"[\n {\n \"submission_id\": \"aoj_0568_2091162\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3000,\n \"score_of_the_acc\": -1,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0568_1889432\",\n \"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}\",\n \"accuracy\": 0.2,\n \"time_ms\": 1190,\n \"memory_kb\": 1168,\n \"score_of_the_acc\": -0.4505,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0568_1889413\",\n \"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}\",\n \"accuracy\": 0.2,\n \"time_ms\": 2620,\n \"memory_kb\": 1160,\n \"score_of_the_acc\": -0.9962,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0568_1889407\",\n \"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}\",\n \"accuracy\": 0.2,\n \"time_ms\": 2630,\n \"memory_kb\": 1164,\n \"score_of_the_acc\": -1.0022,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0568_1581770\",\n \"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}\",\n \"accuracy\": 0.2,\n \"time_ms\": 1190,\n \"memory_kb\": 1208,\n \"score_of_the_acc\": -0.4722,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":399,"cells":{"group_id":{"kind":"string","value":"aoj_0560_cpp"},"problem_description":{"kind":"string","value":"惑星探査(Planetary Exploration)\nあなたを乗せた超時空移民船は長旅の末，ついに居住可能と思われる惑星を発見した．JOI 星と名付けられたその惑星は，その名の通り「ジャングル(Jungle)」，「海(Ocean)」，「氷(Ice)」の3 種類の地形が入り組んだ過酷な惑星である．簡単な調査により，居住予定地近辺の地図が作成された．居住予定地は南北\nM\nkm, 東西\nN\nkm の長方形の形をしており， 1 km 四方の正方形の区画に分けられている．区画は全部で\nMN\n個あり，北から\np\n行目，西から\nq\n列目の区画を(\np\n,\nq\n) で表す．北西の角の区画が(1, 1) であり，南東の角の区画が(\nM\n,\nN\n) である．各区画の地形は，「ジャングル」，「海」，「氷」のいずれかであり，「ジャングル」はJ, 「海」はO, 「氷」はI の英字1 文字で表される.\nさて，詳細な移住計画を立てるにあたり， K 箇所の長方形領域内に「ジャングル」，「海」，「氷」がそれぞれ何区画含まれるかを調べることにした．\n課題\n居住予定地の情報と，調査対象となる領域の情報が与えられたとき，それぞれの領域について， 「ジャングル」，「海」，「氷」が何区画含まれているかを求めるプログラムを作成せよ．\n制限\n1 ≤\nM\n≤ 1000 居住予定地の南北の長さ(km)\n1 ≤\nN\n≤ 1000 居住予定地の東西の長さ(km)\n1 ≤\nK\n≤ 100000 調査対象となる領域の個数\n入力\n標準入力から以下の入力を読み込め．\n1 行目には整数\nM\n,\nN\nが空白を区切りとして書かれており，居住予定地が南北に\nM\nkm ，東西に\nN\nkm の広さであることを表す．\n2 行目には整数\nK\nが書かれており，調査対象となる領域の個数を表す．\n続く\nM\n行には居住予定地の情報が書かれている．\ni\n+ 2 行目(1 ≤\ni\n≤\nM\n) には，居住予定地の北から\ni\n行目に位置する\nN\n区画の情報を表すJ，O，I からなる\nN\n文字の文字列が書かれている．\n続く\nK\n行には調査対象となる領域が書かれている．\nj\n+\nM\n+ 2 行目(1 ≤\nj\n≤\nK\n) には，\nj\n番目の領域を表す正整数\na\nj\n,\nb\nj\n,\nc\nj\n,\nd\nj\nが空白を区切りとして書かれている．(\na\nj\n,\nb\nj\n) は調査領域の北西の角の区画を，(\nc\nj\n,\nd\nj\n) は調査領域の南東の角の区画を表す．ただし，\na\nj\n,\nb\nj\n,\nc\nj\n,\nd\nj\nは，1 ≤\na\nj\n≤\nc\nj\n≤\nM\n, 1 ≤\nb\nj\n≤\nd\nj\n≤\nN\nを満たす．\n出力\n標準出力に調査の結果を表す\nK\n行を出力せよ．出力の\nj\n行目には， j 番目の調査領域に含まれる「ジャングル」(J) の区画数，「海」(O) の区画数，「氷」(I) の区画数を表す3 つの整数を，この順に空白を区切りとして書け．\n採点基準\n採点用データのうち，配点の30%分については，\nM\n≤ 50 かつ\nK\n≤ 100 を満たす．配点の50%分については，\nM\n≤ 50 を満たす．\n入出力の例\n入力例\n4 7\n4\nJIOJOIJ\nIOJOIJO\nJOIJOOI\nOOJJIJO\n3 5 4 7\n2 2 3 6\n2 2 2 2\n1 1 4 7\n出力例\n1 3 2\n3 5 2\n0 1 0\n10 11 7\nこの入力例では， 2 番目の領域は上図のように「ジャングル」を3 区画，「海」を5 区画，「氷」を2 区画含む．\n問題文と自動審判に使われるデータは、\n情報オリンピック日本委員会\nが作成し公開している問題文と採点用テストデータです。"},"candidates":{"kind":"list like","value":[{"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}],"string":"[\n {\n \"submission_id\": \"aoj_0560_10867525\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 16144,\n \"score_of_the_acc\": -0.8264,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_0560_10852785\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 19820,\n \"score_of_the_acc\": -0.7757,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_0560_10495891\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 26728,\n \"score_of_the_acc\": -0.2643,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_0560_10367010\",\n \"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() {}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 59468,\n \"score_of_the_acc\": -1,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_0560_10338023\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 26792,\n \"score_of_the_acc\": -1.199,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_0560_9876065\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 20020,\n \"score_of_the_acc\": -0.1135,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_0560_9762226\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 14968,\n \"score_of_the_acc\": -0.6667,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_0560_9739601\",\n \"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!!\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 26432,\n \"score_of_the_acc\": -0.2576,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_0560_9121078\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 17076,\n \"score_of_the_acc\": -0.714,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_0560_8946965\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 35144,\n \"score_of_the_acc\": -0.5201,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_0560_8130793\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 34228,\n \"score_of_the_acc\": -0.4995,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_0560_8019598\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 15656,\n \"score_of_the_acc\": -0.0155,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_0560_7561881\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 18660,\n \"score_of_the_acc\": -0.083,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_0560_6856940\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 15492,\n \"score_of_the_acc\": -1.0118,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_0560_6799357\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 49788,\n \"score_of_the_acc\": -1.3158,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_0560_6781392\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 15844,\n \"score_of_the_acc\": -0.0197,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_0560_6698298\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 21992,\n \"score_of_the_acc\": -0.6912,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_0560_6698214\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 22084,\n \"score_of_the_acc\": -0.3599,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_0560_6670572\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 15096,\n \"score_of_the_acc\": -0.4029,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_0560_6444688\",\n \"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}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 18492,\n \"score_of_the_acc\": -0.0792,\n \"final_rank\": 3\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":3,"numItemsPerPage":100,"numTotalItems":2103,"offset":300,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3OTM1MzE1OCwic3ViIjoiL2RhdGFzZXRzL09OTFlTTElNRS9BT0otQ29kZVJhbmstQmVuY2htYXJrIiwiZXhwIjoxNzc5MzU2NzU4LCJpc3MiOiJodHRwczovL2h1Z2dpbmdmYWNlLmNvIn0.adhx5LT5y5s8_zEI-PKDZNxCfrZ4EFBi8waxV-BoYmQd2y35ZJB9qV0tLFnu5XMeeXWAXw4bQ1wsOmKSlnzEDA","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":2103,"numBytesParquet":46097533}]},"discussionsStats":{"closed":0,"open":1,"total":1},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
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.... | [
{
"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[1... |
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 perf... | [
{
"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... |
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-nega... | [
{
"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 = {N... |
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 followi... | [
{
"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... |
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 c... | [
{
"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');... |
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 me... | [
{
"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... |
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 on... | [
{
"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... |
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 the... | [
{
"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... |
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 n... | [
{
"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& ... |
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... | [
{
"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... |
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... | [
{
"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}... |
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... | [
{
"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, articulati... |
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 determin... | [
{
"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<strin... |
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 na... | [
{
"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_Ma... |
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$ number... | [
{
"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 (in... |
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 o... | [
{
"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) ... |
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... | [
{
"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... |
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 in... | [
{
"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... |
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 n... | [
{
"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... |
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 la... | [
{
"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... |
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 develop... | [
{
"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;\... |
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 inters... | [
{
"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>> re... |
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 po... | [
{
"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())\ntempla... |
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... | [
{
"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... |
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}, ..... | [
{
"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... |
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 coun... | [
{
"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// #incl... |
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... | [
{
"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... |
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 mac... | [
{
"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... |
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 cla... | [
{
"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++)... |
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 th... | [
{
"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(doubl... |
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 strin... | [
{
"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 +=... |
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 ... | [
{
"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 re... |
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 operat... | [
{
"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] ... |
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... | [
{
"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--)\... |
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, ... | [
{
"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();\... |
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 placi... | [
{
"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_unlocke... |
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 ... | [
{
"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\t... |
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 a... | [
{
"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\... |
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... | [
{
"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... |
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 ch... | [
{
"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... |
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 ... | [
{
"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... |
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... | [
{
"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... |
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 horizo... | [
{
"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\... |
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 mak... | [
{
"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 ... |
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 ... | [
{
"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\... |
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 compartme... | [
{
"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\... |
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... | [
{
"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 lon... |
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, streng... | [
{
"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\... |
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 chara... | [
{
"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(... |
aoj_0488_cpp | テレポート移動網
人類は研究の末、ついにテレポート装置を利用した移動網を構築できるようになった。テレポート装置が設置できるのは$1$から$N$までの番号が付いた地点だけで、全部で$M$台のテレポート装置が設置されている。$i$番目のテレポート装置は地点$a_i$に設置されており、移動先$b_i$と使用コスト$f_i$が設定されている。地点$a_i$にいる利用者は使用コスト$f_i$を支払うと地点$b_i$に移動できる。
テレポート装置の利用者は事前に申請をすれば、装置を他の地点に移設できる。装置１台を１つ離れた番号の地点に移設するごとに申請が１回必要で、１回当たり申請コスト$C$がかかる。申請には以下のルールがある。
１回の申請では... | [
{
"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:... |
aoj_0485_cpp | 税の徴収
イヅア村には$1$から$N$までの番号が付いた$N$軒の家がある。この村では、$M$人の徴税官が税を徴収する。徴税官は家を訪れて税金を徴収する。1軒の家で徴収する金額は、徴税官ごとに決まっている。
はじめに、徴税官はそれぞれ異なる家に派遣され、そこで税金を徴収する。
次に、徴税官がいる家のうち番号が一番小さい家にいる徴税官が、それよりも大きい番号の家のうち、まだ徴税が済んでいない最も番号が小さい家に移動し、そこで税金を徴収する。これを繰り返し、どの徴税官も税金を徴収できなくなったら徴収を終える。
家の軒数と徴税官の人数、各徴税官が徴収する金額と最初に派遣される家の番号が与えられたとき、イヅア村から徴収できる税金の総額を求め... | [
{
"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);}\... |
aoj_0486_cpp | 一方通行迷路ゲーム
あなたは一方通行迷路ゲームというコンピュータゲームで遊んでいる。このゲームでは、H行W列のマスで区切られた長方形が画面上に表示される。各マスは壁、道、スタート、ゴールのいずれかで、スタートとゴールはそれぞれ一つだけである。道のマスとスタートのマスでは、上下左右に隣接する道のマスかゴールのマスだけに進むことができる。ただし、道のマスのうちいくつかは一方通行のマスであり、上下左右のうち一つの方向にしか出られない。
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);}\... |
aoj_0487_cpp | パスワードをお忘れですか？
二郎君は数式を用いたセキュリティシステムを開発した。システムにはa、b、c、dを変数とする数式が設定されており、それぞれに０から９までの整数を入力すると計算が行われる。その計算結果が正の整数$N$と一致したとき、ロックが解除される。ロックを解除できる４つの整数をa,b,c,dの順に並べた４桁の数字の列がパスワードになる。
二郎君はこのシステムで彼が使っているパスワードを忘れてしまった。幸い、二郎君はシステムに設定されている数式と、$N$の値は覚えていたので、それを使ってパスワードを特定しようと考えた。
システムに設定されている数式と正の整数Nが与えられたとき、パスワードの候補の数を求めるプログラムを作成せ... | [
{
"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 ... |
aoj_0489_cpp | 農地開発
イヅア国では国内にある広大な土地を利用して、複数の農園を開拓することになった。
イヅア国ではすでに$N$箇所の農園が開拓されており、農園には$1$から$N$までの番号がついている。農園の間にはそれらを直接つなぐ道が、全部で$N-1$本ある。どの道も同じ長さで、どちらの方向にも通ることができる。また、どの農園からでも、いくつかの道を通っていくことで他のどの農園にも到達できる。また、それぞれの農園では、その農園の収支を記録している。
あなたは新しい任務としてイヅア国の農園の拡張と管理を任される予定である。上司から、以下の２種類の作業をいくつか組み合わせた指示を受け取ることになった。
作業１：農園を新たに開拓し、すでにある農園と... | [
{
"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=... |
aoj_0503_cpp | 大きさが異なる n 個のコップと 3 つのトレイ（お盆）A，B，C があり，それらのコップは 3 つのトレイの上にそれぞれ何個かずつ一山に重ねて置かれている．ただし，どのトレイにおいても，そのトレイの中で一番小さいコップが一番下に， 2 番目に小さいコップがその上に， 3 番目に小さいコップがその上にと，小さい順に伏せて重ねてある．例えば，下図の右側は， n = 5 個のコップがトレイ A，B，C にそれぞれ 2 個，0 個，3 個重ねて置かれている状態を示している．
このように，コップの初期状態が与えられたとき，次の規則 1 〜 3 を守りながら，すべてのコップを A または C のどちらかのトレイに移動させるには何回移動を行えば... | [
{
"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 na... |
aoj_0501_cpp | 与えられた変換表にもとづき，データを変換するプログラムを作成しなさい．
データに使われている文字は英字か数字で，英字は大文字と小文字を区別する．変換表に現れる文字の順序に規則性はない．
変換表は空白をはさんで前と後ろの 2 つの文字がある(文字列ではない)．変換方法は，変換表のある行の前の文字がデータに現れたら，そのたびにその文字を後ろの文字に変換し出力する．変換は 1 度だけで，変換した文字がまた変換対象の文字になっても変換しない．変換表に現れない文字は変換せず，そのまま出力する．
入力ファイルには，変換表（最初の n + 1 行）に続き変換するデータ（n + 2 行目以降）が書いてある． 1 行目に変換表の行数 n，続く n 行... | [
{
"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 ... |
aoj_0504_cpp | 次のようなゲームを考える． 1 から n までの数が 1 つずつ書かれた n 枚のカードが k 組ある．これら kn 枚のカードをよくシャッフル（よく切ること）して， k 枚ずつの山を作り横一列に並べる．このようにしてできる n 個の山の左から i 番目の（k 枚のカードの）山を「山 i 」と呼ぶことにする．
ゲームは山 1 から始める．山の一番上のカード 1 枚を引き（引いたカードは元の山に戻さない），そのカードに書かれていた数が i だった場合には山 i の一番上のカード 1 枚を引く．このようにして，引いたカードに書かれていた数を番号とする山の一番上のカード 1 枚を引くことを繰り返し，すべての山にカードが無くなれば成功である... | [
{
"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 (u... |
aoj_0506_cpp | 0 から 9 までの数字だけで構成された文字列が与えられたとき,その文字列から次の規則に従って新しい文字列を作る操作を考える.与えられた文字列を左端から1文字ずつ順に読んで行き,同じ数字
a
が
r
個続いていた場合,個数
r
と数字
a
を空白で区切らずにこの順で書き出す.与えられた文字列の右端まで読み,最後の書き出しが終わったところまでを途中何回書き出しがあったとしても全部まとめて操作1回とカウントする.2回目以降の操作は前回の操作により書き出された文字列を与えられた文字列として同様の操作を実施する.例えば “
122244
” という文字列が与えられた場合には左端から順に1個の1, 3個の2,2個の4なのでこの操作1回で得られ... | [
{
"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 ... |
aoj_0505_cpp | ある学校で修学旅行へ行く計画がある.そのためにアンケート調査を行った.
生徒は 1 から
n
までの生徒番号を持ち,旅行候補の場所を 1 から
m
までの番号で表し,行きたい場所に ○,行きたくない場所に×の印をつけて提出している.
このとき, 行きたい場所の人数が多い順に,場所の番号を出力するプログラムを作成せよ.人数が同じときは,場所の番号順とする.
入力データ の 1 行目は生徒の人数
n
と旅行候補の場所の数
m
が空白で区切られ,
i
+ 1 行に生徒
i
のアンケート結果を ○ は 1 で×は 0 で表し,空白で区切られた
m
個の数字が並んでいる.1 ≤
n
≤ 1000, 1 ≤
m
≤ 100 とする.
入力例１
... | [
{
"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 whi... |
aoj_0514_cpp | 品質検査
問題
あなたはある機械の製造工場で品質管理の責任者をしている． この機械には， 部品として電源とモーターとケーブルが必要である． 製造工場には電源が a 個， モーターが b 個， ケーブルが c 個あり， それぞれ 1 から a まで， a+1 から a+b まで， a+b+1 から a+b+c までの番号が付いている． 困ったことに， 部品の中に故障しているものがあるかもしれない． 工場ではどの部品が故障していてどの部品が正常であるかを知りたい．
そこで， 工場では次の方法で部品を検査した． 電源とモーターとケーブルを１つずつ持ってきてつなぎ， 動作させてみる． このとき， ３つの部品がすべて正常であるときは正しく動作... | [
{
"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(... |
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] と鎖 [... | [
{
"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... |
aoj_0509_cpp | 平面に長方形のシートが何枚か置かれている. これらのシートで覆われている部分の面積や周長を求めるプログラムを作成せよ.
ただし, 平面を座標平面とみなしたとき, シートの配置は次の条件 (1), (2) を満たすものとする.
(1) 各シートの長方形の 4 頂点の
x
,
y
座標は全て 0 以上 10000 以下の整数であり, 長方形の各辺は
x
軸, または
y
軸に平行である.
(2) シートの枚数は高々 10000 枚以下である.
入力データ の 1 行目に長方形の個数
n
と問題の種類を表す整数
r
が空白で区切って書かれている. 2 行目以降の各行には, 各シートの左下頂点座標 (
x
1
,
y
1
) と右上頂点座標... | [
{
"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(i... |
aoj_0520_cpp | 最軽量のモビール
問題
モビールは動く芸術品として広く親しまれている.IOI 日本委員会では,JOI を広報するためにモビールを作成することになった.JOI 広報用モビールは,棒,紐(ひも),錘(おもり)の 3 種類の要素を用いて,次のように構成される.
棒の一方の端は青に,もう一方の端は赤に塗られている.
棒は両端以外の 1 箇所を支点として紐でつるされる.
支点から赤の端までの長さも支点から青の端までの長さも正整数である.
棒の両端には,紐で錘か他の棒をつるす.
錘は紐を用いてどれかの棒の一端につるされる.
錘には何もつるさない.
錘の重さは正整数である.
紐のうち 1 本だけは,片方の端をある棒をつるすためにその棒の支点に結ば... | [
{
"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 ... |
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
,... | [
{
"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 ... |
aoj_0515_cpp | 通学経路
問題
太郎君の住んでいるJOI市は，南北方向にまっすぐに伸びる a 本の道路と，東西方向にまっすぐに伸びる b 本の道路により，碁盤の目の形に区分けされている．
南北方向の a 本の道路には，西から順に 1, 2, ... , a の番号が付けられている．また，東西方向の b 本の道路には，南から順に 1, 2, ... , b の番号が付けられている．西から i 番目の南北方向の道路と，南から j 番目の東西方向の道路が交わる交差点を (i, j) で表す．
太郎君は，交差点 (1, 1) の近くに住んでおり，交差点 (a, b) の近くのJOI高校に自転車で通っている．自転車は道路に沿ってのみ移動することができる．太郎... | [
{
"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... |
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... | [
{
"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 ... |
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 のカードが与えられたとき,このカードを使っ
て作れる連続した整数列のうち最長... | [
{
"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;... |
aoj_0518_cpp | 最古の遺跡
問題
昔, そこには集落があり, 多くの人が暮らしていた. 人々は形も大きさも様々な建物を建てた. だが, それらの建造物は既に失われ, 文献と, 遺跡から見つかった柱だけが建造物の位置を知る手がかりだった.
文献には神殿の記述がある. 神殿は上から見ると正確に正方形になっており, その四隅には柱があった. 神殿がどの向きを向いていたかはわからない. また, 辺上や内部に柱があったかどうかもわからない. 考古学者たちは, 遺跡から見つかった柱の中で, 正方形になっているもののうち, 面積が最大のものが神殿に違いないと考えた.
柱の位置の座標が与えられるので, 4 本の柱でできる正方形のうち面積が最大のものを探し, その面... | [
{
"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<i... |
aoj_0526_cpp | 船旅
問題
JOI国には，n 島の島があり，各島には 1 から n までの番号が付けられている．現在，JOI国では各島の間を結ぶ航路網の整備が進んでいる．
あなたは，船舶の切符を扱っているチケットセンターに勤務している．JOI国には船舶を使って，できる限り安価に，島と島の間を旅行したいと考えている人が沢山おり，彼らは，出発地と目的地を注文票に記入して，あなたのところに送ってくる．
あなたの仕事は，客から注文票を受け取ったらすぐに，いくつかの船舶を乗り継いで，出発地と目的地を結ぶ航路の中で，もっとも安価な運賃を計算し，客に伝えることである．
ただし，旅程によっては，船舶を使って旅行することが出来ない場合もある．そのときは『船舶を使って... | [
{
"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... |
aoj_0519_cpp | 最悪の記者
問題
あなたは JOI 新聞社の記者であり，スポーツ記事を担当している．
昨日までに，クロアチアでは，n 個のサッカーチームによる総当りのリーグ戦が行われた．大会実行委員会は，試合結果と規定に基づき各チームに 1 位から n 位までの順位をつけたようである．あなたには，一部の試合の勝敗とともに，次の情報が伝えられた．
情報 1
引き分けの試合はなかった．
情報 2
全てのチームに異なる順位がついた．
情報 3
全ての 1 ≤ a < b ≤ n に対し，a 位のチームと b 位のチームの試合において，必ず a 位のチームが勝利した．
あなたは記事を作成するために，一部の試合の勝敗と，伝えられた情報 1 3 をもとに，順位... | [
{
"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)... |
aoj_0524_cpp | 星座探し
問題
あなたは星空の写真の中から星座を探している．写真には必ず，探したい星座と同じ形・向き・大きさの図形がちょうど一つ含まれている．ただし，写真の中には星座を構成する星以外に余分な星が写っている可能性がある．
例えば，図 1 の星座は図 2 の写真に含まれている（丸で囲んで示した）．与えられた星座の星の座標を x 方向に 2， y 方向に −3 だけ平行移動すると写真の中の位置になる．
探したい星座の形と写真に写っている星の位置が与えられたとき，星座の座標を写真の中の座標に変換するために平行移動するべき量を答えるプログラムを書け．
図 1: 探したい星座
図 2: 星空の写真
入力
入力は複数のデータセットからなる．各デー... | [
{
"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#... |
aoj_0527_cpp | 碁石ならべ
問題
白と黒の碁石をテーブルの上にならべて遊ぶ.まずテーブルの左端に碁石を置く.次に左から 2 番目の場所に碁石を置く.これを n 回繰り返して n 個の碁石を横一列にならべる.ただし,新しく i 番目の碁石を置く際には,次のルールに従ってテーブル上の碁石を置き換える.
i が奇数の場合: テーブルに置いてあった碁石は置き換えず,新しい碁石を左
から i 番目に置く.
i が偶数の場合: 新しく左から i 番目に置く碁石の色とテーブル上の右端の碁
石の色が同じ場合は,テーブル上の碁石は置き換えず,新しい碁石を左から i
番目に置く.そうでない場合,すなわち,新しく左から i 番目に置く碁石の色
... | [
{
"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]=... |
aoj_0528_cpp | 共通部分文字列
問題
2 個の文字列が与えられたとき, 両方の文字列に含まれる文字列のうち最も長いものを探し, その長さを答えるプログラムを作成せよ.
ここで, 文字列 s が文字列 t に含まれるとは, t の中に s が連続して現れることをいう. 空文字列, すなわち長さ 0 の文字列は, どんな文字列にも含まれる. 例えば, 文字列 ABRACADABRA には次の文字列が含まれる: ABRA, RAC, D, ACADABRA, ABRACADABRA,空文字列など. 一方, 文字列 ABRACADABRA には次の文字列は含まれない: ABRC, RAA,BA, K など.
例
例 1: 文字列として ABRACADABR... | [
{
"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... |
aoj_0529_cpp | ダーツ
問題
あなたは以下のルールでダーツゲームをすることになった.
あなたは,矢を的(まと)に向かって 4 本まで投げることができる.必ずしも 4 本全てを投げる必要はなく,1 本も投げなくてもかまわない.的は N 個の部分に区切られていて,各々の部分に点数 P
1
,..., P
N
が書か れている.矢が刺さった場所の点数の合計 S があなたの得点の基礎となる.S があらかじめ決められたある点数 M 以下の場合は S がそのままあなたの得点となる.しかし,S が M を超えた場合はあなたの得点は 0 点となる.
的に書かれている点数と M の値が与えられたとき,あなたが得ることのできる点数の最大値を求めるプログラムを作成せ... | [
{
"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)... |
aoj_0530_cpp | ぴょんぴょん川渡り
問題
ある川で,一方の岸から石の上を次々と飛び移って反対側の岸まで行くという少々危険なゲームがはやっている.
今,図 4-1 のように,石はマス目の上に存在すると考える.行の数は n である. 図 4-1 では n = 5 である.
このゲームでは,一方の岸から始めて,通常のジャンプまたは m 回以下の一行飛ばしのジャンプをして反対側の岸まで渡る.通常のジャンプとは,今いる行の一つ先の行の岸または石のどれかに飛び移ることであり,一行飛ばしのジャンプとは,今いる行の二つ先の行の岸または石のどれかに飛び移ることである.始める岸の一つ先の行は 1 行目,二つ先の行は 2 行目であり,n − 1 行目の二つ先の行,及び ... | [
{
"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 ... |
aoj_0525_cpp | おせんべい
問題
IOI製菓では，創業以来の伝統の製法で煎餅（せんべい）を焼いている．この伝統の製法は，炭火で一定時間表側を焼き，表側が焼けると裏返して，炭火で一定時間裏側を焼くというものである．この伝統を守りつつ，煎餅を機械で焼いている．この機械は縦 R (1 ≤ R ≤ 10) 行, 横 C (1 ≤ C ≤ 10000) 列の長方形状に煎餅を並べて焼く．通常は自動運転で，表側が焼けたら一斉に煎餅を裏返し裏側を焼く．
ある日，煎餅を焼いていると，煎餅を裏返す直前に地震が起こり何枚かの煎餅が裏返ってしまった．幸いなことに炭火の状態は適切なままであったが，これ以上表側を焼くと創業以来の伝統で定められている焼き時間を超えてしまい，煎餅... | [
{
"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 f... |
aoj_0534_cpp | 連鎖
問題
次のようなゲームがある．
あるキャラクターが縦 1 列に N 個並んでいる．これらのキャラクターの色は赤，青，黄のいずれかであり，初期状態で同じ色のキャラクターが4つ以上連続して並んでいることはない．プレーヤーは，ある位置のキャラクターを選び他の色に変更することができる．この操作により同じ色のキャラクターが4つ以上連続して並ぶとそれらのキャラクターは消滅する．キャラクターが消滅することにより新たに同じ色のキャラクターが4つ以上連続して並ぶとそれらのキャラクターも消滅し，同じ色のキャラクターが4つ以上連続して並んでいる箇所がなくなるまでこの連鎖は続く．このゲームの目的は，消滅しないで残っているキャラクター数をなるべく少なく... | [
{
"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 Contai... |
aoj_0535_cpp | 薄氷渡り
問題
冬の寒いある日，JOI太郎君は広場にはった薄氷を割って遊ぶことにした．広場は長方形で，東西方向に m 個，南北方向に n 個，つまり， m × n の区画に区切られている．また，薄氷が有る区画と無い区画がある． JOI太郎君は，次のルールにしたがって，薄氷を割りながら区画を移動することにした．
薄氷があるどの区画からも薄氷を割り始めることができる．
東西南北のいずれかの方向に隣接し， まだ割られていない薄氷のある区画に移動できる．
移動した先の区画の薄氷をかならず割る．
JOI太郎君が薄氷を割りながら移動できる区画数の最大値を求めるプログラムを作成せよ．ただし， 1 ≤ m ≤ 90，1 ≤ n ≤ 90 である．与... | [
{
"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<vect... |
aoj_0531_cpp | ペンキの色
問題
情報オリンピックの宣伝のために,長方形のベニヤ板にペンキを塗り看板を制作したい.ベニヤ板には色を塗りたくないところにあらかじめ何枚かの長方形のマスキングテープが貼られている.そこでマスキングテープで区切られた領域ごとに別々の色を使いペンキを塗ることにした.例えば,図 5-1 の場合は 5 色のペンキを使う.
入力としてマスキングテープを貼る位置が与えられた時,使うペンキの色の数を求めるプログラムを作成せよ.ただし,ベニヤ板全体がマスキングテープで覆われることはなく,全てのマスキングテープの辺はベニヤ板のいずれかの辺に平行である.
入力
入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．
1 ... | [
{
"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;... |
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 <optio... |
aoj_0537_cpp | ビンゴ
問題
あるプログラミングコンテストでは,競技後の懇親会でビンゴゲームをする習わしがある．しかし,このビンゴゲームで使うビンゴカードは少々特殊で,以下の条件に従って作成される．
ビンゴカードは N 行 N 列のマス目に区切られており，各マス目には正整数が１つずつ書かれている．それらの整数は全て異なる．
マス目に書かれている整数は 1 以上 M 以下である．
ビンゴカードに書かれているN×N個の整数の合計は S である．
どの列を見たときも，上から下に向かって整数は昇順に並んでいる．
どのマス目の整数も，そのマス目より左の列のどの整数よりも大きい．
以下は， N = 5, M = 50, S = 685 のときのビンゴカードの例... | [
{
"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 ... |
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 君... | [
{
"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 ... |
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 ... | [
{
"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... |
aoj_0545_cpp | パーティー
問題
あなたはクリスマスパーティーに学校内の自分の友達と，自分の友達の友達を招待することにした．
あなたの通う学校の生徒数は n 人であり，それぞれの生徒には 1 から n までの番号が割り振られている．
あなたの番号は 1 である．
あなたの手元には，誰と誰が友達であるかを記したリストがある．
このリストをもとに，
あなたがクリスマスパーティーに招待する生徒数を求めるプログラムを作成せよ．
入力
入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．
データセットの1 行目には学校の生徒数 n （2 ≤ n ≤ 500）が，
2 行目にはリストの長さ m （1 ≤ m ≤ 10000）が書かれている... | [
{
"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... |
aoj_0542_cpp | 認証レベル
問題
あなたは Just Odd Inventions 社を知っているだろうか? この会社の業務は「ただ奇妙な発明 (just odd inventions)」をすることである.ここでは略して JOI 社と呼ぶ.
JOI 社には 2 つの事務所があり,それぞれ同じ大きさの正方形の部屋がマス目状に並んでできている.辺で接しているすべての部屋の間に,身分証による認証機能の付いた扉がある.JOI 社では様々なレベルの機密情報を扱っているため,部屋ごとに機密レベルという正の整数が設定されており,身分証の事務所ごとに定められた非負整数の認証レベルが,機密レベル以上でないとその部屋に入室することができない.各事務所の出入り口は唯一あ... | [
{
"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 RE... |
aoj_0547_cpp | 通勤経路
問題
JOIさんが住むカナダのある都市は，南北方向にまっすぐに伸びる w 本の道路と，東西方向にまっすぐに伸びる h 本の道路により，碁盤の目の形に区分けされている．
南北方向の w 本の道路には，西から順に 1, 2, ... , w の番号が付けられている．また，東西方向の h 本の道路には，南から順に 1, 2, ... , h の番号が付けられている．西から i 番目の南北方向の道路と，南から j 番目の東西方向の道路が交わる交差点を (i, j) で表す．
JOIさんは，交差点 (1, 1) の近くに住んでおり，交差点 (w, h) の近くの会社に車で通っている．車は道路に沿ってのみ移動することができる．JOIさ... | [
{
"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)... |
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
... | [
{
"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()... |
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 を作ることができる．
このように，異なるカー... | [
{
"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\ts... |
aoj_0548_cpp | 方向音痴のトナカイ
問題
今年も JOI 町にサンタクロースが空からやってきた．JOI 町にある全ての家には子供がいるので，このサンタクロースは JOI 町の全ての家にプレゼントを配ってまわらなければならない．しかし，今年は連れているトナカイが少々方向音痴であり，また建物の上以外に降りることができないため，全ての家にプレゼントを配るためには少々道順を工夫しなければならないようだ．
JOI 町は東西南北に区画整理されており，各区画は家，教会，空き地のいずれかである．JOI 町には 1 つだけ教会がある．次のルールに従い，サンタクロースとトナカイは教会から出発し，全ての家に 1 回ずつプレゼントを配った後，教会に戻る．
今年のトナカイは... | [
{
"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 ... |
aoj_0541_cpp | 散歩
問題
JOI 町に住む太郎君は, ある日,健康増進のために散歩を日課にしようと思い立った.
太郎君の住む JOI 町には,図のように,東西方向に走る (
H
+ 1) 本の道路と,南北
方向に走る (
W
+ 1) 本の道路が碁盤目状に通っている.太郎君の家はもっとも北西の
交差点にあり,ここから散歩を開始する.
以降,北から
a
番目,西から
b
番目の交差点を (
a
,
b
) で表す.たとえば,太郎君の家がある交差点は (1, 1) である.
図: JOI 町の図 (
H
= 3,
W
= 4 の場合).図の上が北,左が西に対応する.
太郎君は,散歩のルートが日々違ったほうが面白いと考えたので,(1, 1) から (... | [
{
"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 // ... |
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) には... | [
{
"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] =... |
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 までま... | [
{
"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;\... |
aoj_0552_cpp | 博覧会
問題
JOI 市では,とある大規模な博覧会を開催することになった.
今回の博覧会には 2 つのテーマがあり,JOI 市にある N 個の展示施設でそれぞれ,
2 つのテーマのうちどちらか一方に沿った展示を行う予定である.
施設の位置は平面座標 (x, y) で表される.位置 (x, y) にある施設から (x′ , y′) にある施設まで移動するためには, |x − x′| + |y − y′| だけの時間がかかる (整数 a に対して,
|a| で a の絶対値を表す).同一テーマ内での統一感を出すため,および一方のテーマのみに関心を持つ人に不便を感じさせないために,同一のテーマで展示を行っている 2 つの施設の間の移動時間... | [
{
"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;... |
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 ずつ伸びる... | [
{
"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[2000... |
aoj_0556_cpp | タイル (Tile)
問題
JOI 高校では， 1 × 1 の正方形のタイルを使って N × N の正方形の壁画を作り，文化祭で展示することになった．タイルの色は，赤，青，黄の 3 種類である．壁画のデザインは次の通りである．まず，最も外側の周に赤のタイルを貼り，その内側の周に青のタイルを貼る．さらにその内側の周に黄色のタイルを貼る．これを N × N の正方形が埋め尽くされるまで繰り返す．用いるタイルの色は，一番外側の周から順番に赤，青，黄，赤，青，黄，…である．
文化祭が近づいてきたある日，壁画のうち K 枚のタイルがはがれていることが判明した．そこで，新しいタイルを購入して，はがれた箇所に新しいタイルを貼ることにした．
入力と... | [
{
"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++){... |
aoj_0553_cpp | ダンジョン
問題
あなたはあるダンジョンの地下 N 階にある財宝を手に入れたいと思っている.最初,あなたは地下 1 階におり,あなたの体力は H(H は正整数) である.下の階に降りるときに,体力が消費される.あらかじめ各階における下の階に降りるときに消費される体力が分かっている.一方,各階には 1 つの回復の泉があり,泉を 1 回使うごとに回復できる体力がそれぞれ定まっている.体力が 0 以下になるとあなたは死んでしまう.また,体力が H よりも高くなることはない.回復の泉は何回でも使うことができるが,回復には時間がかかるので,あなたは泉の使用回数をできるだけ少なくしたいと考えている.
N ,H ,各階の下の階に降りるときに消費さ... | [
{
"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; ... |
aoj_0561_cpp | 古本屋(Books)
あなたの町にはJOI 古本店という老舗の古本屋があり，あなたはJOI 古本店をよく利用している．それぞれの本には基準価格が定まっており，JOI 古本店に行けばその価格で買い取ってもらえる．
JOI 古本店では，本を小説,漫画,雑誌など10 種類のジャンルに分類して扱っている．ジャンルには1から10 までの番号が付けられている．JOI 古本店には，同じジャンルの本をまとめて買い取ってもらうと高値で買い取ってくれるというサービスがある．具体的には，同じジャンルの本をまとめてT 冊買い取ってもらう場合，そのジャンルの本の一冊あたりの買取価格が基準価格よりT - 1 円高くなる．例えば，同じジャンルで基準価格100 円... | [
{
"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#d... |
aoj_0562_cpp | JOI 国の買い物事情(Shopping in JOI Kingdom)
JOI 国には
N
個の町があり，それらの間は
M
本の双方向に通行可能な道路で結ばれている．
K
個の町にはショッピングモールがあり，国民は道路を通ってそれらの町のいずれかに行き買い物をする．
家の場所によっては，買い物に行くために長い距離を移動する必要があり，それは非常に不便である．国王はこの実情を把握するため，ショッピングモールのある町までの最短距離が家の場所によってどれだけ長くなりうるのかを調べることにした．家は道路の途中に建てられることもあるので(入力例1 の説明を参照)，この調査は非常に大変である．そこで国王は，優秀なプログラマーであるあなたに，調... | [
{
"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[10000... |
aoj_0568_cpp | パスタ (Pasta)
問題
あなたはパスタが大好物であり，毎日，晩御飯にパスタを作って食べている．あなたはトマトソース，クリームソース，バジルソースの 3 種類のパスタを作ることができる．
N 日間の晩御飯の予定を考えることにした．それぞれの日に 3 種類のパスタから 1 種類を選ぶ．ただし，同じパスタが続くと飽きてしまうので，3 日以上連続して同じパスタを選んではいけない．また，N 日のうちの K 日分のパスタはすでに決めてある．
入力として N の値と，K 日分のパスタの情報が与えられたとき，条件をみたす予定が何通りあるかを 10000 で割った余りを求めるプログラムを作成せよ．
入力
入力は K + 1 行からなる．
1 行... | [
{
"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... |
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
) ... | [
{
"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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.