# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
724931 | lukadupli | Zagonetka (COI18_zagonetka) | C++14 | 265 ms | 456 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;
const int MAXN = 105;
int n, arr[MAXN];
int maybe[MAXN][MAXN], sure[MAXN][MAXN];
int mini[MAXN], maxi[MAXN];
bool query(int* perm, int len){
cout << "query ";
for(int i = 0; i < len; i++) cout << perm[i] << ' ';
cout << endl;
bool ans;
cin >> ans;
return ans;
}
bool bio[MAXN];
vector<int> topsort;
void dfs(int node){
bio[node] = 1;
for(int i = 0; i < n; i++){
if(!bio[i] && (maybe[node][i] || sure[node][i])) dfs(i);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |