Task: | Shakki |
Sender: | |
Submission time: | 2015-12-06 17:39:13 +0200 |
Language: | C++ |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | RUNTIME ERROR | 0 |
#2 | RUNTIME ERROR | 0 |
#3 | WRONG ANSWER | 0 |
#4 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | RUNTIME ERROR | 0.14 s | 1 | details |
#2 | RUNTIME ERROR | 0.15 s | 1 | details |
#3 | RUNTIME ERROR | 0.20 s | 1 | details |
#4 | RUNTIME ERROR | 0.15 s | 1 | details |
#5 | WRONG ANSWER | 0.06 s | 1 | details |
#6 | WRONG ANSWER | 0.08 s | 1 | details |
#7 | RUNTIME ERROR | 0.19 s | 1 | details |
#8 | RUNTIME ERROR | 0.14 s | 1 | details |
#9 | RUNTIME ERROR | 0.14 s | 1 | details |
#10 | RUNTIME ERROR | 0.14 s | 1 | details |
#11 | RUNTIME ERROR | 0.15 s | 2 | details |
#12 | WRONG ANSWER | 0.07 s | 2 | details |
#13 | RUNTIME ERROR | 0.16 s | 2 | details |
#14 | RUNTIME ERROR | 0.15 s | 2 | details |
#15 | RUNTIME ERROR | 0.21 s | 2 | details |
#16 | WRONG ANSWER | 0.06 s | 2 | details |
#17 | RUNTIME ERROR | 0.14 s | 2 | details |
#18 | ACCEPTED | 0.06 s | 2 | details |
#19 | RUNTIME ERROR | 0.14 s | 2 | details |
#20 | RUNTIME ERROR | 0.19 s | 2 | details |
#21 | WRONG ANSWER | 0.05 s | 3 | details |
#22 | RUNTIME ERROR | 0.14 s | 3 | details |
#23 | WRONG ANSWER | 0.07 s | 3 | details |
#24 | WRONG ANSWER | 0.08 s | 3 | details |
#25 | WRONG ANSWER | 0.10 s | 3 | details |
#26 | RUNTIME ERROR | 0.15 s | 3 | details |
#27 | RUNTIME ERROR | 0.19 s | 3 | details |
#28 | WRONG ANSWER | 0.08 s | 3 | details |
#29 | RUNTIME ERROR | 0.14 s | 3 | details |
#30 | RUNTIME ERROR | 0.19 s | 3 | details |
#31 | WRONG ANSWER | 0.09 s | 4 | details |
#32 | RUNTIME ERROR | 0.14 s | 4 | details |
#33 | RUNTIME ERROR | 0.14 s | 4 | details |
#34 | WRONG ANSWER | 0.08 s | 4 | details |
#35 | RUNTIME ERROR | 0.20 s | 4 | details |
#36 | ACCEPTED | 0.06 s | 4 | details |
#37 | WRONG ANSWER | 0.06 s | 4 | details |
#38 | RUNTIME ERROR | 0.19 s | 4 | details |
#39 | RUNTIME ERROR | 0.20 s | 4 | details |
#40 | RUNTIME ERROR | 0.20 s | 4 | details |
Compiler report
input/code.cpp: In function 'void print_board(std::vector<std::vector<char> >&)': input/code.cpp:92:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int64_t i=0;i<board.size();i++) { ^ input/code.cpp:93:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int64_t j=0;j<board.size();j++) { ^ input/code.cpp: In function 'int main()': input/code.cpp:745:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int64_t i=0;i<moves.size();i++) { ^
Code
#include<iostream> #include<vector> #include<map> #include<set> #include<stack> #include<queue> #include<algorithm> #include<cmath> #include<utility> using namespace std; void rotate(vector<vector<char>> &b, int64_t x, int64_t y, int d) { if(d == 1) { char c=b[x][y]; b[x][y] = b[x][y+1]; b[x][y+1] = b[x+1][y+1]; b[x+1][y+1] = b[x+1][y]; b[x+1][y]=c; } else { char c=b[x][y]; b[x][y] = b[x+1][y]; b[x+1][y] = b[x+1][y+1]; b[x+1][y+1] = b[x][y+1]; b[x][y+1] = c; } } int64_t hsh(const vector<vector<char>> &b) { int64_t h=1; for(int64_t i=0;i<4;i++) { for(int64_t j=0;j<4;j++) { if(b[i][j] == 'M') { h=2*h+1; } else { h=2*h; } } } return h; } bool fine(const vector<vector<char>> &b) { for(int64_t i=0;i<3;i++) { for(int64_t j=0;j<3;j++) { if(b[i][j] == b[i+1][j] || b[i][j] == b[i][j+1]) { return false; } } if(b[i][3] == b[i+1][3]) return false; } for(int64_t j=0;j<3;j++) { if(b[3][j] == b[3][j+1]) return false; } return true; } vector<pair<int64_t,int64_t>> bfs(vector<vector<char>> &b, map<int64_t,pair<pair<int64_t,int64_t>,int64_t>> &found, int64_t hshstart) { queue<vector<vector<char>>> q; q.push(b); while(!q.empty()) { vector<vector<char>> bb=q.front(); q.pop(); if(fine(bb)) { int64_t tmp=hsh(bb); vector<pair<int64_t,int64_t>> moves; while(tmp != hshstart) { moves.push_back(found[tmp].first); tmp=found[tmp].second; } return moves; } int64_t oldhsh=hsh(bb); for(int64_t i=0;i<3;i++) { for(int64_t j=0;j<3;j++) { rotate(bb, i, j, 1); if(found.find(hsh(bb)) == found.end()) { q.push(bb); found[hsh(bb)]=make_pair(make_pair(i, j), oldhsh); } rotate(bb, i, j, -1); } } } return vector<pair<int64_t,int64_t>>(); } void print_board(vector<vector<char>> &board) { for(int64_t i=0;i<board.size();i++) { for(int64_t j=0;j<board.size();j++) { cout << board[j][i]; } cout << '\n'; } } int main(void) { vector<vector<char>> board(8,vector<char>(8)); for(int64_t i=0;i<8;i++) { for(int64_t j=0;j<8;j++) { char c; cin >> c; board[j][i]=c; } } vector<pair<int64_t,int64_t>> moves; int64_t A=0,B=0,C=0,D=0; for(int64_t x=0;x<4;x++) for(int64_t y=0;y<4;y++) if(board[x][y] == 'M') A++; for(int64_t x=4;x<8;x++) for(int64_t y=0;y<4;y++) if(board[x][y] == 'M') B++; for(int64_t x=0;x<4;x++) for(int64_t y=4;y<8;y++) if(board[x][y] == 'M') C++; for(int64_t x=4;x<8;x++) for(int64_t y=4;y<8;y++) if(board[x][y] == 'M') D++; while(A > 8) { if(B < 16) { int64_t x=4,y=0; for(;x<8;x++) { bool out=false; y=0; for(;y<4;y++) { if(board[x][y] == 'V') { out=true; break; } } if(out) break; } if(y == 0) { if(x == 4) { for(int64_t i=0;i<3;i++) { rotate(board,x,y,1); moves.push_back(make_pair(x,y)); } y++; } else { rotate(board,x-1,y,1); moves.push_back(make_pair(x-1,y)); y++; } } while(x > 4) { rotate(board,x-1,y-1,1); moves.push_back(make_pair(x-1,y-1)); x--; } int64_t xx=0,yy=0; for(;xx<4;xx++) { yy=0; bool out=false; for(;yy<4;yy++) { if(board[xx][yy] == 'M') { out=true; break; } } if(out) break; } if(yy == 3) { if(xx == 3) { for(int64_t i=0;i<3;i++) { rotate(board,xx-1,yy-1,1); moves.push_back(make_pair(xx,yy)); } yy--; } else { rotate(board,xx,yy-1,1); moves.push_back(make_pair(xx,yy-1)); yy--; } } while(yy > y-1) { rotate(board,xx,yy-1,1); moves.push_back(make_pair(xx,yy-1)); yy--; } while(xx < 3) { rotate(board,xx, yy, 1); moves.push_back(make_pair(xx,yy)); xx++; } rotate(board,xx, yy, 1); moves.push_back(make_pair(xx,yy)); A--; B++; } else if(C < 16) { int64_t x=0,y=4; for(;x<4;x++) { y=0; bool out=false; for(;y<8;y++) { if(board[x][y] == 'V') { out=true; break; } } if(out) break; } if(x == 3) { if(y == 4) { for(int64_t i=0;i<3;i++) { rotate(board,x-1,y,1); moves.push_back(make_pair(x-1,y)); } x--; } else { rotate(board,x-1,y-1,1); moves.push_back(make_pair(x-1,y-1)); x--; } } while(y > 4) { rotate(board,x,y-1,1); moves.push_back(make_pair(x,y-1)); y--; } int64_t xx=0,yy=0; for(;xx<4;xx++) { yy=0; bool out=false; for(;yy<4;yy++) { if(board[xx][yy] == 'M') { out=true; break; } } if(out) break; } if(yy == 3) { rotate(board,xx,yy-1,1); moves.push_back(make_pair(xx,yy-1)); yy--; } while(xx < x+1) { rotate(board,xx,yy,1); moves.push_back(make_pair(xx,yy)); xx++; } while(yy < 3) { rotate(board,xx-1,yy,1); moves.push_back(make_pair(xx-1,yy)); yy++; } rotate(board,xx-1,yy,1); moves.push_back(make_pair(xx-1,yy)); A--; C++; } } while(A < 8) { if(B > 0) { int64_t x=4,y=0; for(;x<8;x++) { bool out=false; y=0; for(;y<4;y++) { if(board[x][y] == 'M') { out=true; break; } } if(out) break; } if(y == 0) { if(x == 4) { for(int64_t i=0;i<3;i++) { rotate(board,x,y,1); moves.push_back(make_pair(x,y)); } y++; } else { rotate(board,x-1,y,1); moves.push_back(make_pair(x-1,y)); y++; } } while(x > 4) { rotate(board,x-1,y-1,1); moves.push_back(make_pair(x-1,y-1)); x--; } int64_t xx=0,yy=0; for(;xx<4;xx++) { yy=0; bool out=false; for(;yy<4;yy++) { if(board[xx][yy] == 'V') { out=true; break; } } if(out) break; } if(yy == 3) { if(xx == 3) { for(int64_t i=0;i<3;i++) { rotate(board,xx-1,yy-1,1); moves.push_back(make_pair(xx,yy)); } yy--; } else { rotate(board,xx,yy-1,1); moves.push_back(make_pair(xx,yy-1)); yy--; } } while(yy > y-1) { rotate(board,xx,yy-1,1); moves.push_back(make_pair(xx,yy-1)); yy--; } while(xx < 3) { rotate(board,xx, yy, 1); moves.push_back(make_pair(xx,yy)); xx++; } rotate(board,xx, yy, 1); moves.push_back(make_pair(xx,yy)); A--; B++; } else if(C > 0) { int64_t x=0,y=4; for(;x<4;x++) { y=0; bool out=false; for(;y<8;y++) { if(board[x][y] == 'M') { out=true; break; } } if(out) break; } if(x == 3) { if(y == 4) { for(int64_t i=0;i<3;i++) { rotate(board,x-1,y,1); moves.push_back(make_pair(x-1,y)); } x--; } else { rotate(board,x-1,y-1,1); moves.push_back(make_pair(x-1,y-1)); x--; } } while(y > 4) { rotate(board,x,y-1,1); moves.push_back(make_pair(x,y-1)); y--; } int64_t xx=0,yy=0; for(;xx<4;xx++) { yy=0; bool out=false; for(;yy<4;yy++) { if(board[xx][yy] == 'V') { out=true; break; } } if(out) break; } if(yy == 3) { rotate(board,xx,yy-1,1); moves.push_back(make_pair(xx,yy-1)); yy--; } while(xx < x+1) { rotate(board,xx,yy,1); moves.push_back(make_pair(xx,yy)); xx++; } while(yy < 3) { rotate(board,xx-1,yy,1); moves.push_back(make_pair(xx-1,yy)); yy++; } rotate(board,xx-1,yy,1); moves.push_back(make_pair(xx-1,yy)); A--; C++; } } if(D > 8) { if(B < 8) { /* B from D*/ while(B < 8) { int64_t x=4,y=4; for(;x<8;x++) { y=0; bool out=false; for(;y<8;y++) { if(board[x][y] == 'M') { out=true; break; } } if(out) break; } if(x == 7) { if(y == 4) { for(int64_t i=0;i<3;i++) { rotate(board,x-1,y,1); moves.push_back(make_pair(x-1,y)); } x--; } else { rotate(board,x-1,y-1,1); moves.push_back(make_pair(x-1,y-1)); x--; } } while(y > 4) { rotate(board,x,y-1,1); moves.push_back(make_pair(x,y-1)); y--; } int64_t xx=4,yy=0; for(;xx<8;xx++) { yy=0; bool out=false; for(;yy<4;yy++) { if(board[xx][yy] == 'V') { out=true; break; } } if(out) break; } if(yy == 3) { rotate(board,xx,yy-1,1); moves.push_back(make_pair(xx,yy-1)); yy--; } while(xx < x+1) { rotate(board,xx,yy,1); moves.push_back(make_pair(xx,yy)); xx++; } while(yy < 3) { rotate(board,xx-1,yy,1); moves.push_back(make_pair(xx-1,yy)); yy++; } rotate(board,xx-1,yy,1); moves.push_back(make_pair(xx-1,yy)); B++; D--; } } else { /* C from D*/ while(C < 8) { int64_t x=4,y=4; for(;x<8;x++) { y=0; bool out=false; for(;y<8;y++) { if(board[x][y] == 'M') { out=true; break; } } if(out) break; } if(y == 4) { if(x == 4) { for(int64_t i=0;i<3;i++) { rotate(board,x,y,1); moves.push_back(make_pair(x,y)); } y++; } else { rotate(board,x-1,y,1); moves.push_back(make_pair(x-1,y)); y++; } } while(x > 4) { rotate(board,x-1,y-1,1); moves.push_back(make_pair(x-1,y-1)); x--; } int64_t xx=0,yy=4; for(;xx<4;xx++) { yy=0; bool out=false; for(;yy<8;yy++) { if(board[xx][yy] == 'V') { out=true; break; } } if(out) break; } if(yy == 7) { if(xx == 3) { for(int64_t i=0;i<3;i++) { rotate(board,xx-1,yy-1,1); moves.push_back(make_pair(xx,yy)); } yy--; } else { rotate(board,xx,yy-1,1); moves.push_back(make_pair(xx,yy-1)); yy--; } } while(yy > y-1) { rotate(board,xx,yy-1,1); moves.push_back(make_pair(xx,yy-1)); yy--; } while(xx < 3) { rotate(board,xx, yy, 1); moves.push_back(make_pair(xx,yy)); xx++; } rotate(board,xx, yy, 1); moves.push_back(make_pair(xx,yy)); D--; C++; } } } if(D < 8) { if(B > 8) { /* B from D*/ while(B < 8) { int64_t x=4,y=4; for(;x<8;x++) { bool out=false; for(;y<8;y++) { if(board[x][y] == 'V') { out=true; break; } } if(out) break; } if(x == 7) { if(y == 4) { for(int64_t i=0;i<3;i++) { rotate(board,x-1,y,1); moves.push_back(make_pair(x-1,y)); } x--; } else { rotate(board,x-1,y-1,1); moves.push_back(make_pair(x-1,y-1)); x--; } } while(y > 4) { rotate(board,x,y-1,1); moves.push_back(make_pair(x,y-1)); y--; } int64_t xx=4,yy=0; for(;xx<8;xx++) { yy=0; bool out=false; for(;yy<4;yy++) { if(board[xx][yy] == 'M') { out=true; break; } } if(out) break; } if(yy == 3) { rotate(board,xx,yy-1,1); moves.push_back(make_pair(xx,yy-1)); yy--; } while(xx < x+1) { rotate(board,xx,yy,1); moves.push_back(make_pair(xx,yy)); xx++; } while(yy < 3) { rotate(board,xx-1,yy,1); moves.push_back(make_pair(xx-1,yy)); yy++; } rotate(board,xx-1,yy,1); moves.push_back(make_pair(xx-1,yy)); B--; D++; } } else { while(C < 8) { int64_t x=4,y=4; for(;x<8;x++) { y=0; bool out=false; for(;y<8;y++) { if(board[x][y] == 'V') { out=true; break; } } if(out) break; } if(y == 4) { if(x == 4) { for(int64_t i=0;i<3;i++) { rotate(board,x,y,1); moves.push_back(make_pair(x,y)); } y++; } else { rotate(board,x-1,y,1); moves.push_back(make_pair(x-1,y)); y++; } } while(x > 4) { rotate(board,x-1,y-1,1); moves.push_back(make_pair(x-1,y-1)); x--; } int64_t xx=0,yy=4; for(;xx<4;xx++) { yy=0; bool out=false; for(;yy<8;yy++) { if(board[xx][yy] == 'M') { out=true; break; } } if(out) break; } if(yy == 7) { if(xx == 3) { for(int64_t i=0;i<3;i++) { rotate(board,xx-1,yy-1,1); moves.push_back(make_pair(xx,yy)); } yy--; } else { rotate(board,xx,yy-1,1); moves.push_back(make_pair(xx,yy-1)); yy--; } } while(yy > y-1) { rotate(board,xx,yy-1,1); moves.push_back(make_pair(xx,yy-1)); yy--; } while(xx < 3) { rotate(board,xx, yy, 1); moves.push_back(make_pair(xx,yy)); xx++; } rotate(board,xx, yy, 1); moves.push_back(make_pair(xx,yy)); D++; C--; } } } vector<vector<char>> bA(4,vector<char>(4)); vector<vector<char>> bB(4,vector<char>(4)); vector<vector<char>> bC(4,vector<char>(4)); vector<vector<char>> bD(4,vector<char>(4)); for(int64_t i=0;i<4;i++) { for(int64_t j=0;j<4;j++) { bA[i][j]=board[i][j]; } } for(int64_t i=4;i<8;i++) { for(int64_t j=0;j<4;j++) { bB[i-4][j]=board[i][j]; } } for(int64_t i=0;i<4;i++) { for(int64_t j=4;j<8;j++) { bC[i][j-4]=board[i][j]; } } for(int64_t i=4;i<8;i++) { for(int64_t j=4;j<8;j++) { bD[i-4][j-4]=board[i][j]; } } /*vector<vector<char>> bar(4,vector<char>(4)); for(int64_t i=0;i<4;i++) { for(int64_t j=0;j<4;j++) { if((i+j)%2) { bar[i][j]='M'; } else { bar[i][j]='V'; } } } print_board(bar); hsh1=hsh(bar); for(int64_t i=0;i<4;i++) { for(int64_t j=0;j<4;j++) { if((i+j)%2) { bar[i][j]='V'; } else { bar[i][j]='M'; } } } print_board(bar); hsh2=hsh(bar);*/ map<int64_t,pair<pair<int64_t,int64_t>,int64_t>> found; vector<pair<int64_t,int64_t>> foo=bfs(bA, found, hsh(bA)); for(int64_t i=foo.size()-1;i>=0;i--) { moves.push_back(foo[i]); } found.clear(); foo=bfs(bB, found, hsh(bB)); for(int64_t i=foo.size()-1;i>=0;i--) { moves.push_back(make_pair(foo[i].first+4, foo[i].second)); } found.clear(); foo=bfs(bC, found, hsh(bC)); for(int64_t i=foo.size()-1;i>=0;i--) { moves.push_back(make_pair(foo[i].first, foo[i].second+4)); } found.clear(); foo=bfs(bD, found, hsh(bD)); for(int64_t i=foo.size()-1;i>=0;i--) { moves.push_back(make_pair(foo[i].first+4, foo[i].second+4)); } cout << moves.size() << '\n'; for(int64_t i=0;i<moves.size();i++) { cout << moves[i].first+1 << " " << moves[i].second+1 << "\n"; } return 0; }
Test details
Test 1
Group: 1
Verdict: RUNTIME ERROR
input |
---|
VMMVVMVV MMVVMVVV MMVVMMMM MVVVMVVM MVVVVMVM ... |
correct output |
---|
100000 |
user output |
---|
(empty) |
Test 2
Group: 1
Verdict: RUNTIME ERROR
input |
---|
MVMVVMMV VVMMVVVV VMMVMMVM MVVVVMVM MVMVMMVM ... |
correct output |
---|
100000 |
user output |
---|
(empty) |
Test 3
Group: 1
Verdict: RUNTIME ERROR
input |
---|
VMMMVMVV MMMVMVMV VMMVMVVM VVVMVMMV MVMVMVMV ... |
correct output |
---|
100000 |
user output |
---|
26 5 1 5 1 5 1 1 1 ... |
Error:
*** Error in `input/code': double free or corruption (out): 0x0000000001c84100 ***
Test 4
Group: 1
Verdict: RUNTIME ERROR
input |
---|
VVVMVMVV VMMVMVMM MVVMMVMV VMVMMVMM MMVVMMVM ... |
correct output |
---|
100000 |
user output |
---|
(empty) |
Test 5
Group: 1
Verdict: WRONG ANSWER
input |
---|
MVMVVMMM VVMMVVMV MVVMVVMM VMVMVMMV MMVMVVVM ... |
correct output |
---|
100000 |
user output |
---|
8 2 1 3 1 3 2 5 3 ... |
Test 6
Group: 1
Verdict: WRONG ANSWER
input |
---|
VMMVMVVM VVMMVVMM MMMVMVVM VMMVMMVM MVMVMMMV ... |
correct output |
---|
100000 |
user output |
---|
16 1 2 1 1 1 1 2 1 ... |
Test 7
Group: 1
Verdict: RUNTIME ERROR
input |
---|
MVVVVMMM MMMMMMMM VVVVVMMV MMVVMVVM VMVVVVMV ... |
correct output |
---|
100000 |
user output |
---|
(empty) |
Test 8
Group: 1
Verdict: RUNTIME ERROR
input |
---|
VMMVMVMM MMMVVMMM MVVVVVVV VVVVMMMV MVVVMVVM ... |
correct output |
---|
100000 |
user output |
---|
(empty) |
Test 9
Group: 1
Verdict: RUNTIME ERROR
input |
---|
VVVVVMMM MMVVVVVV MVVVMMMM VVMVVVVM VMMVMVMM ... |
correct output |
---|
100000 |
user output |
---|
(empty) |
Test 10
Group: 1
Verdict: RUNTIME ERROR
input |
---|
VMMVMMMM VVMVVVVV VMMVMVMV VMMVMVMM VVVMMMMM ... |
correct output |
---|
100000 |
user output |
---|
(empty) |
Test 11
Group: 2
Verdict: RUNTIME ERROR
input |
---|
VMVMVVMM MMVMVVMM VMVVVMMV VVVMVMVM VVMMVVMM ... |
correct output |
---|
25000 |
user output |
---|
(empty) |
Test 12
Group: 2
Verdict: WRONG ANSWER
input |
---|
MVMVVMVV VMMVVMVM VMVVVMMM VMMMMVVM MMVVVMMM ... |
correct output |
---|
25000 |
user output |
---|
19 1 2 2 2 3 2 4 2 ... |
Test 13
Group: 2
Verdict: RUNTIME ERROR
input |
---|
MVVMMVVV MMVVMVMM VVVMVMVV VMVMMMMM MVVMMVMV ... |
correct output |
---|
25000 |
user output |
---|
(empty) |
Test 14
Group: 2
Verdict: RUNTIME ERROR
input |
---|
VVMMMVMV VMVVVMVV VVMVVVMM MVVMVMVM MMVVMMMM ... |
correct output |
---|
25000 |
user output |
---|
(empty) |
Test 15
Group: 2
Verdict: RUNTIME ERROR
input |
---|
MVVVMVVV MMMMVMMM MVMMMVVM MMVVVMVM VMVVVMMV ... |
correct output |
---|
25000 |
user output |
---|
23 1 1 2 1 3 1 4 1 ... |
Error:
*** Error in `input/code': double free or corruption (out): 0x0000000001976100 ***
Test 16
Group: 2
Verdict: WRONG ANSWER
input |
---|
VMMVMVVM VMMVVVVV MVMVMMVM VMMVVVMV VVMVMMVM ... |
correct output |
---|
25000 |
user output |
---|
25 5 2 5 2 5 3 5 4 ... |
Test 17
Group: 2
Verdict: RUNTIME ERROR
input |
---|
MVVMMVVM MVVVMMMV MVVMMVVM VMMVMVMV VMMVMMMM ... |
correct output |
---|
25000 |
user output |
---|
(empty) |
Test 18
Group: 2
Verdict: ACCEPTED
input |
---|
MVMMVVMM VVMMMMVV VMVVVVVM MVMMMVMV VMVVVMVM ... |
correct output |
---|
25000 |
user output |
---|
26 5 1 5 1 5 1 1 1 ... |
Test 19
Group: 2
Verdict: RUNTIME ERROR
input |
---|
MVVVVVVV VMMVMVVM VMVMMMMV MVMVMMMM MMVVVMMM ... |
correct output |
---|
25000 |
user output |
---|
(empty) |
Test 20
Group: 2
Verdict: RUNTIME ERROR
input |
---|
MVVVMMMM MMVMMVMV MVVVVVMM VVMMMVVM VVVMVMVV ... |
correct output |
---|
25000 |
user output |
---|
(empty) |
Test 21
Group: 3
Verdict: WRONG ANSWER
input |
---|
VMVVMVMM MMMMVMMV VVVMVVVV MVMVMVVM VMMVMMMM ... |
correct output |
---|
5000 |
user output |
---|
20 5 2 5 2 5 3 5 4 ... |
Test 22
Group: 3
Verdict: RUNTIME ERROR
input |
---|
VVVVVVMM MMMVMMVV VVVVVVMV MMMVMVVV MVVMMMMV ... |
correct output |
---|
5000 |
user output |
---|
(empty) |
Test 23
Group: 3
Verdict: WRONG ANSWER
input |
---|
MMVMVMVV MMVVMVVM VMMVVMVM MMMMMMVV MVVVVMVM ... |
correct output |
---|
5000 |
user output |
---|
27 5 1 5 1 5 1 1 1 ... |
Test 24
Group: 3
Verdict: WRONG ANSWER
input |
---|
MVMVVMVM VVMVVMVM MMMMVMVV MVVMMVVV MMMMMVVV ... |
correct output |
---|
5000 |
user output |
---|
13 5 1 5 1 5 1 1 1 ... |
Test 25
Group: 3
Verdict: WRONG ANSWER
input |
---|
MVVVMVVM MMMMVVMV VMMVMMVV VVMVMVMV MVMMMVMM ... |
correct output |
---|
5000 |
user output |
---|
12 1 2 2 3 3 1 3 2 ... |
Test 26
Group: 3
Verdict: RUNTIME ERROR
input |
---|
VMVMVVVM MMMVVVMM MMVVVVVM VVVVMMVV VMMVVMMV ... |
correct output |
---|
5000 |
user output |
---|
(empty) |
Test 27
Group: 3
Verdict: RUNTIME ERROR
input |
---|
MMVMMVVM MVVVMVMV MVVVMVVM VMVMMMVV VMMVVVVV ... |
correct output |
---|
5000 |
user output |
---|
(empty) |
Test 28
Group: 3
Verdict: WRONG ANSWER
input |
---|
MVMMVMMV VMVMMMVV MMMMVVMV VVVVMMMM MMMVMMVV ... |
correct output |
---|
5000 |
user output |
---|
19 5 1 5 1 5 1 1 1 ... |
Test 29
Group: 3
Verdict: RUNTIME ERROR
input |
---|
VVVVMVMV MMMVVMVM MVVVMVMV VVVMVVMM VMMMMMVV ... |
correct output |
---|
5000 |
user output |
---|
(empty) |
Test 30
Group: 3
Verdict: RUNTIME ERROR
input |
---|
MVVVMVVV MMVVMMMM MVVVVVVV MVMVMMMV VMMMVMMM ... |
correct output |
---|
5000 |
user output |
---|
(empty) |
Test 31
Group: 4
Verdict: WRONG ANSWER
input |
---|
MVMMVMMV VVVMMVVV VMMVVMMV VVMMMVVM VVVMMMVV ... |
correct output |
---|
250 |
user output |
---|
15 5 1 5 1 5 2 5 3 ... |
Test 32
Group: 4
Verdict: RUNTIME ERROR
input |
---|
VVMMVVVM VMVVMMVV VMMMMMMV VVMVMVVV VMMVMVMM ... |
correct output |
---|
250 |
user output |
---|
(empty) |
Test 33
Group: 4
Verdict: RUNTIME ERROR
input |
---|
MMVVMVMV VVVMVMMM VVVVMVMM MVVMVVMV VMMVMVVM ... |
correct output |
---|
250 |
user output |
---|
(empty) |
Test 34
Group: 4
Verdict: WRONG ANSWER
input |
---|
VMVMVVMV MVVMMMMM MMVVMMMM VMVMVVVM VMMMVVVM ... |
correct output |
---|
250 |
user output |
---|
4 3 1 2 2 2 1 1 1 |
Test 35
Group: 4
Verdict: RUNTIME ERROR
input |
---|
VMVMVMMM VMMVVVMM MMVMVMMM MVMMVVVV VMMVMMMV ... |
correct output |
---|
250 |
user output |
---|
38 5 1 5 1 5 1 1 2 ... |
Error:
*** Error in `input/code': double free or corruption (out): 0x0000000001629100 ***
Test 36
Group: 4
Verdict: ACCEPTED
input |
---|
MVMVMVMM MVMVMMMV MMVVVVMM MVMVVVVV VMMMVVMM ... |
correct output |
---|
250 |
user output |
---|
23 1 1 1 1 2 2 1 2 ... |
Test 37
Group: 4
Verdict: WRONG ANSWER
input |
---|
VMMMMVMM VVMMMVMV VMVVVVVV MVMMMVVM VMVMMVVM ... |
correct output |
---|
250 |
user output |
---|
30 1 3 1 2 1 2 2 2 ... |
Test 38
Group: 4
Verdict: RUNTIME ERROR
input |
---|
VMMVMVMV VVMVMVMM MMMVMVMM MVVVVMMM MMVVVMVV ... |
correct output |
---|
250 |
user output |
---|
(empty) |
Test 39
Group: 4
Verdict: RUNTIME ERROR
input |
---|
MMMMMVMV MVVMMMMV VMVVVVMM VMVVVMMV MVMMMVMM ... |
correct output |
---|
250 |
user output |
---|
19 1 2 1 1 1 0 1 0 ... |
Error:
*** Error in `input/code': double free or corruption (out): 0x00000000022c0100 ***
Test 40
Group: 4
Verdict: RUNTIME ERROR
input |
---|
VMMMMMMV VMMVVVVV MVMMVMMV MVVVVMMV MVVVVMMM ... |
correct output |
---|
250 |
user output |
---|
16 1 2 1 1 1 1 2 1 ... |
Error:
*** Error in `input/code': double free or corruption (out): 0x0000000000983100 ***