oj.uz

답안 #379434

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
379434 2021-03-18T09:04:02 Z oolimry 로카히아 유적 (FXCUP4_lokahia) C++17
0 / 100
 469 ms 768 KB 
#include "lokahia.h"
#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int) (x).size()
#define all(x) (x).begin(), (x).end()
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x, y) cerr << #x << " is " << x << "," << #y << " is " << y << endl;
typedef long long lint;
typedef pair<lint,lint> ii;

int p[205];
int SZ[205];
int findSet(int u){
	if(u == p[u]) return u;
	else return p[u] = findSet(p[u]);
}
void unionSet(int u, int v){
	u = findSet(u);
	v = findSet(v);
	if(u == v) return;
	p[u] = v;
	SZ[v] += SZ[u];
}

mt19937 rng(time(NULL));

int FindBase(int n){
	int qrylimit = 600;
	for(int i = 0;i <= n;i++) p[i] = i, SZ[i] = 1;
	int total = 10000000;
	
	while(qrylimit >  0 and total > 0){
		int a = rng() % n, b = rng() % n;
		total--;
		
		if(a == b) continue;
		
		if(findSet(a) == findSet(b)) continue;
		int x = CollectRelics(a,b); qrylimit--;
		
		if(x == -1) continue;
		unionSet(a,x);
		unionSet(b,x);
		
		cout << a << " " << b << " " << x << "\n";
	}
	
	for(int i = 0;i < n;i++){
		if(SZ[i] > n/2) return i;
	}
	return -1;
}

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 620 KB Partially correct : C = 600
2 Incorrect 1 ms 620 KB Wrong
3 Incorrect 418 ms 620 KB Wrong
4 Incorrect 2 ms 620 KB Wrong
5 Incorrect 1 ms 620 KB Wrong
6 Incorrect 1 ms 620 KB Wrong
7 Incorrect 437 ms 620 KB Wrong
8 Incorrect 420 ms 620 KB Wrong
9 Partially correct 1 ms 620 KB Partially correct : C = 600
10 Incorrect 2 ms 620 KB Wrong
11 Incorrect 2 ms 620 KB Wrong
12 Incorrect 1 ms 620 KB Wrong
13 Incorrect 1 ms 620 KB Wrong
14 Incorrect 1 ms 620 KB Wrong
15 Incorrect 1 ms 620 KB Wrong
16 Incorrect 469 ms 620 KB Wrong
17 Incorrect 2 ms 620 KB Wrong
18 Incorrect 2 ms 620 KB Wrong
19 Incorrect 1 ms 620 KB Wrong
20 Correct 344 ms 620 KB Correct : C = 0
21 Partially correct 1 ms 620 KB Partially correct : C = 600
22 Incorrect 2 ms 620 KB Wrong
23 Partially correct 1 ms 620 KB Partially correct : C = 600
24 Incorrect 430 ms 748 KB Wrong
25 Incorrect 2 ms 620 KB Wrong
26 Incorrect 2 ms 768 KB Wrong
27 Incorrect 1 ms 620 KB Wrong