oj.uz

Submission #212367

# Submission time Handle Problem Language Result Execution time Memory
212367 2020-03-22T19:19:07 Z Abdullah Chameleon's Love (JOI20_chameleon) C++17
20 / 100
 28 ms 416 KB 
#include "chameleon.h"
#include <bits/stdc++.h>
using namespace std;
void Solve(int n) {
	n*=2;
	vector<vector<int>>adjs(n+1);
	vector<int>sizs(n+1, 0);
	for(int i=1; i<=n; i++){
		for(int j=i+1; j<=n; j++){
			if(Query({i, j})==1){
				adjs[i].push_back(j);
				adjs[j].push_back(i);
			}
		}
	}
	vector<bool>vis(n+1, 0);
	vector<vector<int>>B(n+1);
	for(int i=1; i<=n; i++){
		if(vis[i]==1)continue;
		if(adjs[i].size()==1){
			Answer(i, adjs[i][0]);
			vis[i]=1; 
			vis[adjs[i][0]]=1;
		}else{
			for(int j=0; j<3; j++){
				vector<int>A={i};
				for(int a=0;a<=2; a++){
					if(a!=j)A.push_back(adjs[i][a]);
				}
				if(Query(A)==1){
					B[i].push_back(adjs[i][j]);
					B[adjs[i][j]].push_back(i);
					break;
				}
			}
		}
	}
	for(int i=1; i<=n; i++){
		if(vis[i]==1)continue;
		for(int a:adjs[i]){
			if(a!=B[i][0]&&a!=B[i][1]){
				Answer(i, a);
				vis[i]=1, vis[a]=1;
				break;
			}
		}
	}
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Incorrect 25 ms 384 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Incorrect 6 ms 384 KB Wrong Answer [5]
13 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Incorrect 28 ms 416 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Incorrect 25 ms 384 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -