oj.uz

답안 #247323

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
247323 2020-07-11T08:46:11 Z dwsc 로카히아 유적 (FXCUP4_lokahia) C++17
51 / 100
 8 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 < 300){
        int a = rand()%N,b = rand()%N;
        if (fail > 10000) break;
        fail++;
        if (a == b) continue;
        if (visit[findset(a)][findset(b)]) continue;
        if (findset(a) == findset(b)) continue;
        fail = 0;
        counter++;
        int x = findset(a),y = findset(b);
        visit[x][y] = visit[y][x] = 1;
        int temp = CollectRelics(a,b);
        if (temp != -1) {
            for (int i = 0; i < N; i++){
                visit[temp][i] = visit[i][temp] = max(visit[temp][i],max(visit[x][i],visit[y][i]));
            }
            p[x] = temp;
            p[y] = 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

# 결과 실행 시간 메모리 Grader output
1 Partially correct 5 ms 640 KB Partially correct : C = 418
2 Partially correct 5 ms 640 KB Partially correct : C = 360
3 Partially correct 8 ms 768 KB Partially correct : C = 351
4 Partially correct 6 ms 768 KB Partially correct : C = 352
5 Correct 6 ms 768 KB Correct : C = 145
6 Correct 6 ms 512 KB Correct : C = 0
7 Partially correct 6 ms 768 KB Partially correct : C = 498
8 Partially correct 5 ms 768 KB Partially correct : C = 388
9 Partially correct 5 ms 768 KB Partially correct : C = 413
10 Correct 5 ms 640 KB Correct : C = 190
11 Partially correct 6 ms 896 KB Partially correct : C = 476
12 Correct 5 ms 512 KB Correct : C = 3
13 Partially correct 6 ms 768 KB Partially correct : C = 472
14 Correct 6 ms 640 KB Correct : C = 258
15 Correct 5 ms 640 KB Correct : C = 93
16 Partially correct 5 ms 768 KB Partially correct : C = 389
17 Partially correct 5 ms 640 KB Partially correct : C = 419
18 Partially correct 6 ms 768 KB Partially correct : C = 419
19 Partially correct 6 ms 640 KB Partially correct : C = 358
20 Correct 5 ms 640 KB Correct : C = 88
21 Partially correct 5 ms 640 KB Partially correct : C = 360
22 Partially correct 6 ms 768 KB Partially correct : C = 404
23 Partially correct 6 ms 768 KB Partially correct : C = 372
24 Correct 6 ms 768 KB Correct : C = 154
25 Partially correct 5 ms 640 KB Partially correct : C = 359
26 Partially correct 5 ms 768 KB Partially correct : C = 499
27 Partially correct 5 ms 768 KB Partially correct : C = 406