oj.uz

답안 #210318

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
210318 2020-03-17T03:31:05 Z emanIaicepsa Xylophone (JOI18_xylophone) C++14
100 / 100
 111 ms 380 KB 
#include "xylophone.h"
#include<bits/stdc++.h>
using namespace std;
//static int A[5000]//;

int arr[5005];
void solve(int N) {
	int n = N;
	arr[1] = 1;
	int val = query(1, 2);
	arr[2] = 1+val;
	
	for(int i=3;i<=n;i++){
		int dif = arr[i-2] - arr[i-1];
		if(dif < 0) dif *= -1;
		int val = query(i-2,i);
		
		if(val == dif){
			int v2 = query(i-1,i);
			if(arr[i-1] > arr[i-2]){
				arr[i] = arr[i-1] - v2;
			}
			else{
				arr[i] = arr[i-1] + v2;
			}
		}
		else{
			int v2 = query(i-1,i);
			if(arr[i-1] > arr[i-2]){
				if(v2 == val) arr[i] = arr[i-1]-v2;
				else arr[i] = arr[i-1] + v2;
			}
			else{
				if(v2 == val) arr[i] = arr[i-1]+v2;
				else arr[i] = arr[i-1] - v2;
			}
		}
	}
	/*for(int i=1;i<=n;i++){
		cout<<arr[i]<<" \n"[i==n];
	}*/ 
	int cmin = arr[1];
	for(int i=1;i<=n;i++){
		cmin = min(cmin,arr[i]);
	}
	cmin *= -1;
	int p1 = 0, pn = 0;
	for(int i=1;i<=n;i++){
		arr[i] += cmin+1;
		if(arr[i] == 1) p1 = i;
		if(arr[i] == n) pn = i;
	}
	if(p1 > pn){
		for(int i=1;i<=n;i++) arr[i] = n+1-arr[i];
	}
	/*for(int i=1;i<=n;i++){
		cout<<arr[i]<<" \n"[i==n];
	}*/
	for(int i = 1; i <= N; i++) {
		answer(i, arr[i]);
	}

}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 248 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 248 KB Output is correct
4 Correct 6 ms 248 KB Output is correct
5 Correct 8 ms 376 KB Output is correct
6 Correct 6 ms 376 KB Output is correct
7 Correct 6 ms 248 KB Output is correct
8 Correct 6 ms 380 KB Output is correct
9 Correct 6 ms 248 KB Output is correct
10 Correct 6 ms 248 KB Output is correct
11 Correct 7 ms 376 KB Output is correct
12 Correct 7 ms 248 KB Output is correct
13 Correct 6 ms 248 KB Output is correct
14 Correct 7 ms 248 KB Output is correct
15 Correct 7 ms 376 KB Output is correct

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 248 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 248 KB Output is correct
4 Correct 6 ms 248 KB Output is correct
5 Correct 8 ms 376 KB Output is correct
6 Correct 6 ms 376 KB Output is correct
7 Correct 6 ms 248 KB Output is correct
8 Correct 6 ms 380 KB Output is correct
9 Correct 6 ms 248 KB Output is correct
10 Correct 6 ms 248 KB Output is correct
11 Correct 7 ms 376 KB Output is correct
12 Correct 7 ms 248 KB Output is correct
13 Correct 6 ms 248 KB Output is correct
14 Correct 7 ms 248 KB Output is correct
15 Correct 7 ms 376 KB Output is correct
16 Correct 9 ms 248 KB Output is correct
17 Correct 16 ms 248 KB Output is correct
18 Correct 17 ms 376 KB Output is correct
19 Correct 25 ms 248 KB Output is correct
20 Correct 21 ms 324 KB Output is correct
21 Correct 24 ms 248 KB Output is correct
22 Correct 22 ms 248 KB Output is correct
23 Correct 19 ms 380 KB Output is correct
24 Correct 22 ms 248 KB Output is correct
25 Correct 23 ms 376 KB Output is correct
26 Correct 23 ms 248 KB Output is correct
27 Correct 21 ms 248 KB Output is correct
28 Correct 24 ms 376 KB Output is correct
29 Correct 24 ms 324 KB Output is correct
30 Correct 23 ms 376 KB Output is correct

Subtask #3
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 248 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 5 ms 248 KB Output is correct
4 Correct 6 ms 248 KB Output is correct
5 Correct 8 ms 376 KB Output is correct
6 Correct 6 ms 376 KB Output is correct
7 Correct 6 ms 248 KB Output is correct
8 Correct 6 ms 380 KB Output is correct
9 Correct 6 ms 248 KB Output is correct
10 Correct 6 ms 248 KB Output is correct
11 Correct 7 ms 376 KB Output is correct
12 Correct 7 ms 248 KB Output is correct
13 Correct 6 ms 248 KB Output is correct
14 Correct 7 ms 248 KB Output is correct
15 Correct 7 ms 376 KB Output is correct
16 Correct 9 ms 248 KB Output is correct
17 Correct 16 ms 248 KB Output is correct
18 Correct 17 ms 376 KB Output is correct
19 Correct 25 ms 248 KB Output is correct
20 Correct 21 ms 324 KB Output is correct
21 Correct 24 ms 248 KB Output is correct
22 Correct 22 ms 248 KB Output is correct
23 Correct 19 ms 380 KB Output is correct
24 Correct 22 ms 248 KB Output is correct
25 Correct 23 ms 376 KB Output is correct
26 Correct 23 ms 248 KB Output is correct
27 Correct 21 ms 248 KB Output is correct
28 Correct 24 ms 376 KB Output is correct
29 Correct 24 ms 324 KB Output is correct
30 Correct 23 ms 376 KB Output is correct
31 Correct 44 ms 376 KB Output is correct
32 Correct 56 ms 336 KB Output is correct
33 Correct 80 ms 328 KB Output is correct
34 Correct 52 ms 320 KB Output is correct
35 Correct 81 ms 248 KB Output is correct
36 Correct 97 ms 248 KB Output is correct
37 Correct 94 ms 376 KB Output is correct
38 Correct 91 ms 328 KB Output is correct
39 Correct 82 ms 248 KB Output is correct
40 Correct 87 ms 376 KB Output is correct
41 Correct 65 ms 324 KB Output is correct
42 Correct 89 ms 376 KB Output is correct
43 Correct 82 ms 248 KB Output is correct
44 Correct 97 ms 248 KB Output is correct
45 Correct 91 ms 376 KB Output is correct
46 Correct 89 ms 248 KB Output is correct
47 Correct 90 ms 376 KB Output is correct
48 Correct 83 ms 252 KB Output is correct
49 Correct 111 ms 324 KB Output is correct
50 Correct 106 ms 248 KB Output is correct
51 Correct 76 ms 376 KB Output is correct
52 Correct 77 ms 248 KB Output is correct
53 Correct 78 ms 248 KB Output is correct
54 Correct 80 ms 376 KB Output is correct
55 Correct 90 ms 376 KB Output is correct
56 Correct 88 ms 332 KB Output is correct
57 Correct 81 ms 376 KB Output is correct
58 Correct 90 ms 248 KB Output is correct
59 Correct 95 ms 248 KB Output is correct
60 Correct 93 ms 248 KB Output is correct