답안 #895200

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
895200 2023-12-29T15:20:40 Z Darren0724 Monster Game (JOI21_monster) C++17
10 / 100
119 ms 4348 KB
#include "monster.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
const int N=205;
int n;
inline int ask(int a,int b){
	return Query(a,b);
}

vector<int> Solve(int n1) {
	n=n1;
    vector<int> ans(n);
    vector v(n,vector<int>(n,0));
    vector<int> cnt(n);
    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            v[i][j]=ask(i,j);
            v[j][i]=v[i][j]^1;
            cnt[i]+=v[i][j];
            cnt[j]+=v[j][i];
        }
    }
    vector<int> t;
    for(int i=0;i<n;i++){
        if(cnt[i]==n-2){
            t.push_back(i);
        }
    }
    int now=0;
    if(v[t[0]][t[1]]){
        ans[t[0]]=n-2;
        ans[t[1]]=n-1;
        now=t[0];
    }
    else{
        ans[t[1]]=n-2;
        ans[t[0]]=n-1;
        now=t[1];
    }
    for(int i=n-3;i>0;i--){
        int idx=-1;
        for(int j=0;j<n;j++){
            if(ans[j]){
                continue;
            }
            if(v[j][now]){
                idx=j;
                break;
            }
        }
        ans[idx]=i;
        now=idx;
    }

	return ans;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 80 ms 344 KB Output is correct
17 Correct 88 ms 344 KB Output is correct
18 Correct 83 ms 600 KB Output is correct
19 Correct 90 ms 344 KB Output is correct
20 Correct 82 ms 600 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 552 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 85 ms 344 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 82 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 80 ms 344 KB Output is correct
17 Correct 88 ms 344 KB Output is correct
18 Correct 83 ms 600 KB Output is correct
19 Correct 90 ms 344 KB Output is correct
20 Correct 82 ms 600 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 552 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 85 ms 344 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 82 ms 344 KB Output is correct
33 Incorrect 102 ms 4336 KB Wrong Answer [6]
34 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 119 ms 4348 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -