oj.uz

Submission #247265

# Submission time Handle Problem Language Result Execution time Memory
247265 2020-07-11T08:31:50 Z dwsc Lokahian Relics (FXCUP4_lokahia) C++17
39 / 100
 6 ms 896 KB 
#include <bits/stdc++.h>
#include "lokahia.h"
using namespace std;
int p[210];
int visit[210][210];
int num[210];
int findset(int i){
    return p[i]==i?p[i]:p[i]=findset(p[i]);
}
int FindBase(int N){
    srand(2041);
	int counter = 0;
	for (int i = 0; i < N; i++) p[i] = i;
	int fail = 0;
	while (counter < 401){
        int a = rand()%N,b = rand()%N;
        if (fail > 1000) break;
        fail++;
        if (a == b) continue;
        if (visit[a][b]) continue;
        if (findset(a) == findset(b)) continue;
        fail = 0;
        counter++;
        visit[a][b] = visit[b][a] = 1;
        int temp = CollectRelics(a,b);
        if (temp != -1) {
            p[findset(a)] = temp;
            p[findset(b)] = temp;
        }
	}
    for (int i = 0; i < N; i++){
        num[findset(i)]++;
    }
    int maxi = 0,cur = -1;
    for (int i = 0; i < N; i++){
        if (num[i] > maxi){
            maxi = num[i];
            cur = i;
        }
    }
    int tot = 1;
    for (int i = 0; i < N; i++){
        if (i == cur) continue;
        tot += CollectRelics(i,cur)!=-1;
    }
    if (tot > N/2) return cur;
    return -1;
}

Subtask #1
39.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 6 ms 896 KB Partially correct : C = 347
2 Partially correct 6 ms 768 KB Partially correct : C = 599
3 Partially correct 5 ms 768 KB Partially correct : C = 600
4 Partially correct 5 ms 640 KB Partially correct : C = 520
5 Partially correct 5 ms 768 KB Partially correct : C = 600
6 Partially correct 6 ms 768 KB Partially correct : C = 599
7 Partially correct 5 ms 768 KB Partially correct : C = 599
8 Partially correct 5 ms 640 KB Partially correct : C = 519
9 Partially correct 5 ms 640 KB Partially correct : C = 520
10 Partially correct 5 ms 768 KB Partially correct : C = 600
11 Correct 5 ms 640 KB Correct : C = 204
12 Partially correct 5 ms 768 KB Partially correct : C = 600
13 Partially correct 5 ms 640 KB Partially correct : C = 519
14 Correct 5 ms 512 KB Correct : C = 8
15 Correct 5 ms 640 KB Correct : C = 208
16 Partially correct 6 ms 768 KB Partially correct : C = 599
17 Partially correct 5 ms 768 KB Partially correct : C = 600
18 Partially correct 5 ms 768 KB Partially correct : C = 519
19 Partially correct 5 ms 640 KB Partially correct : C = 520
20 Partially correct 5 ms 768 KB Partially correct : C = 599
21 Partially correct 6 ms 640 KB Partially correct : C = 520
22 Partially correct 6 ms 768 KB Partially correct : C = 348
23 Partially correct 5 ms 640 KB Partially correct : C = 519
24 Partially correct 5 ms 768 KB Partially correct : C = 600
25 Correct 5 ms 512 KB Correct : C = 0
26 Partially correct 6 ms 768 KB Partially correct : C = 599
27 Partially correct 5 ms 768 KB Partially correct : C = 600