# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
768275 | 2023-06-27T21:03:59 Z | simene | Cluedo (IOI10_cluedo) | C++14 | 0 ms | 208 KB |
#include "grader.h" #include <stack> void Solve(){std::stack<int> m[4];for(int i=1;i<7;i++)m[1].push(i);m[3]=m[1];m[2]=m[1];for(int i=7;i<11;i++)m[3].push(i);int a;while(a=Theory(m[1].top(),m[2].top(),m[3].top()))m[a].pop();}
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Failed | 0 ms | 208 KB | wrong parameter |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Failed | 0 ms | 208 KB | wrong parameter |
2 | Halted | 0 ms | 0 KB | - |