oj.uz

Submission #247350

# Submission time Handle Problem Language Result Execution time Memory
247350 2020-07-11T08:55:03 Z dantoh000 Lokahian Relics (FXCUP4_lokahia) C++17
0 / 100
 7 ms 768 KB 
#include <bits/stdc++.h>
using namespace std;
#include "lokahia.h"
int Q[205][205];
const int LIM = 300;
int tq = 0;
int p[205];
int find(int x){
    return p[x] == x ? x:  p[x] = find(p[x]);
}
int query(int i, int j){
    i = find(i), j = find(j);
    if (i == j) return Q[i][i] = i;
    else if (tq >= LIM) return -1;
    else if (Q[i][j] == -2) {
        tq++;
        return Q[i][j] = Q[j][i] = CollectRelics(i,j);
    }
    else return Q[i][j];
}
int FindBase(int N){
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) Q[i][j] = -2;
        p[i] = i;
    }

    vector<int> good;
    for (int i = 0; i < N; i++) good.push_back(i);
    while (good.size() && tq <= LIM){
        int cur = good[0];
        srand(time(NULL));
        random_shuffle(good.begin(),good.end());
        for (auto x : good){
            if (cur == x) continue;
            int q = query(cur,x);
            if (q != -1 && q > cur) {
                p[cur] = p[x] = q;
                cur = q;
            }
        }
        int ct = 0;
        vector<int> bad;
        for (auto x : good){
            if (x == cur || query(x,cur) != -1) ct++;
            else bad.push_back(x);
            if (ct > N/2) break;
        }
        if (ct > N/2) return cur;
        good.clear();
        for (auto x : bad){
            good.push_back(x);
        }
        bad.clear();
    }
    return -1;
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB Correct : C = 300
2 Correct 6 ms 640 KB Correct : C = 300
3 Correct 6 ms 768 KB Correct : C = 300
4 Correct 5 ms 768 KB Correct : C = 197
5 Correct 5 ms 768 KB Correct : C = 300
6 Correct 5 ms 640 KB Correct : C = 118
7 Correct 5 ms 768 KB Correct : C = 198
8 Correct 5 ms 512 KB Correct : C = 0
9 Correct 5 ms 640 KB Correct : C = 118
10 Correct 6 ms 768 KB Correct : C = 197
11 Correct 4 ms 512 KB Correct : C = 4
12 Correct 5 ms 768 KB Correct : C = 296
13 Correct 5 ms 640 KB Correct : C = 119
14 Correct 6 ms 768 KB Correct : C = 300
15 Correct 5 ms 768 KB Correct : C = 198
16 Correct 7 ms 768 KB Correct : C = 300
17 Correct 6 ms 768 KB Correct : C = 300
18 Correct 5 ms 640 KB Correct : C = 117
19 Incorrect 6 ms 768 KB Wrong
20 Correct 5 ms 640 KB Correct : C = 300
21 Correct 5 ms 640 KB Correct : C = 119
22 Correct 5 ms 768 KB Correct : C = 198
23 Incorrect 7 ms 768 KB Wrong
24 Correct 6 ms 768 KB Correct : C = 300
25 Correct 6 ms 768 KB Correct : C = 300
26 Correct 6 ms 692 KB Correct : C = 118
27 Correct 5 ms 768 KB Correct : C = 199