# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
282141 | 2020-08-24T03:57:54 Z | thtsshz_bgwrswh | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++ | 5444 ms | 48232 KB |
#include<algorithm> #include<string> using namespace std; bool first=1; string s[925]; int encode(int n,int x,int y){ int i; if(first){ first=0; s[1]="000000111111"; for(i=2;i<=920;i++){ s[i]=s[i-1]; next_permutation(s[i].begin(),s[i].end()); } } for(i=0;i<12;i++) if(s[x][i]=='1'&&s[y][i]=='0') return i+1; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4233 ms | 48232 KB | Output is correct - maxh = 12 |
2 | Correct | 5444 ms | 48112 KB | Output is correct - maxh = 12 |