oj.uz

Submission #247338

# Submission time Handle Problem Language Result Execution time Memory
247338 2020-07-11T08:50:19 Z dantoh000 Lokahian Relics (FXCUP4_lokahia) C++17
0 / 100
 8 ms 812 KB 
#include <bits/stdc++.h>
using namespace std;
#include "lokahia.h"
int Q[205][205];
const int LIM = 400;
int tq = 0;
int query(int i, int 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;
    vector<int> good;
    for (int i = 0; i < N; i++) good.push_back(i);
    while (good.size() && tq <= LIM){
        sort(good.begin(),good.end());
        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 > max(x,cur)) 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 768 KB Correct : C = 202
2 Correct 5 ms 768 KB Correct : C = 201
3 Correct 5 ms 640 KB Correct : C = 127
4 Partially correct 8 ms 768 KB Partially correct : C = 400
5 Correct 5 ms 640 KB Correct : C = 125
6 Partially correct 5 ms 768 KB Partially correct : C = 319
7 Partially correct 5 ms 768 KB Partially correct : C = 365
8 Incorrect 5 ms 512 KB Wrong
9 Correct 5 ms 640 KB Correct : C = 124
10 Partially correct 6 ms 768 KB Partially correct : C = 400
11 Correct 5 ms 768 KB Correct : C = 200
12 Partially correct 7 ms 768 KB Partially correct : C = 400
13 Partially correct 6 ms 768 KB Partially correct : C = 400
14 Correct 5 ms 640 KB Correct : C = 134
15 Incorrect 5 ms 768 KB Wrong
16 Partially correct 5 ms 640 KB Partially correct : C = 400
17 Correct 5 ms 640 KB Correct : C = 124
18 Partially correct 7 ms 768 KB Partially correct : C = 400
19 Partially correct 6 ms 640 KB Partially correct : C = 400
20 Correct 5 ms 512 KB Correct : C = 0
21 Correct 5 ms 812 KB Correct : C = 200
22 Correct 5 ms 768 KB Correct : C = 202
23 Partially correct 7 ms 768 KB Partially correct : C = 400
24 Correct 5 ms 640 KB Correct : C = 122
25 Partially correct 7 ms 768 KB Partially correct : C = 400
26 Partially correct 5 ms 768 KB Partially correct : C = 400
27 Partially correct 6 ms 768 KB Partially correct : C = 302