# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
351633 | 2021-01-20T06:05:09 Z | Bill_00 | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 5100 ms | 24764 KB |
#include <bits/stdc++.h> // #define N 100001 #define MOD 998244353 #define ll long long #define pb push_back const int M=62; using namespace std; string s[1000]; bool flag=0; int encode (int n, int x, int y) { if(flag==0){ flag=1; for(int i=0;i<12;i++){ s[1]+=((i<6)?'1':'0'); } for(int i=2;i<=920;i++){ s[i]=s[i-1]; next_permutation(s[i].begin(),s[i].end()); } } for(int 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 | 4235 ms | 24576 KB | Output is correct - maxh = 12 |
2 | Correct | 5100 ms | 24764 KB | Output is correct - maxh = 12 |