답안 #988941

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988941 2024-05-27T04:19:34 Z emptypringlescan Archery (IOI09_archery) C++17
23 / 100
2000 ms 724 KB
#include <bits/stdc++.h>
using namespace std;
#define int long long
int n;
long long r;
int arr[10005],brr[10005],at;
int calc(){
	if(arr[at]==1) return 1;
	for(int i=0; i<2*n; i++) brr[i]=arr[i];
	int ex[n];
	memset(ex,0,sizeof(ex));
	int rnd=min(n,500ll);
	for(int k=0; k<rnd; k++){
		for(int j=0; j<n; j++) ex[j]=0;
		if(brr[1]>brr[0]) ex[0]=1;
		for(int j=1; j<n; j++){
			if(brr[j<<1|1]<brr[j<<1]) ex[j]=1;
		}
		swap(brr[ex[0]],brr[(n-1)<<1|ex[n-1]]);
		for(int i=0; i<n-2; i++){
			swap(brr[i<<1|ex[i]],brr[(i+1)<<1|ex[i+1]]);
		}
	}
	int cur=0;
	for(int i=0; i<2*n; i++){
		if(arr[at]==brr[i]) cur=i/2;
	}
	if(arr[at]>n) return cur;
	cur-=r-rnd;
	cur%=n;
	if(cur<0) cur+=n;
	return cur+1;
}
int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> r;
	for(int i=0; i<2*n; i++){
		cin >> arr[i];
	}
	pair<int,int> ans={1e8,-1};
	for(int i=0; i<2*n; i++){
		int x=calc();
		if(x<=ans.first) ans={x,i};
		if(i<2*n-1){
			at++;
			swap(arr[i],arr[i+1]);
		}
	}
	cout << ans.second/2+1;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 4 ms 348 KB Output is correct
4 Execution timed out 2098 ms 348 KB Time limit exceeded
5 Correct 1 ms 344 KB Output is correct
6 Correct 25 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 27 ms 472 KB Output is correct
3 Execution timed out 2091 ms 348 KB Time limit exceeded
4 Runtime error 1 ms 600 KB Execution killed with signal 11
5 Runtime error 1 ms 724 KB Execution killed with signal 11
6 Correct 26 ms 472 KB Output is correct
7 Correct 1699 ms 468 KB Output is correct
8 Runtime error 2 ms 604 KB Execution killed with signal 11
9 Runtime error 1 ms 604 KB Execution killed with signal 11
10 Execution timed out 2094 ms 348 KB Time limit exceeded
11 Runtime error 1 ms 604 KB Execution killed with signal 11
12 Execution timed out 2011 ms 344 KB Time limit exceeded
13 Runtime error 1 ms 600 KB Execution killed with signal 11
14 Execution timed out 2065 ms 604 KB Time limit exceeded
15 Runtime error 1 ms 604 KB Execution killed with signal 11
16 Correct 34 ms 348 KB Output is correct
17 Execution timed out 2020 ms 344 KB Time limit exceeded
18 Execution timed out 2062 ms 348 KB Time limit exceeded
19 Execution timed out 2067 ms 348 KB Time limit exceeded
20 Execution timed out 2047 ms 604 KB Time limit exceeded
21 Runtime error 1 ms 604 KB Execution killed with signal 11
22 Runtime error 1 ms 604 KB Execution killed with signal 11
23 Runtime error 1 ms 604 KB Execution killed with signal 11
24 Correct 39 ms 464 KB Output is correct
25 Execution timed out 2033 ms 344 KB Time limit exceeded
26 Execution timed out 2051 ms 604 KB Time limit exceeded
27 Runtime error 1 ms 604 KB Execution killed with signal 11
28 Runtime error 1 ms 604 KB Execution killed with signal 11
29 Execution timed out 2094 ms 348 KB Time limit exceeded
30 Execution timed out 2083 ms 600 KB Time limit exceeded
31 Runtime error 1 ms 604 KB Execution killed with signal 11
32 Runtime error 2 ms 604 KB Execution killed with signal 11
33 Correct 28 ms 348 KB Output is correct
34 Correct 36 ms 348 KB Output is correct
35 Execution timed out 2078 ms 348 KB Time limit exceeded
36 Execution timed out 2056 ms 348 KB Time limit exceeded
37 Execution timed out 2024 ms 600 KB Time limit exceeded
38 Runtime error 1 ms 600 KB Execution killed with signal 11
39 Correct 24 ms 472 KB Output is correct
40 Execution timed out 2096 ms 348 KB Time limit exceeded
41 Execution timed out 2044 ms 344 KB Time limit exceeded
42 Execution timed out 2033 ms 344 KB Time limit exceeded
43 Execution timed out 2017 ms 600 KB Time limit exceeded
44 Execution timed out 2062 ms 604 KB Time limit exceeded
45 Runtime error 1 ms 600 KB Execution killed with signal 11
46 Runtime error 1 ms 604 KB Execution killed with signal 11
47 Runtime error 1 ms 604 KB Execution killed with signal 11