| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1145752 | byunjaewoo | 카멜레온의 사랑 (JOI20_chameleon) | C++20 | 17 ms | 436 KiB |
#include "chameleon.h"
#include <bits/stdc++.h>
using namespace std;
void Solve(int N) {
for(int i=1; i<=2*N; i++) {
for(int j=i+1; j<=2*N; j++) {
vector<int> p;
p.push_back(i), p.push_back(j);
if(Query(p)>1) continue;
p.clear();
for(int k=1; k<=2*N; k++) if(k!=i && k!=j) p.push_back(k);
if(Query(p)<=N-1) Answer(i, j);
}
}
}
| # | 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... | ||||
