oj.uz

답안 #533173

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
533173 2022-03-05T04:35:14 Z 4fecta Monster Game (JOI21_monster) C++17
10 / 100
 221 ms 288 KB 
#include <bits/stdc++.h>
#include "monster.h"
using namespace std;
#define ll long long
#define ld long double
#define pii pair<int, int>
#define f first
#define s second
#define boost() cin.tie(0), cin.sync_with_stdio(0)

int cnt[205];

vector<int> Solve(int N) {
    for (int i = 0; i < N; i++) {
        for (int j = i + 1; j < N; j++) {
            bool f = Query(i, j);
            if (f) cnt[i]++;
            else cnt[j]++;
        }
    }
    int x = -1, y = 0;
    for (int i = 0; i < N; i++) {
        if (cnt[i] == 1) {
            if (x == -1) x = i;
            y = i;
        }
    }
    if (Query(x, y)) cnt[x]--;
    else cnt[y]--;
    x = -1, y = 0;
    for (int i = 0; i < N; i++) {
        if (cnt[i] == N - 2) {
            if (x == -1) x = i;
            y = i;
        }
    }
    if (Query(x, y)) cnt[y]++;
    else cnt[x]++;
    vector<int> ret;
    for (int i = 0; i < N; i++) ret.push_back(cnt[i]);
    return ret;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 284 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 0 ms 200 KB Output is correct
6 Correct 1 ms 200 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 1 ms 276 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 1 ms 200 KB Output is correct
11 Correct 1 ms 200 KB Output is correct
12 Correct 0 ms 200 KB Output is correct
13 Correct 1 ms 200 KB Output is correct
14 Correct 1 ms 200 KB Output is correct
15 Correct 1 ms 200 KB Output is correct
16 Correct 153 ms 272 KB Output is correct
17 Correct 149 ms 272 KB Output is correct
18 Correct 187 ms 256 KB Output is correct
19 Correct 202 ms 276 KB Output is correct
20 Correct 125 ms 200 KB Output is correct
21 Correct 0 ms 200 KB Output is correct
22 Correct 0 ms 200 KB Output is correct
23 Correct 1 ms 200 KB Output is correct
24 Correct 1 ms 200 KB Output is correct
25 Correct 1 ms 200 KB Output is correct
26 Correct 221 ms 268 KB Output is correct
27 Correct 1 ms 200 KB Output is correct
28 Correct 1 ms 200 KB Output is correct
29 Correct 1 ms 200 KB Output is correct
30 Correct 1 ms 200 KB Output is correct
31 Correct 1 ms 288 KB Output is correct
32 Correct 217 ms 272 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 284 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 0 ms 200 KB Output is correct
6 Correct 1 ms 200 KB Output is correct
7 Correct 1 ms 200 KB Output is correct
8 Correct 1 ms 276 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 1 ms 200 KB Output is correct
11 Correct 1 ms 200 KB Output is correct
12 Correct 0 ms 200 KB Output is correct
13 Correct 1 ms 200 KB Output is correct
14 Correct 1 ms 200 KB Output is correct
15 Correct 1 ms 200 KB Output is correct
16 Correct 153 ms 272 KB Output is correct
17 Correct 149 ms 272 KB Output is correct
18 Correct 187 ms 256 KB Output is correct
19 Correct 202 ms 276 KB Output is correct
20 Correct 125 ms 200 KB Output is correct
21 Correct 0 ms 200 KB Output is correct
22 Correct 0 ms 200 KB Output is correct
23 Correct 1 ms 200 KB Output is correct
24 Correct 1 ms 200 KB Output is correct
25 Correct 1 ms 200 KB Output is correct
26 Correct 221 ms 268 KB Output is correct
27 Correct 1 ms 200 KB Output is correct
28 Correct 1 ms 200 KB Output is correct
29 Correct 1 ms 200 KB Output is correct
30 Correct 1 ms 200 KB Output is correct
31 Correct 1 ms 288 KB Output is correct
32 Correct 217 ms 272 KB Output is correct
33 Runtime error 3 ms 276 KB Execution killed with signal 11
34 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 272 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -