oj.uz

Submission #464174

# Submission time Handle Problem Language Result Execution time Memory
464174 2021-08-12T13:28:07 Z koioi.org-dennisstar Chameleon's Love (JOI20_chameleon) C++17
0 / 100
 1 ms 200 KB 
#include "chameleon.h"
#include <bits/stdc++.h>

using namespace std;

void Solve(int n) {
	vector<vector<int>> adj(n+1);
	for (int i=1; i<n; i++) for (int j=i+1; j<=n; j++) {
		vector<int> v(2);
		v[0]=i, v[1]=j;
		if (Query(v)==1) adj[i].emplace_back(j), adj[j].emplace_back(i);
	}
	auto chk = [&](int x, int y) {
		if (adj[x].size()==1||adj[y].size()==1) return true;
		int f1=0, f2=0;
		vector<int> v(3);
		v[0]=x, v[1]=y;
		for (auto &i:adj[x]) if (i!=y) {
			v[2]=i;
			if (Query(v)==1) { f1=1; break; }
		}
		for (auto &i:adj[y]) if (i!=x) {
			v[2]=i;
			if (Query(v)==1) { f2=1; break; }
		}
		return f1&&f2;
	};
	for (int i=1; i<=n; i++) for (auto &j:adj[i]) if (chk(i, j)) {
		Answer(i, j);
		adj[j].clear();
		break;
	}
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 200 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 200 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 200 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 200 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 200 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -