oj.uz

답안 #492335

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
492335 2021-12-06T17:07:06 Z Jarif_Rahman Monster Game (JOI21_monster) C++17
10 / 100
 227 ms 4208 KB 
#include "monster.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

vector<vector<int>> QQ;
bool query(int a, int b){
    if(a > b){
        if(QQ[b][a] == -1) QQ[b][a] = Query(b, a);
        return !QQ[b][a];
    }
    else{
        if(QQ[a][b] == -1) QQ[a][b] = Query(a, b);
        return QQ[a][b];
    }
}

vector<int> Solve(int n){
    QQ = vector<vector<int>>(n, vector<int>(n, -1));

    vector<int> cnt(n, 0), sth(n);
    for(int i = 0; i < n; i++) sth[i] = i;
    
    for(int i = 0; i < n; i++) for(int j = 0; j < n; j++) if(i != j && query(i, j)) cnt[i]++;

    sort(sth.begin(), sth.end(), [&](int a, int b){
        return cnt[a] < cnt[b];
    });
    
    if(query(sth[1], sth[0])) swap(sth[1], sth[0]);
    if(query(sth[n-1], sth[n-2])) swap(sth[n-1], sth[n-2]);

    vector<int> ans(n);
    for(int i = 0; i < n; i++) ans[sth[i]] = i;
    return ans;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 0 ms 200 KB Output is correct
7 Correct 0 ms 200 KB Output is correct
8 Correct 0 ms 200 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 1 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 162 ms 328 KB Output is correct
17 Correct 140 ms 328 KB Output is correct
18 Correct 151 ms 436 KB Output is correct
19 Correct 181 ms 448 KB Output is correct
20 Correct 164 ms 448 KB Output is correct
21 Correct 0 ms 200 KB Output is correct
22 Correct 1 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 169 ms 432 KB Output is correct
27 Correct 1 ms 200 KB Output is correct
28 Correct 0 ms 200 KB Output is correct
29 Correct 0 ms 200 KB Output is correct
30 Correct 0 ms 200 KB Output is correct
31 Correct 1 ms 200 KB Output is correct
32 Correct 163 ms 432 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 0 ms 200 KB Output is correct
7 Correct 0 ms 200 KB Output is correct
8 Correct 0 ms 200 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 1 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 162 ms 328 KB Output is correct
17 Correct 140 ms 328 KB Output is correct
18 Correct 151 ms 436 KB Output is correct
19 Correct 181 ms 448 KB Output is correct
20 Correct 164 ms 448 KB Output is correct
21 Correct 0 ms 200 KB Output is correct
22 Correct 1 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 169 ms 432 KB Output is correct
27 Correct 1 ms 200 KB Output is correct
28 Correct 0 ms 200 KB Output is correct
29 Correct 0 ms 200 KB Output is correct
30 Correct 0 ms 200 KB Output is correct
31 Correct 1 ms 200 KB Output is correct
32 Correct 163 ms 432 KB Output is correct
33 Incorrect 227 ms 4192 KB Wrong Answer [6]
34 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 90 ms 4208 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -