| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 794075 | Valaki2 | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 1390 ms | 243232 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
vector<vector<int> > v;
int encode (int n, int x, int y) {
v.pb({});
vector<int> subset = {0, -1, -1, -1, -1, -1, -1, 0, 0, 0, 0, 0, 0};
while(true) {
v.pb(subset);
if(subset[7] && subset[8] && subset[9] && subset[10] && subset[11] && subset[12]) {
break;
}
/*int j = -1, cnt = 0;
for(int i = 12; i >= 1; i--) {
if(!subset[i]) {
j = i;
break;
}
cnt++;
}
for(; j >= 1; j--) {
if(subset[j]) {
subset[j] = false;
for(int i = j + 1; i <= j + 1 + cnt; i++) {
subset[i] = true;
}
for(int i = j + 1 + cnt + 1; i <= 12; i++) {
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||