CSES - Putka Open 2015 – 6/6

CSES - Putka Open 2015 – 6/6 - Results

Submission details
Task:	Shakki
Sender:
Submission time:	2015-12-06 17:23:50 +0200
Language:	C++
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	RUNTIME ERROR	0
#2	RUNTIME ERROR	0
#3	RUNTIME ERROR	0
#4	RUNTIME ERROR	0

Test results
test	verdict	time	group
#1	RUNTIME ERROR	0.19 s	1	details
#2	RUNTIME ERROR	0.19 s	1	details
#3	WRONG ANSWER	0.10 s	1	details
#4	RUNTIME ERROR	0.20 s	1	details
#5	WRONG ANSWER	0.06 s	1	details
#6	WRONG ANSWER	0.08 s	1	details
#7	RUNTIME ERROR	0.18 s	1	details
#8	RUNTIME ERROR	0.18 s	1	details
#9	RUNTIME ERROR	0.19 s	1	details
#10	RUNTIME ERROR	0.19 s	1	details
#11	RUNTIME ERROR	0.14 s	2	details
#12	WRONG ANSWER	0.07 s	2	details
#13	RUNTIME ERROR	0.19 s	2	details
#14	RUNTIME ERROR	0.15 s	2	details
#15	RUNTIME ERROR	0.14 s	2	details
#16	RUNTIME ERROR	0.15 s	2	details
#17	RUNTIME ERROR	0.18 s	2	details
#18	WRONG ANSWER	0.06 s	2	details
#19	RUNTIME ERROR	0.19 s	2	details
#20	RUNTIME ERROR	0.19 s	2	details
#21	RUNTIME ERROR	0.15 s	3	details
#22	RUNTIME ERROR	0.18 s	3	details
#23	WRONG ANSWER	0.08 s	3	details
#24	WRONG ANSWER	0.07 s	3	details
#25	WRONG ANSWER	0.07 s	3	details
#26	RUNTIME ERROR	0.19 s	3	details
#27	RUNTIME ERROR	0.20 s	3	details
#28	WRONG ANSWER	0.07 s	3	details
#29	RUNTIME ERROR	0.18 s	3	details
#30	RUNTIME ERROR	0.18 s	3	details
#31	RUNTIME ERROR	0.14 s	4	details
#32	RUNTIME ERROR	0.19 s	4	details
#33	RUNTIME ERROR	0.19 s	4	details
#34	WRONG ANSWER	0.09 s	4	details
#35	RUNTIME ERROR	0.19 s	4	details
#36	WRONG ANSWER	0.06 s	4	details
#37	WRONG ANSWER	0.09 s	4	details
#38	RUNTIME ERROR	0.19 s	4	details
#39	WRONG ANSWER	0.07 s	4	details
#40	WRONG ANSWER	0.09 s	4	details

Compiler report

input/code.cpp: In function 'void print_board(std::vector<std::vector<char> >&)':
input/code.cpp:85:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int64_t i=0;i<board.size();i++) {
                    ^
input/code.cpp:86: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:723: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) {
  if(fine(b)) {
    int64_t tmp=hsh(b);
    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(b);
  for(int64_t i=0;i<3;i++) {
    for(int64_t j=0;j<3;j++) {
      rotate(b, i, j, 1);
      if(found.find(hsh(b)) == found.end()) {
        found[hsh(b)]=make_pair(make_pair(i, j), oldhsh);
        vector<pair<int64_t,int64_t>> res=bfs(b, found, hshstart);
        if(res.size() > 0) return res;
      }
      rotate(b, 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;
        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(;x<4;x++) {
        bool out=false;
        for(;y<4;y++) {
          if(board[x][y] == '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++) {
        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(;x<4;x++) {
        bool out=false;
        for(;y<4;y++) {
          if(board[x][y] == '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;
        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(;x<4;x++) {
        bool out=false;
        for(;y<4;y++) {
          if(board[x][y] == '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++) {
        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(;x<4;x++) {
        bool out=false;
        for(;y<4;y++) {
          if(board[x][y] == '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++) {
          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(;x<8;x++) {
          bool out=false;
          for(;y<4;y++) {
            if(board[x][y] == '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++) {
          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(;x<4;x++) {
          bool out=false;
          for(;y<8;y++) {
            if(board[x][y] == '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(;x<8;x++) {
          bool out=false;
          for(;y<4;y++) {
            if(board[x][y] == '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++) {
          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(;x<4;x++) {
          bool out=false;
          for(;y<8;y++) {
            if(board[x][y] == '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 << " " << moves[i].second << "\n";
  }

  return 0;
}

Test details

Test 1

Group: 1

Verdict: RUNTIME ERROR

input
`VMMVVMVV MMVVMVVV MMVVMMMM MVVVMVVM MVVVVMVM ...` view save

correct output
`100000` view save

user output
(empty)

Test 2

Group: 1

Verdict: RUNTIME ERROR

input
`MVMVVMMV VVMMVVVV VMMVMMVM MVVVVMVM MVMVMMVM ...` view save

correct output
`100000` view save

user output
(empty)

Test 3

Group: 1

Verdict: WRONG ANSWER

input
`VMMMVMVV MMMVMVMV VMMVMVVM VVVMVMMV MVMVMVMV ...` view save

correct output
`100000` view save

user output
`14 4 0 4 0 4 0 0 0 ...` view save

Test 4

Group: 1

Verdict: RUNTIME ERROR

input
`VVVMVMVV VMMVMVMM MVVMMVMV VMVMMVMM MMVVMMVM ...` view save

correct output
`100000` view save

user output
(empty)

Test 5

Group: 1

Verdict: WRONG ANSWER

input
`MVMVVMMM VVMMVVMV MVVMVVMM VMVMVMMV MMVMVVVM ...` view save

correct output
`100000` view save

user output
`1736 0 1 0 0 0 0 0 0 ...` view save

Test 6

Group: 1

Verdict: WRONG ANSWER

input
`VMMVMVVM VVMMVVMM MMMVMVVM VMMVMMVM MVMVMMMV ...` view save

correct output
`100000` view save

user output
`3010 0 0 1 0 2 0 3 0 ...` view save

Test 7

Group: 1

Verdict: RUNTIME ERROR

input
`MVVVVMMM MMMMMMMM VVVVVMMV MMVVMVVM VMVVVVMV ...` view save

correct output
`100000` view save

user output
(empty)

Test 8

Group: 1

Verdict: RUNTIME ERROR

input
`VMMVMVMM MMMVVMMM MVVVVVVV VVVVMMMV MVVVMVVM ...` view save

correct output
`100000` view save

user output
(empty)

Test 9

Group: 1

Verdict: RUNTIME ERROR

input
`VVVVVMMM MMVVVVVV MVVVMMMM VVMVVVVM VMMVMVMM ...` view save

correct output
`100000` view save

user output
(empty)

Test 10

Group: 1

Verdict: RUNTIME ERROR

input
`VMMVMMMM VVMVVVVV VMMVMVMV VMMVMVMM VVVMMMMM ...` view save

correct output
`100000` view save

user output
(empty)

Test 11

Group: 2

Verdict: RUNTIME ERROR

input
`VMVMVVMM MMVMVVMM VMVVVMMV VVVMVMVM VVMMVVMM ...` view save

correct output
`25000` view save

user output
(empty)

Test 12

Group: 2

Verdict: WRONG ANSWER

input
`MVMVVMVV VMMVVMVM VMVVVMMM VMMMMVVM MMVVVMMM ...` view save

correct output
`25000` view save

user output
`8057 0 4 1 4 2 4 3 4 ...` view save

Test 13

Group: 2

Verdict: RUNTIME ERROR

input
`MVVMMVVV MMVVMVMM VVVMVMVV VMVMMMMM MVVMMVMV ...` view save

correct output
`25000` view save

user output
(empty)

Test 14

Group: 2

Verdict: RUNTIME ERROR

input
`VVMMMVMV VMVVVMVV VVMVVVMM MVVMVMVM MMVVMMMM ...` view save

correct output
`25000` view save

user output
(empty)

Test 15

Group: 2

Verdict: RUNTIME ERROR

input
`MVVVMVVV MMMMVMMM MVMMMVVM MMVVVMVM VMVVVMMV ...` view save

correct output
`25000` view save

user output
(empty)

Test 16

Group: 2

Verdict: RUNTIME ERROR

input
`VMMVMVVM VMMVVVVV MVMVMMVM VMMVVVMV VVMVMMVM ...` view save

correct output
`25000` view save

user output
(empty)

Test 17

Group: 2

Verdict: RUNTIME ERROR

input
`MVVMMVVM MVVVMMMV MVVMMVVM VMMVMVMV VMMVMMMM ...` view save

correct output
`25000` view save

user output
(empty)

Test 18

Group: 2

Verdict: WRONG ANSWER

input
`MVMMVVMM VVMMMMVV VMVVVVVM MVMMMVMV VMVVVMVM ...` view save

correct output
`25000` view save

user output
`18706 4 0 4 0 4 0 0 0 ...` view save

Test 19

Group: 2

Verdict: RUNTIME ERROR

input
`MVVVVVVV VMMVMVVM VMVMMMMV MVMVMMMM MMVVVMMM ...` view save

correct output
`25000` view save

user output
(empty)

Test 20

Group: 2

Verdict: RUNTIME ERROR

input
`MVVVMMMM MMVMMVMV MVVVVVMM VVMMMVVM VVVMVMVV ...` view save

correct output
`25000` view save

user output
(empty)

Test 21

Group: 3

Verdict: RUNTIME ERROR

input
`VMVVMVMM MMMMVMMV VVVMVVVV MVMVMVVM VMMVMMMM ...` view save

correct output
`5000` view save

user output
(empty)

Test 22

Group: 3

Verdict: RUNTIME ERROR

input
`VVVVVVMM MMMVMMVV VVVVVVMV MMMVMVVV MVVMMMMV ...` view save

correct output
`5000` view save

user output
(empty)

Test 23

Group: 3

Verdict: WRONG ANSWER

input
`MMVMVMVV MMVVMVVM VMMVVMVM MMMMMMVV MVVVVMVM ...` view save

correct output
`5000` view save

user output
`17289 4 0 4 0 4 0 0 0 ...` view save

Test 24

Group: 3

Verdict: WRONG ANSWER

input
`MVMVVMVM VVMVVMVM MMMMVMVV MVVMMVVV MMMMMVVV ...` view save

correct output
`5000` view save

user output
`1908 4 0 4 0 4 0 0 0 ...` view save

Test 25

Group: 3

Verdict: WRONG ANSWER

input
`MVVVMVVM MMMMVVMV VMMVMMVV VVMVMVMV MVMMMVMM ...` view save

correct output
`5000` view save

user output
`5753 0 1 0 0 0 1 0 0 ...` view save

Test 26

Group: 3

Verdict: RUNTIME ERROR

input
`VMVMVVVM MMMVVVMM MMVVVVVM VVVVMMVV VMMVVMMV ...` view save

correct output
`5000` view save

user output
(empty)

Test 27

Group: 3

Verdict: RUNTIME ERROR

input
`MMVMMVVM MVVVMVMV MVVVMVVM VMVMMMVV VMMVVVVV ...` view save

correct output
`5000` view save

user output
(empty)

Test 28

Group: 3

Verdict: WRONG ANSWER

input
`MVMMVMMV VMVMMMVV MMMMVVMV VVVVMMMM MMMVMMVV ...` view save

correct output
`5000` view save

user output
`6660 4 0 4 0 4 0 0 0 ...` view save

Test 29

Group: 3

Verdict: RUNTIME ERROR

input
`VVVVMVMV MMMVVMVM MVVVMVMV VVVMVVMM VMMMMMVV ...` view save

correct output
`5000` view save

user output
(empty)

Test 30

Group: 3

Verdict: RUNTIME ERROR

input
`MVVVMVVV MMVVMMMM MVVVVVVV MVMVMMMV VMMMVMMM ...` view save

correct output
`5000` view save

user output
(empty)

Test 31

Group: 4

Verdict: RUNTIME ERROR

input
`MVMMVMMV VVVMMVVV VMMVVMMV VVMMMVVM VVVMMMVV ...` view save

correct output
`250` view save

user output
(empty)

Test 32

Group: 4

Verdict: RUNTIME ERROR

input
`VVMMVVVM VMVVMMVV VMMMMMMV VVMVMVVV VMMVMVMM ...` view save

correct output
`250` view save

user output
(empty)

Test 33

Group: 4

Verdict: RUNTIME ERROR

input
`MMVVMVMV VVVMVMMM VVVVMVMM MVVMVVMV VMMVMVVM ...` view save

correct output
`250` view save

user output
(empty)

Test 34

Group: 4

Verdict: WRONG ANSWER

input
`VMVMVVMV MVVMMMMM MMVVMMMM VMVMVVVM VMMMVVVM ...` view save

correct output
`250` view save

user output
`10859 0 1 0 0 0 0 0 0 ...` view save

Test 35

Group: 4

Verdict: RUNTIME ERROR

input
`VMVMVMMM VMMVVVMM MMVMVMMM MVMMVVVV VMMVMMMV ...` view save

correct output
`250` view save

user output
(empty)

Test 36

Group: 4

Verdict: WRONG ANSWER

input
`MVMVMVMM MVMVMMMV MMVVVVMM MVMVVVVV VMMMVVMM ...` view save

correct output
`250` view save

user output
`25324 0 1 0 0 0 0 0 0 ...` view save

Test 37

Group: 4

Verdict: WRONG ANSWER

input
`VMMMMVMM VVMMMVMV VMVVVVVV MVMMMVVM VMVMMVVM ...` view save

correct output
`250` view save

user output
`7819 0 0 1 0 2 0 3 0 ...` view save

Test 38

Group: 4

Verdict: RUNTIME ERROR

input
`VMMVMVMV VVMVMVMM MMMVMVMM MVVVVMMM MMVVVMVV ...` view save

correct output
`250` view save

user output
(empty)

Test 39

Group: 4

Verdict: WRONG ANSWER

input
`MMMMMVMV MVVMMMMV VMVVVVMM VMVVVMMV MVMMMVMM ...` view save

correct output
`250` view save

user output
`10779 4 4 4 4 4 4 0 4 ...` view save

Test 40

Group: 4

Verdict: WRONG ANSWER

input
`VMMMMMMV VMMVVVVV MVMMVMMV MVVVVMMV MVVVVMMM ...` view save

correct output
`250` view save

user output
`8 0 0 1 0 2 0 3 0 ...` view save

Putka Open 2015 – 6/6

Shakki

Compiler report

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Test 32

Test 33

Test 34

Test 35

Test 36

Test 37

Test 38

Test 39

Test 40

Tasks

Submissions ()