# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
923534 | 2024-02-07T11:44:34 Z | alexander707070 | Chameleon's Love (JOI20_chameleon) | C++14 | 1 ms | 596 KB |
#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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Wrong Answer [7] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 596 KB | Wrong Answer [7] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 596 KB | Wrong Answer [7] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Wrong Answer [7] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Wrong Answer [7] |
2 | Halted | 0 ms | 0 KB | - |