# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
923534 | alexander707070 | Chameleon's Love (JOI20_chameleon) | C++14 | 1 ms | 596 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 "chameleon.h"
#define MAXN 1007
using namespace std;
namespace {
int n;
vector<int> to[MAXN];
} // namespace
void Solve(int N) {
n=N;
for(int i=1;i<=2*n;i++){
for(int f=i+1;f<=2*n;f++){
if(Query({i,f})==1){
to[i].push_back(f);
to[f].push_back(i);
}
}
}
for(int i=1;i<=2*n;i++){
int br=0;
for(int f=0;f<to[i].size();f++){
for(int k:to[to[i][f]]){
if(k==i)br++;
}
}
if(br>1)cout<<1/0;
}
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |