Submission #937362

# Submission time Handle Problem Language Result Execution time Memory
937362 2024-03-04T01:12:29 Z Darren0724 Chameleon's Love (JOI20_chameleon) C++17
0 / 100
14 ms 596 KB
#include "chameleon.h"
#include <bits/stdc++.h>
using namespace std;

void Solve(int n) {
	vector<int> vis(n*2+1);
	for(int i=1;i<=n*2;i++){
		if(vis[i])continue;
		for(int j=i+1;j<=n*2;j++){
			if(vis[j])continue;
			int p=Query({i,j});
			if(p==1){
				vis[i]=1;
				vis[j]=1;
				Answer(i,j);
				break;
			}
		}
	}
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Incorrect 14 ms 452 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 596 KB Wrong Answer [6]
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 596 KB Wrong Answer [6]
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 344 KB Wrong Answer [6]
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Incorrect 14 ms 452 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -