oj.uz

Submission #150055

# Submission time Handle Problem Language Result Execution time Memory
150055 2019-09-01T07:38:03 Z 채원♡예나(#3706, rhrnald, ohjw420, chris2tg) Lokahian Relics (FXCUP4_lokahia) C++17
0 / 100
 7 ms 640 KB 
#include "lokahia.h"
#include <vector>
#include <queue>
using namespace std;

int h[300];
int sz[300];
typedef pair<int,int> pii;
vector<int> q,nq;
vector<int> Q;

vector<int> lft;
bool merge(int x, int y) {
	int t;
	if(h[x]==h[y]) t=h[x];
	else t=CollectRelics(h[x],h[y]);
	if(t<0) return false;
	h[x]=t;
	sz[x]+=sz[y];
	return true;
}
int FindBase(int N){ int n=N;
	for(int i=0; i<n; i++) q.push_back(i), h[i]=i, sz[i]=1;
	for(int j=0; j<!q.empty(); j++) {
		nq.clear();
		for(int i=0; i<(int)q.size(); i+=2) {
			if(i==(int)q.size()-1) {
				lft.push_back(q[i]);
			}
			if(merge(q[i], q[i+1])) {
				nq.push_back(q[i]);
			} else {
				Q.push_back(q[i]);
				Q.push_back(q[i+1]);
			}
		}
		q=nq;
	}
	if(lft.empty()) return -1;

	int X=lft.back();
	for(int i=0; i<(int)lft.size()-1; i++) merge(X, lft[i]);
	for(int i=0; i<(int)Q.size(); i++) merge(X, Q[i]);
	if(sz[X]>(n/2)) return h[X];
	else return -1;
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 512 KB Correct : C = 179
2 Incorrect 5 ms 512 KB Wrong
3 Incorrect 6 ms 640 KB Wrong
4 Incorrect 6 ms 512 KB Wrong
5 Correct 6 ms 640 KB Correct : C = 215
6 Correct 6 ms 512 KB Correct : C = 100
7 Incorrect 6 ms 512 KB Wrong
8 Correct 5 ms 528 KB Correct : C = 299
9 Incorrect 6 ms 512 KB Wrong
10 Correct 6 ms 640 KB Correct : C = 100
11 Incorrect 6 ms 640 KB Wrong
12 Incorrect 6 ms 512 KB Wrong
13 Incorrect 6 ms 640 KB Wrong
14 Incorrect 6 ms 512 KB Wrong
15 Correct 6 ms 640 KB Correct : C = 238
16 Correct 6 ms 640 KB Correct : C = 264
17 Incorrect 6 ms 512 KB Wrong
18 Correct 5 ms 512 KB Correct : C = 60
19 Correct 6 ms 512 KB Correct : C = 150
20 Correct 5 ms 512 KB Correct : C = 0
21 Incorrect 6 ms 512 KB Wrong
22 Correct 6 ms 640 KB Correct : C = 100
23 Incorrect 7 ms 560 KB Wrong
24 Correct 6 ms 512 KB Correct : C = 60
25 Incorrect 7 ms 640 KB Wrong
26 Correct 6 ms 640 KB Correct : C = 100
27 Correct 5 ms 512 KB Correct : C = 3