oj.uz

Submission #247300

# Submission time Handle Problem Language Result Execution time Memory
247300 2020-07-11T08:40:15 Z dwsc Lokahian Relics (FXCUP4_lokahia) C++17
51 / 100
 6 ms 800 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 < 300){
        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
51.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 6 ms 768 KB Partially correct : C = 477
2 Correct 6 ms 768 KB Correct : C = 145
3 Partially correct 5 ms 768 KB Partially correct : C = 411
4 Correct 5 ms 640 KB Correct : C = 88
5 Partially correct 5 ms 768 KB Partially correct : C = 400
6 Partially correct 5 ms 768 KB Partially correct : C = 498
7 Correct 5 ms 512 KB Correct : C = 0
8 Partially correct 5 ms 640 KB Partially correct : C = 365
9 Correct 6 ms 768 KB Correct : C = 154
10 Correct 5 ms 640 KB Correct : C = 93
11 Partially correct 5 ms 768 KB Partially correct : C = 412
12 Partially correct 5 ms 768 KB Partially correct : C = 418
13 Partially correct 6 ms 768 KB Partially correct : C = 418
14 Partially correct 5 ms 640 KB Partially correct : C = 361
15 Correct 5 ms 512 KB Correct : C = 3
16 Partially correct 5 ms 640 KB Partially correct : C = 419
17 Partially correct 6 ms 768 KB Partially correct : C = 415
18 Partially correct 5 ms 768 KB Partially correct : C = 473
19 Partially correct 6 ms 640 KB Partially correct : C = 364
20 Partially correct 6 ms 768 KB Partially correct : C = 425
21 Partially correct 5 ms 640 KB Partially correct : C = 355
22 Partially correct 5 ms 768 KB Partially correct : C = 499
23 Partially correct 5 ms 800 KB Partially correct : C = 424
24 Partially correct 6 ms 768 KB Partially correct : C = 412
25 Partially correct 5 ms 768 KB Partially correct : C = 404
26 Partially correct 5 ms 640 KB Partially correct : C = 360
27 Partially correct 5 ms 640 KB Partially correct : C = 365