oj.uz

답안 #229284

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
229284 2020-05-04T05:31:14 Z 534351 로카히아 유적 (FXCUP4_lokahia) C++17
0 / 100
 5 ms 640 KB 
#include "lokahia.h"
#include <bits/stdc++.h>

using namespace std;

template<class T, class U>
void ckmin(T &a, U b)
{
    if (a > b) a = b;
}

template<class T, class U>
void ckmax(T &a, U b)
{
    if (a < b) a = b;
}

#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define SZ(x) ((int) (x).size())
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;

int FindBase(int N)
{
    int maj = -1, cnt = 0;
    FOR(i, 0, N - 1)
    {
        if (cnt == 0)
        {
            maj = i;
            cnt++;
        }
        else
        {
            int w = CollectRelics(maj, i);
            if (w == -1)
            {
                cnt--;
            }
            else
            {
                cnt++;
            }
        }
    }
    if (cnt == 0) maj = N - 1;
    cnt = 1;
    int res = -1;
    FOR(i, 0, N)
    {
        if (i == maj) continue;
        int w = CollectRelics(maj, i);
        if (w != -1)
        {
            cnt++;
            ckmax(res, w);
        }
    }
    return ((cnt > N / 2) ? res : -1);
}

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Correct : C = 235
2 Incorrect 4 ms 512 KB Wrong
3 Partially correct 5 ms 640 KB Partially correct : C = 317
4 Correct 5 ms 512 KB Correct : C = 7
5 Partially correct 5 ms 640 KB Partially correct : C = 383
6 Partially correct 5 ms 640 KB Partially correct : C = 380
7 Partially correct 5 ms 640 KB Partially correct : C = 397
8 Correct 5 ms 512 KB Correct : C = 228
9 Partially correct 5 ms 640 KB Partially correct : C = 395
10 Partially correct 5 ms 640 KB Partially correct : C = 384
11 Partially correct 5 ms 640 KB Partially correct : C = 397
12 Correct 5 ms 640 KB Correct : C = 224
13 Partially correct 5 ms 640 KB Partially correct : C = 389
14 Correct 5 ms 512 KB Correct : C = 237
15 Correct 5 ms 640 KB Correct : C = 297
16 Partially correct 5 ms 640 KB Partially correct : C = 388
17 Correct 5 ms 512 KB Correct : C = 178
18 Correct 5 ms 512 KB Correct : C = 234
19 Partially correct 5 ms 640 KB Partially correct : C = 309
20 Partially correct 5 ms 640 KB Partially correct : C = 384
21 Correct 5 ms 512 KB Correct : C = 223
22 Correct 5 ms 512 KB Correct : C = 177
23 Correct 5 ms 512 KB Correct : C = 235
24 Partially correct 5 ms 640 KB Partially correct : C = 395
25 Correct 5 ms 640 KB Correct : C = 298
26 Correct 5 ms 512 KB Correct : C = 228
27 Partially correct 5 ms 640 KB Partially correct : C = 384