oj.uz

답안 #247220

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
247220 2020-07-11T08:05:39 Z dantoh000 로카히아 유적 (FXCUP4_lokahia) C++17
0 / 100
 7 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] == -1) return Q[i][j] = Q[j][i] = CollectRelics(i,j);
    else return Q[i][j];
}
int FindBase(int N){
    memset(Q,-1,sizeof(Q));
	int cur = 0;
	vector<int> pos;
	vector<int> bad;
	for (int i = 0; i < N; i++){
        int q = query(0,i);
        if (q != -1) pos.push_back(i);
        else bad.push_back(i);
	}
	for (auto x : pos){
        int q = query(cur,x);
        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;
    cur = bad[0];
    pos.clear();
    for (int i = 0; i < N; i++){
        int q = query(cur,i);
        if (q != -1) pos.push_back(i);
	}
    for (auto x : pos){
        int q = query(cur,x);
        if (q != -1 && q > cur) cur = q;
	}
    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 768 KB Correct : C = 234
2 Incorrect 5 ms 768 KB Wrong
3 Partially correct 5 ms 768 KB Partially correct : C = 397
4 Partially correct 6 ms 768 KB Partially correct : C = 472
5 Correct 5 ms 768 KB Correct : C = 237
6 Partially correct 5 ms 768 KB Partially correct : C = 455
7 Correct 5 ms 768 KB Correct : C = 235
8 Correct 5 ms 640 KB Correct : C = 0
9 Incorrect 5 ms 768 KB Wrong
10 Incorrect 5 ms 768 KB Wrong
11 Partially correct 7 ms 768 KB Partially correct : C = 395
12 Correct 5 ms 768 KB Correct : C = 237
13 Partially correct 5 ms 768 KB Partially correct : C = 464
14 Incorrect 5 ms 768 KB Wrong
15 Incorrect 5 ms 896 KB Wrong
16 Incorrect 5 ms 768 KB Wrong
17 Correct 5 ms 768 KB Correct : C = 235
18 Incorrect 5 ms 768 KB Wrong
19 Incorrect 5 ms 768 KB Wrong
20 Partially correct 5 ms 768 KB Partially correct : C = 382
21 Partially correct 5 ms 768 KB Partially correct : C = 476
22 Correct 6 ms 768 KB Correct : C = 227
23 Partially correct 6 ms 768 KB Partially correct : C = 397
24 Partially correct 5 ms 768 KB Partially correct : C = 383
25 Correct 5 ms 640 KB Correct : C = 7
26 Partially correct 5 ms 768 KB Partially correct : C = 396
27 Incorrect 5 ms 768 KB Wrong