답안 #988938

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
988938 2024-05-27T04:16:31 Z emptypringlescan Archery (IOI09_archery) C++17
21 / 100
2000 ms 604 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));
	for(int k=0; k<n; 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-n;
	cur%=n;
	if(cur<0) cur+=n;
	return cur+1;
}
int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> r;
	assert(n<=5000);
	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 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 4 ms 348 KB Output is correct
4 Execution timed out 2037 ms 348 KB Time limit exceeded
5 Correct 0 ms 348 KB Output is correct
6 Correct 29 ms 448 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 35 ms 448 KB Output is correct
3 Execution timed out 2076 ms 348 KB Time limit exceeded
4 Runtime error 1 ms 604 KB Execution killed with signal 6
5 Runtime error 1 ms 604 KB Execution killed with signal 6
6 Correct 26 ms 464 KB Output is correct
7 Execution timed out 2076 ms 348 KB Time limit exceeded
8 Runtime error 1 ms 600 KB Execution killed with signal 6
9 Runtime error 1 ms 604 KB Execution killed with signal 6
10 Execution timed out 2098 ms 348 KB Time limit exceeded
11 Runtime error 1 ms 600 KB Execution killed with signal 6
12 Execution timed out 2060 ms 348 KB Time limit exceeded
13 Runtime error 1 ms 600 KB Execution killed with signal 6
14 Execution timed out 2096 ms 604 KB Time limit exceeded
15 Runtime error 1 ms 604 KB Execution killed with signal 6
16 Correct 32 ms 464 KB Output is correct
17 Execution timed out 2029 ms 344 KB Time limit exceeded
18 Execution timed out 2045 ms 344 KB Time limit exceeded
19 Execution timed out 2037 ms 348 KB Time limit exceeded
20 Execution timed out 2060 ms 604 KB Time limit exceeded
21 Runtime error 1 ms 600 KB Execution killed with signal 6
22 Runtime error 1 ms 604 KB Execution killed with signal 6
23 Runtime error 0 ms 604 KB Execution killed with signal 6
24 Correct 29 ms 348 KB Output is correct
25 Execution timed out 2066 ms 348 KB Time limit exceeded
26 Execution timed out 2070 ms 604 KB Time limit exceeded
27 Runtime error 1 ms 604 KB Execution killed with signal 6
28 Runtime error 1 ms 604 KB Execution killed with signal 6
29 Execution timed out 2096 ms 348 KB Time limit exceeded
30 Execution timed out 2041 ms 600 KB Time limit exceeded
31 Runtime error 1 ms 600 KB Execution killed with signal 6
32 Runtime error 1 ms 604 KB Execution killed with signal 6
33 Correct 28 ms 472 KB Output is correct
34 Correct 27 ms 348 KB Output is correct
35 Execution timed out 2037 ms 348 KB Time limit exceeded
36 Execution timed out 2073 ms 348 KB Time limit exceeded
37 Runtime error 1 ms 604 KB Execution killed with signal 6
38 Runtime error 1 ms 604 KB Execution killed with signal 6
39 Correct 28 ms 468 KB Output is correct
40 Execution timed out 2023 ms 600 KB Time limit exceeded
41 Execution timed out 2060 ms 348 KB Time limit exceeded
42 Execution timed out 2050 ms 348 KB Time limit exceeded
43 Execution timed out 2041 ms 604 KB Time limit exceeded
44 Runtime error 1 ms 604 KB Execution killed with signal 6
45 Runtime error 1 ms 604 KB Execution killed with signal 6
46 Runtime error 1 ms 604 KB Execution killed with signal 6
47 Runtime error 1 ms 604 KB Execution killed with signal 6