oj.uz

답안 #247239

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
247239 2020-07-11T08:20:14 Z dantoh000 로카히아 유적 (FXCUP4_lokahia) C++17
0 / 100
 6 ms 896 KB 
#include <bits/stdc++.h>
using namespace std;
#include "lokahia.h"
int Q[205][205];
int query(int i, int j){
    if (i == j) return Q[i][i] = i;
    else if (Q[i][j] == -2) 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> pos;
	int cur = 0;
	for (int i = 0; i < N; i++){
        if (cur == i) continue;
        int q = query(cur,i);
        if (q != -1 && q > cur) cur = q;
	}
    int ct = 0;
    for (int i = 0; i < N; i++){
        if (i == cur || query(i,cur) != -1) ct++;
        if (ct > N/2) break;
    }
    if (ct > N/2) return cur;
    else return -1;
}

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 640 KB Correct : C = 119
2 Correct 5 ms 640 KB Correct : C = 118
3 Incorrect 5 ms 768 KB Wrong
4 Correct 5 ms 768 KB Correct : C = 120
5 Correct 5 ms 768 KB Correct : C = 201
6 Correct 5 ms 640 KB Correct : C = 118
7 Correct 5 ms 640 KB Correct : C = 119
8 Correct 5 ms 640 KB Correct : C = 119
9 Correct 5 ms 768 KB Correct : C = 200
10 Incorrect 5 ms 768 KB Wrong
11 Correct 5 ms 768 KB Correct : C = 200
12 Correct 5 ms 768 KB Correct : C = 120
13 Correct 5 ms 896 KB Correct : C = 200
14 Correct 5 ms 512 KB Correct : C = 0
15 Correct 5 ms 768 KB Correct : C = 218
16 Correct 5 ms 640 KB Correct : C = 121
17 Correct 5 ms 768 KB Correct : C = 199
18 Correct 5 ms 512 KB Correct : C = 4
19 Correct 5 ms 640 KB Correct : C = 120
20 Correct 5 ms 640 KB Correct : C = 119
21 Correct 5 ms 768 KB Correct : C = 199
22 Correct 6 ms 768 KB Correct : C = 204
23 Correct 5 ms 768 KB Correct : C = 200
24 Correct 6 ms 768 KB Correct : C = 199
25 Correct 5 ms 768 KB Correct : C = 202
26 Correct 5 ms 768 KB Correct : C = 198
27 Correct 6 ms 768 KB Correct : C = 200