oj.uz

답안 #430284

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
430284 2021-06-16T12:40:38 Z 8e7 Park (JOI17_park) C++14
77 / 100
 1154 ms 644 KB 
#include "park.h"
//Challenge: Accepted
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <random>
#include <time.h>
#include <assert.h>
#include <unordered_map>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace std;
//using namespace __gnu_pbds;
void debug() {cout << endl;}
template <class T, class ...U> void debug(T a, U ... b) { cout << a << " "; debug(b...);}
template <class T> void pary(T l, T r) {
	while (l != r) {cout << *l << " ";l++;}
	cout << endl;
}
#define ll long long
#define ld long double
#define maxn 1405
#define mod 1000000007
#define pii pair<long long, long long>
#define ff first
#define ss second

static int que[maxn];
vector<pii> ed;
int qcnt = 0;
void group(vector<int> root, vector<int> nom, int cent, vector<vector<int> > & rec);
int query(int a, int b) {
	if (a > b) swap(a, b);
	if (a == b || (que[a] == 0) || (que[b] == 0)) return 0;
	qcnt++;
	return Ask(a, b, que);
}


void solve(vector<int> v) {
	//pary(v.begin(), v.end());
	if (v.size() < 2) return;
	if (v.size() == 2) {
		ed.push_back({v[0], v[1]});
		return;
	}
	//debug(v.size());
	random_shuffle(v.begin(), v.end());
	int cent = v[0];
	for (int i = 0;i < maxn;i++) que[i] = 0;
	for (int i:v) que[i] = 1;
	if (v.size() > 6) {
		int num = 4, ma = 0, best = 0, f = 0;
		for (int i:v) {	
			que[i] = 0;
			int cnt = 0;
			for (int j = 0;j < num;j++) {
				int ix = rand() % v.size(), iy = rand() % v.size();
				if (v[ix] == i) ix = (ix + 1) % v.size();
				while (iy == ix || v[iy] == i) {
					iy = (iy + 1) % v.size();
				}
				cnt += query(v[ix], v[iy]) ? 0 : 1;	
			}
			que[i] = 1;
			if (cnt > ma) {
				ma = cnt, best = i;
			}
			if (cnt > (num / 2)) {
				cent = i, f = 1;
				break;
			}
		}
		if (!f) cent = best;
	}
	for (int i:v) que[i] = 0;
	que[cent] = 1;
	vector<int> adj, sub;
	for (int i:v) {
		if (i == cent) continue;
		que[i] = 1;
		if (query(i, cent)) {
			ed.push_back({i, cent}), adj.push_back(i);
		} else {
			sub.push_back(i);
		}
		que[i] = 0;
	}
	for (int i:v) que[i] = 1;
	vector<vector<int> > rec;
	group(adj, sub, cent, rec);
	for (int i:v) que[i] = 0;
	for (auto i:rec) {
		solve(i);
	}
}
void group(vector<int> root, vector<int> nom, int cent, vector<vector<int> > &rec) {
	if (root.size() == 0) return;
	if (root.size() == 1) {
		nom.push_back(root[0]);
		rec.push_back(nom);
		return;
	}
	vector<int> ar, br, an, bn;
	for (int i = 0;i < root.size();i++) {
		if (i < (root.size() / 2)) ar.push_back(root[i]);
		else br.push_back(root[i]);
	}
	for (int i:ar) que[i] = 0;	
	for (int i:nom) {
		if (!query(i, cent)) {
			an.push_back(i);	
		} else {
			bn.push_back(i);
		}
	}
	for (int i:ar) que[i] = 1;
	group(ar, an, cent, rec), group(br, bn, cent, rec);
}
void Detect(int T, int N) {
	if (T == 1) {
		for (int i = 0;i < N;i++) {
			for (int j = i + 1;j < N;j++) {
				que[i] = 1, que[j] = 1;
				if (query(i, j)) Answer(i, j);
				que[i] = 0, que[j] = 0;
			}
		}
		return;
	}
	srand(time(NULL));
	vector<int> ini;
	for (int i = 0;i < N;i++) ini.push_back(i);
	solve(ini);
	//debug(qcnt);
	//assert(ed.size() == N - 1);
	for (auto i:ed) {
		if (i.ff > i.ss) swap(i.ff, i.ss);
		Answer(i.ff, i.ss);
	}
}
/*

4
10 9
0 1
0 2
1 3
2 4
1 5
2 6
2 7
7 8
5 9

4
8 7
0 1
0 2
0 3
0 4
0 5
0 6
0 7
*/

Compilation message

park.cpp: In function 'void group(std::vector<int>, std::vector<int>, int, std::vector<std::vector<int> >&)':
park.cpp:106:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  106 |  for (int i = 0;i < root.size();i++) {
      |                 ~~^~~~~~~~~~~~~
park.cpp:107:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  107 |   if (i < (root.size() / 2)) ar.push_back(root[i]);
      |       ~~^~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 13 ms 332 KB Output is correct
3 Correct 10 ms 332 KB Output is correct
4 Correct 10 ms 332 KB Output is correct
5 Correct 10 ms 336 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 88 ms 460 KB Output is correct
2 Correct 77 ms 520 KB Output is correct
3 Correct 68 ms 580 KB Output is correct
4 Correct 126 ms 580 KB Output is correct
5 Correct 100 ms 520 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 264 ms 464 KB Output is correct
2 Correct 196 ms 464 KB Output is correct
3 Correct 130 ms 516 KB Output is correct
4 Correct 192 ms 452 KB Output is correct
5 Correct 133 ms 412 KB Output is correct
6 Correct 149 ms 416 KB Output is correct
7 Correct 126 ms 420 KB Output is correct
8 Correct 129 ms 452 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 110 ms 452 KB Output is correct
2 Correct 136 ms 392 KB Output is correct
3 Correct 134 ms 452 KB Output is correct
4 Correct 179 ms 540 KB Output is correct
5 Correct 139 ms 644 KB Output is correct
6 Correct 98 ms 600 KB Output is correct
7 Correct 119 ms 520 KB Output is correct
8 Correct 161 ms 492 KB Output is correct
9 Correct 287 ms 524 KB Output is correct
10 Correct 165 ms 456 KB Output is correct
11 Correct 118 ms 444 KB Output is correct
12 Correct 214 ms 520 KB Output is correct
13 Correct 157 ms 568 KB Output is correct
14 Correct 131 ms 536 KB Output is correct
15 Correct 162 ms 572 KB Output is correct
16 Correct 298 ms 456 KB Output is correct
17 Correct 102 ms 480 KB Output is correct
18 Correct 114 ms 436 KB Output is correct
19 Correct 159 ms 544 KB Output is correct
20 Correct 236 ms 504 KB Output is correct

Subtask #5
0 / 23.0

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