oj.uz

Submission #247302

# Submission time Handle Problem Language Result Execution time Memory
247302 2020-07-11T08:40:47 Z dwsc Lokahian Relics (FXCUP4_lokahia) C++17
0 / 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(3082);
	int counter = 0;
	for (int i = 0; i < N; i++) p[i] = i;
	int fail = 0;
	while (counter < 210){
        int a = rand()%N,b = rand()%N;
        if (fail > 10000) 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 = 0;
    for (int i = 0; i < N; i++){
        if (findset(i)== cur) tot++;
        else tot += CollectRelics(i,cur)!=-1;
    }
    if (tot > N/2) return cur;
    return -1;
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 640 KB Wrong
2 Correct 6 ms 616 KB Correct : C = 93
3 Partially correct 5 ms 768 KB Partially correct : C = 340
4 Partially correct 5 ms 768 KB Partially correct : C = 331
5 Partially correct 6 ms 768 KB Partially correct : C = 332
6 Correct 6 ms 768 KB Correct : C = 154
7 Correct 5 ms 640 KB Correct : C = 285
8 Partially correct 5 ms 768 KB Partially correct : C = 388
9 Partially correct 5 ms 640 KB Partially correct : C = 328
10 Correct 5 ms 512 KB Correct : C = 3
11 Correct 5 ms 640 KB Correct : C = 270
12 Partially correct 5 ms 640 KB Partially correct : C = 329
13 Partially correct 5 ms 768 KB Partially correct : C = 325
14 Partially correct 5 ms 768 KB Partially correct : C = 341
15 Partially correct 5 ms 768 KB Partially correct : C = 408
16 Partially correct 6 ms 768 KB Partially correct : C = 339
17 Correct 5 ms 640 KB Correct : C = 277
18 Correct 6 ms 768 KB Correct : C = 145
19 Correct 5 ms 512 KB Correct : C = 0
20 Correct 5 ms 640 KB Correct : C = 282
21 Partially correct 5 ms 768 KB Partially correct : C = 354
22 Correct 5 ms 640 KB Correct : C = 88
23 Partially correct 6 ms 768 KB Partially correct : C = 392
24 Partially correct 5 ms 768 KB Partially correct : C = 348
25 Partially correct 5 ms 896 KB Partially correct : C = 409
26 Partially correct 5 ms 768 KB Partially correct : C = 339
27 Correct 5 ms 640 KB Correct : C = 287