| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1337635 | aaaaaaaa | 카멜레온의 사랑 (JOI20_chameleon) | C++20 | 16 ms | 428 KiB |
#include <bits/stdc++.h>
#include "chameleon.h"
using namespace std;
void Solve(int N) {
vector<pair<int, int>> ans;
vector<int> done(N * 2 + 10, 0);
for(int i = 1; i <= 2 * N; ++i){
for(int j = 1; j <= 2 * N; ++j){
if(i ^ j && !done[i] && !done[j]){
int x = Query({i, j});
Query({i}), Query({j});
if(x == 1){
done[i] = done[j] = 1;
ans.push_back({i, j});
}
}
}
}
assert((int) ans.size() == N);
for(auto [x, y] : ans){
Answer(x, y);
}
}
| # | 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... | ||||
