oj.uz

답안 #1062032

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1062032 2024-08-16T17:22:08 Z ttamx Monster Game (JOI21_monster) C++17
100 / 100
 65 ms 1876 KB 
#include "monster.h"
#include <bits/stdc++.h>

using namespace std;

vector<int> Solve(int n){
	mt19937 rng(777);
	map<pair<int,int>,bool> memo;
	auto query=[&](int x,int y){
		if(memo.count({x,y}))return memo[{x,y}];
		bool res=Query(x,y);
		memo[{x,y}]=res;
		memo[{y,x}]=!res;
		return res;
	};
	vector<int> a(n),b(n);
	function<void(int,int)> msort=[&](int l,int r){
		if(l==r)return;
		// shuffle(a.begin()+l,a.begin()+r+1,rng);
		int m=(l+r)/2;
		msort(l,m);
		msort(m+1,r);
		for(int i=l,j=m+1,p=l;p<=r;p++){
			if(j>r||(i<=m&&!query(a[i],a[j]))){
				b[p]=a[i++];
			}else{
				b[p]=a[j++];
			}
		}
		for(int i=l;i<=r;i++)a[i]=b[i];
	};
	iota(a.begin(),a.end(),0);
	msort(0,n-1);
	auto check=[&](int x){
		int cnt=0;
		for(int i=0;i<min(n,10);i++){
			if(i==x)continue;
			if(query(a[x],a[i])){
				cnt++;
				if(cnt>1){
					return false;
				}
			}
		}
		return true;
	};
	bool ok0=check(0),ok1=check(1);
	int st=-1;
	if(ok0){
		if(ok1){
			for(int i=2;i<min(n,10);i++){
				bool v0=query(a[i],a[0]);
				bool v1=query(a[i],a[1]);
				assert(v0||v1);
				if(v0^v1){
					st=v1;
					break;
				}
			}
		}else{
			st=0;
		}
	}
	if(st==-1){
		st=2;
		while((query(a[st-1],a[st])||query(a[st],a[0]))){
			st++;
			assert(st<n);
		}
	}
	reverse(a.begin(),a.begin()+st+1);
	for(int i=st+1;i<n;i++){
		int j=i;
		while(!query(a[i-1],a[j])){
			j++;
			assert(j<n);
		}
		reverse(a.begin()+i,a.begin()+j+1);
		i=j;
	}
	vector<int> ans(n);
	for(int i=0;i<n;i++)ans[a[i]]=i;
	return ans;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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 1 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 9 ms 856 KB Output is correct
17 Correct 9 ms 600 KB Output is correct
18 Correct 7 ms 600 KB Output is correct
19 Correct 8 ms 764 KB Output is correct
20 Correct 7 ms 600 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 4 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 4 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 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 1 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 9 ms 856 KB Output is correct
17 Correct 9 ms 600 KB Output is correct
18 Correct 7 ms 600 KB Output is correct
19 Correct 8 ms 764 KB Output is correct
20 Correct 7 ms 600 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 4 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 4 ms 344 KB Output is correct
33 Correct 45 ms 1520 KB Output is correct
34 Correct 51 ms 1656 KB Output is correct
35 Correct 49 ms 1544 KB Output is correct
36 Correct 65 ms 1616 KB Output is correct
37 Correct 49 ms 1360 KB Output is correct
38 Correct 52 ms 1360 KB Output is correct
39 Correct 56 ms 1692 KB Output is correct
40 Correct 55 ms 1560 KB Output is correct
41 Correct 54 ms 1332 KB Output is correct
42 Correct 48 ms 1500 KB Output is correct
43 Correct 33 ms 1360 KB Output is correct
44 Correct 28 ms 1104 KB Output is correct

Subtask #3
75.0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 1736 KB Output is correct
2 Correct 61 ms 1484 KB Output is correct
3 Correct 60 ms 1492 KB Output is correct
4 Correct 49 ms 1876 KB Output is correct
5 Correct 60 ms 1728 KB Output is correct
6 Correct 51 ms 1444 KB Output is correct
7 Correct 35 ms 1276 KB Output is correct
8 Correct 57 ms 1436 KB Output is correct
9 Correct 58 ms 1616 KB Output is correct
10 Correct 52 ms 1360 KB Output is correct
11 Correct 63 ms 1624 KB Output is correct
12 Correct 57 ms 1684 KB Output is correct
13 Correct 41 ms 1360 KB Output is correct
14 Correct 41 ms 1164 KB Output is correct
15 Correct 27 ms 1328 KB Output is correct
16 Correct 29 ms 1104 KB Output is correct
17 Correct 51 ms 1588 KB Output is correct
18 Correct 34 ms 1000 KB Output is correct