oj.uz

답안 #320808

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
320808 2020-11-10T01:37:56 Z seedkin 로카히아 유적 (FXCUP4_lokahia) C++17
0 / 100
 3 ms 1152 KB 
#include "lokahia.h"
#include <stdio.h>

int root[205]; // who is root?
int select[205]; // able to get mana?
int isRoot[205]; // 1== root 0 == no
int target;

int findRoot(int r, int leaf) {
	if(r == leaf) return select[r];

	int temp = root[leaf];
	select[r] += select[leaf];
	root[leaf] = r;
	select[leaf] = 0;
	isRoot[leaf] = 0;
	// isRoot[r] = 1;

	return temp == -1 ? select[r]: findRoot(r, temp);
}

int FindBase(int N){
	// printf("%d\n", CollectRelics(0, 1));
	target = N / 2;
	// int except = 0;
	int boss[205];
	int bossNum = 0;
	
	for(int i =0; i < N; i++) {
		root[i] = -1;
		select[i] = 1;
		isRoot[i] = 1;
		boss[i] = 0;
	}

	for(int i =0; i< N;) {
		int s = 1;
		boss[bossNum++] = i;
		for(int j =i+1; j < N; j++) {
			int r = CollectRelics(i, j);
			if( r == -1) {
				s--;
				if(s == 0) {
					i = j+1;
					break;
				}
				continue;
			}
			int num = findRoot(r, i);
			num = findRoot(r, j);
			if(num > target) return r;
			s++;
		}
	}
	
	int c = boss[bossNum-1];

	for(int i =0; i < bossNum-1; i++) {
		int a = boss[i];
		if(root[c] == root[a]) continue;
		int r = CollectRelics(c, a);
		if(r == -1) {
			int b = boss[i+1];
			for(int j = a+1; j < b; j++) {
				if(root[j] == root[c]) continue;
				if(isRoot[j] == 0) continue;
				r = CollectRelics(c, j);
				if(r == -1) continue;
				int num = findRoot(r, c);
				num = findRoot(r, j);
				if(num > target) return r;
			}
			continue;
		}
		int num = findRoot(r, c);
		num = findRoot(r, a);
		if(num > target) return r;
	}

	return -1;
}

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 620 KB Wrong
2 Correct 2 ms 640 KB Correct : C = 100
3 Runtime error 2 ms 1004 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Incorrect 1 ms 620 KB Wrong
5 Correct 0 ms 492 KB Correct : C = 2
6 Correct 1 ms 620 KB Correct : C = 191
7 Correct 1 ms 640 KB Correct : C = 103
8 Correct 1 ms 620 KB Correct : C = 276
9 Incorrect 1 ms 620 KB Wrong
10 Incorrect 1 ms 620 KB Wrong
11 Correct 1 ms 620 KB Correct : C = 60
12 Correct 2 ms 620 KB Correct : C = 169
13 Correct 1 ms 620 KB Correct : C = 60
14 Incorrect 1 ms 620 KB Wrong
15 Incorrect 1 ms 620 KB Wrong
16 Runtime error 2 ms 1152 KB Execution killed with signal 11 (could be triggered by violating memory limits)
17 Runtime error 1 ms 748 KB Execution killed with signal 11 (could be triggered by violating memory limits)
18 Incorrect 1 ms 620 KB Wrong
19 Correct 1 ms 620 KB Correct : C = 171
20 Runtime error 2 ms 1004 KB Execution killed with signal 11 (could be triggered by violating memory limits)
21 Correct 1 ms 620 KB Correct : C = 59
22 Correct 1 ms 620 KB Correct : C = 100
23 Incorrect 1 ms 620 KB Wrong
24 Runtime error 2 ms 876 KB Execution killed with signal 11 (could be triggered by violating memory limits)
25 Runtime error 3 ms 896 KB Execution killed with signal 11 (could be triggered by violating memory limits)
26 Incorrect 1 ms 620 KB Wrong
27 Correct 1 ms 620 KB Correct : C = 99