oj.uz

Submission #247242

# Submission time Handle Problem Language Result Execution time Memory
247242 2020-07-11T08:21:22 Z cheeheng Lokahian Relics (FXCUP4_lokahia) C++17
0 / 100
 8 ms 768 KB 
#include "lokahia.h"
#include <bits/stdc++.h>
using namespace std;

int Q = 0;

int memo[205][205];
int query(int a, int b){
    if(memo[a][b] == 0){
        Q ++;
        return memo[a][b] = CollectRelics(a, b);
    }else{
        return memo[a][b];
    }
}

int p[205];
int rank1[205];
int setSize[205];
void init(int N){
    for(int i = 0; i < N; i ++){
        p[i] = i;
        rank1[i] = 0;
        setSize[i] = 1;
    }
}

int findSet(int i){
    return (p[i] == i) ? i : (p[i] = findSet(p[i]));
}

bool isSameSet(int i, int j){
    return findSet(i) == findSet(j);
}

void unionSet(int i, int j){
    if(!isSameSet(i, j)){
        int x = findSet(i);
        int y = findSet(j);
        //printf("setSize: %d %d\n", x, y);
        if(rank1[x] > rank1[y]){
            p[y] = x;
            setSize[x] += setSize[y];
        }else{
            p[x] = y;
            setSize[y] += setSize[x];
            if(rank1[x] == rank1[y]){rank1[y] ++;}
        }
    }
}

int FindBase(int N){
    if(N == 1){
        return 0;
    }
    mt19937 rng(158);
    uniform_int_distribution<int> rand(0, N-1);

    memset(memo, 0, sizeof(memo));

    Q = 0;
    init(N);
    int tries = 0;
    while(Q < 600 && tries < 100000){
        int R1 = rand(rng);
        tries ++;
        int R2 = rand(rng);
        if(R1 == R2){continue;}

        if(isSameSet(R1, R2) && memo[R1][R2] != 0){continue;}

        int R3 = query(R1, R2);
        if(R3 == -1){continue;}

        //printf("Q=%d: %d %d %d\n", Q, R1, R2, R3);
        unionSet(R1, R2);
        unionSet(R1, R3);
        //printf("setSize=%d\n", setSize[findSet(R3)]);
        if(setSize[findSet(R3)] > N/2){
            return R3;
        }
    }

	return -1;
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 5 ms 768 KB Partially correct : C = 600
2 Incorrect 7 ms 768 KB Wrong
3 Partially correct 5 ms 768 KB Partially correct : C = 407
4 Correct 5 ms 768 KB Correct : C = 41
5 Partially correct 5 ms 768 KB Partially correct : C = 393
6 Correct 5 ms 768 KB Correct : C = 253
7 Correct 5 ms 768 KB Correct : C = 60
8 Partially correct 5 ms 768 KB Partially correct : C = 600
9 Correct 7 ms 768 KB Correct : C = 64
10 Correct 5 ms 512 KB Correct : C = 0
11 Partially correct 8 ms 768 KB Partially correct : C = 600
12 Incorrect 6 ms 768 KB Wrong
13 Correct 5 ms 640 KB Correct : C = 2
14 Partially correct 5 ms 768 KB Partially correct : C = 361
15 Correct 5 ms 768 KB Correct : C = 39
16 Partially correct 6 ms 768 KB Partially correct : C = 600
17 Partially correct 5 ms 768 KB Partially correct : C = 600
18 Partially correct 6 ms 768 KB Partially correct : C = 600
19 Partially correct 6 ms 768 KB Partially correct : C = 600
20 Partially correct 5 ms 768 KB Partially correct : C = 600
21 Incorrect 5 ms 768 KB Wrong
22 Partially correct 5 ms 768 KB Partially correct : C = 600
23 Partially correct 6 ms 768 KB Partially correct : C = 600
24 Partially correct 6 ms 768 KB Partially correct : C = 371
25 Incorrect 6 ms 768 KB Wrong
26 Partially correct 5 ms 768 KB Partially correct : C = 365
27 Partially correct 7 ms 768 KB Partially correct : C = 600