# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
170346 | ngmh | Library (JOI18_library) | C++11 | 3093 ms | 532 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>
#include "library.h"
using namespace std;
void Solve(int N)
{
if(N == 1){
vector<int> edge;
edge.push_back(1);
Answer(edge);
return;
}
vector<int> v(N);
vector<int> adjlist[N+1];
long long A, S, T;
for(int i = 1; i <= N; i++){
for(int j = 1; j <= N; j++){
if(i == j || adjlist[j].size() == 2) continue;
if(find(adjlist[i].begin(), adjlist[i].end(), j) != adjlist[i].end()) continue;
v[i-1] = v[j-1] = 1;
A = Query(v);
v[i-1] = v[j-1] = 0;
if(A == 1){
adjlist[i].push_back(j);
adjlist[j].push_back(i);
if(adjlist[i].size() == 2) break;
}
}
if(adjlist[i].size() == 1) S = i;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |