#include <bits/stdc++.h>
using namespace std;
#include "lokahia.h"
int Q[205][205];
int tq = 0;
int query(int i, int j){
if (i == j) return Q[i][i] = i;
else if (tq >= 600) 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 <= 300){
int cur = good[0];
for (auto x : good){
if (cur == x) continue;
int q = query(cur,x);
if (q != -1 && q > 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;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
5 ms |
640 KB |
Partially correct : C = 351 |
2 |
Partially correct |
6 ms |
1024 KB |
Partially correct : C = 395 |
3 |
Correct |
6 ms |
768 KB |
Correct : C = 199 |
4 |
Partially correct |
5 ms |
640 KB |
Partially correct : C = 326 |
5 |
Correct |
5 ms |
640 KB |
Correct : C = 119 |
6 |
Correct |
5 ms |
768 KB |
Correct : C = 200 |
7 |
Partially correct |
6 ms |
768 KB |
Partially correct : C = 404 |
8 |
Correct |
5 ms |
640 KB |
Correct : C = 119 |
9 |
Partially correct |
5 ms |
768 KB |
Partially correct : C = 374 |
10 |
Partially correct |
5 ms |
768 KB |
Partially correct : C = 302 |
11 |
Partially correct |
5 ms |
768 KB |
Partially correct : C = 368 |
12 |
Partially correct |
6 ms |
768 KB |
Partially correct : C = 390 |
13 |
Partially correct |
5 ms |
768 KB |
Partially correct : C = 374 |
14 |
Correct |
7 ms |
768 KB |
Correct : C = 200 |
15 |
Partially correct |
5 ms |
640 KB |
Partially correct : C = 354 |
16 |
Correct |
5 ms |
640 KB |
Correct : C = 121 |
17 |
Correct |
6 ms |
768 KB |
Correct : C = 300 |
18 |
Partially correct |
5 ms |
640 KB |
Partially correct : C = 316 |
19 |
Correct |
5 ms |
512 KB |
Correct : C = 0 |
20 |
Correct |
5 ms |
512 KB |
Correct : C = 4 |
21 |
Correct |
5 ms |
768 KB |
Correct : C = 200 |
22 |
Partially correct |
5 ms |
768 KB |
Partially correct : C = 397 |
23 |
Correct |
5 ms |
768 KB |
Correct : C = 199 |
24 |
Correct |
5 ms |
768 KB |
Correct : C = 120 |
25 |
Correct |
5 ms |
640 KB |
Correct : C = 120 |
26 |
Correct |
5 ms |
640 KB |
Correct : C = 120 |
27 |
Correct |
5 ms |
768 KB |
Correct : C = 200 |