oj.uz

답안 #134144

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
134144 2019-07-22T06:57:36 Z Boxworld Xylophone (JOI18_xylophone) C++14
100 / 100
 123 ms 504 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
int a[5050][2];
void solve(int N) {
	int tmp0=query(1,2),mk=1;
	a[1][0]=N;a[2][0]=N+tmp0;
	a[1][1]=N;a[2][1]=N-tmp0;
	int Mi1=N,Mi2=N-tmp0;
	for(int i=3;i<=N;i++){
		int tmp1=query(i-1,i),tmp2=query(i-2,i);
		if (tmp0+tmp1!=tmp2)mk*=-1;
		a[i][0]=a[i-1][0]+tmp1*mk;
		if (a[i][0]<Mi1)Mi1=a[i][0];
		a[i][1]=a[i-1][1]-tmp1*mk;
		if (a[i][1]<Mi2)Mi2=a[i][1];
		tmp0=tmp1;
	}
	int alr_N=0,print=0;
	for (int i=1;i<=N;i++){
		a[i][0]-=(Mi1-1);
		if (a[i][0]==N)alr_N=1;
		if (a[i][0]==1&&alr_N==1)print=1;
		a[i][1]-=(Mi2-1);
	}
	for (int i=1;i<=N;i++)answer(i,a[i][print]);
}

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 3 ms 316 KB Output is correct
6 Correct 3 ms 252 KB Output is correct
7 Correct 3 ms 312 KB Output is correct
8 Correct 3 ms 316 KB Output is correct
9 Correct 3 ms 252 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 4 ms 248 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 248 KB Output is correct
15 Correct 5 ms 404 KB Output is correct
16 Correct 7 ms 252 KB Output is correct
17 Correct 13 ms 248 KB Output is correct
18 Correct 22 ms 376 KB Output is correct
19 Correct 24 ms 376 KB Output is correct
20 Correct 23 ms 376 KB Output is correct
21 Correct 12 ms 400 KB Output is correct
22 Correct 13 ms 396 KB Output is correct
23 Correct 28 ms 252 KB Output is correct
24 Correct 26 ms 376 KB Output is correct
25 Correct 23 ms 376 KB Output is correct
26 Correct 21 ms 248 KB Output is correct
27 Correct 22 ms 320 KB Output is correct
28 Correct 26 ms 248 KB Output is correct
29 Correct 24 ms 376 KB Output is correct
30 Correct 24 ms 316 KB Output is correct
31 Correct 42 ms 376 KB Output is correct
32 Correct 59 ms 376 KB Output is correct
33 Correct 97 ms 248 KB Output is correct
34 Correct 117 ms 248 KB Output is correct
35 Correct 106 ms 388 KB Output is correct
36 Correct 103 ms 344 KB Output is correct
37 Correct 83 ms 316 KB Output is correct
38 Correct 80 ms 448 KB Output is correct
39 Correct 75 ms 472 KB Output is correct
40 Correct 112 ms 248 KB Output is correct
41 Correct 114 ms 504 KB Output is correct
42 Correct 70 ms 324 KB Output is correct
43 Correct 92 ms 332 KB Output is correct
44 Correct 123 ms 320 KB Output is correct
45 Correct 114 ms 376 KB Output is correct
46 Correct 74 ms 412 KB Output is correct
47 Correct 59 ms 316 KB Output is correct
48 Correct 62 ms 376 KB Output is correct
49 Correct 85 ms 436 KB Output is correct
50 Correct 68 ms 424 KB Output is correct
51 Correct 120 ms 340 KB Output is correct
52 Correct 103 ms 376 KB Output is correct
53 Correct 83 ms 444 KB Output is correct
54 Correct 99 ms 332 KB Output is correct
55 Correct 92 ms 336 KB Output is correct
56 Correct 108 ms 376 KB Output is correct
57 Correct 107 ms 248 KB Output is correct
58 Correct 74 ms 400 KB Output is correct
59 Correct 114 ms 424 KB Output is correct
60 Correct 104 ms 332 KB Output is correct