oj.uz

답안 #550328

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
550328 2022-04-17T21:20:45 Z LucaDantas Park (JOI17_park) C++17
10 / 100
 10 ms 340 KB 
// I haven't checked it in a tree because the sample doesn't have a tree example so I'll test if later if I get wa (which I'll probably get)
#include "park.h"
#include <bits/stdc++.h>
using namespace std;

mt19937 rng(random_device{}());

int rnd(int x) { return (rng() % x + x) % x; }

constexpr int maxn = 1410;

static int Place[1400];

int ask[maxn];

int edge(int a, int b) {
	// ask if there is a direct edge between a and b
	memset(ask, 0, sizeof ask);
	ask[a] = ask[b] = 1;
	return Ask(a, b, ask);
}

array<vector<int>, 2> group(int a, int b, vector<int> tot) {
	// we know there is an edge between a and b
	
	array<vector<int>, 2> ans = {vector<int>(1, a), vector<int>(1, b)};

	int n = (int)(tot.size());
	for(int i = 0; i < n; i++) {
		if(tot[i] == a || tot[i] == b) continue;

		memset(ask, 0, sizeof ask);
		for(int j = 0; j < n; j++)
			if(tot[j] != b) ask[tot[j]] = 1;
		ask[a] = 1, ask[b] = 0; // just to make sure

		ans[Ask(a, tot[i], ask)].push_back(tot[i]);
	}

	return ans; // we return the elements that belong to A's subtree and those that belong to B's subtree
}

int find_edge(int a, vector<int> possible) {
	shuffle(possible.begin(), possible.end(), rng);
	for(int b : possible)
		if(b != a && edge(a, b)) return b;
	assert(0);
	return -1;
}

void go(vector<int> possible) {
	if(possible.size() <= 1) return;
	if(possible.size() == 2) {
		Answer(possible[0], possible[1]);
		return;
	}
	int a = possible[rnd(possible.size())];
	int b = find_edge(a, possible);
	Answer(a, b);

	array<vector<int>, 2> grp = group(a, b, possible);

	go(grp[0]);
	go(grp[1]);
}

void Detect(int T, int N) {
	if(T == 1) {
		for(int i = 0; i < N; i++)
			for(int j = i+1; j < N; j++)
				if(edge(i, j)) Answer(i, j);
		return;
	}
	vector<int> all(N);
	iota(all.begin(), all.end(), 0);
	shuffle(all.begin(), all.end(), rng);
	go(all);
}

Compilation message

park.cpp:12:12: warning: 'Place' defined but not used [-Wunused-variable]
   12 | static int Place[1400];
      |            ^~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 10 ms 340 KB Output is correct
3 Correct 10 ms 340 KB Output is correct
4 Correct 10 ms 340 KB Output is correct
5 Correct 10 ms 320 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Wrong Answer[4]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Wrong Answer[4]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Wrong Answer[4]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 340 KB Wrong Answer[4]
2 Halted 0 ms 0 KB -