oj.uz

Submission #348147

# Submission time Handle Problem Language Result Execution time Memory
348147 2021-01-14T09:57:30 Z mariowong Xylophone (JOI18_xylophone) C++14
100 / 100
 396 ms 620 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;

int dif1[5005],dif2[5005],b[5005],pos1,posn;
pair <int,int> a[5005];
bool vis[5005];
void solve(int N) {
	for (int i=2;i<=N;i++){
		dif1[i]=query(i-1,i); 
	}
	for (int i=3;i<=N;i++){
		dif2[i]=query(i-2,i); 
	}
	a[2].first=0;
	a[2].second=1;
	for (int i=3;i<=N;i++){
		if (dif1[i]+dif1[i-1] == dif2[i])
		a[i]=a[i-1];
		else
		{
			a[i].first=a[i-1].second;
			a[i].second=a[i-1].first;
		}
	}
	for (int i=1;i<=N;i++){
		b[1]=i;
		for (int j=1;j<=N;j++){
			vis[j]=false;
		}
		for (int j=2;j<=N;j++){
			if (a[j].first == 1)
			b[j]=b[j-1]+dif1[j];
			else
			b[j]=b[j-1]-dif1[j];
		}
		for (int j=1;j<=N;j++){
			if (b[j] == 1)
			pos1=j;
			if (b[j] == N)
			posn=j;
			if (b[j] < 1 || b[j] > N)
			break;
			if (vis[b[j]])
			break;
			vis[b[j]]=true;
			if (j == N && pos1 < posn)
			goto out;
		}
		
		for (int j=1;j<=N;j++){
			vis[j]=false;
		}
		b[1]=i;
		for (int j=2;j<=N;j++){
			if (a[j].second == 1)
			b[j]=b[j-1]+dif1[j];
			else
			b[j]=b[j-1]-dif1[j];
		}
		for (int j=1;j<=N;j++){
			if (b[j] == 1)
			pos1=j;
			if (b[j] == N)
			posn=j;
			if (b[j] < 1 || b[j] > N)
			break;
			if (vis[b[j]])
			break;
			vis[b[j]]=true;
			if (j == N && pos1 < posn)
			goto out;
		}
	}
	out:;
	for(int i = 1; i <= N; i++) {
		answer(i, b[i]);
	}
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 3 ms 364 KB Output is correct
12 Correct 2 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 3 ms 492 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 3 ms 364 KB Output is correct
12 Correct 2 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 3 ms 492 KB Output is correct
16 Correct 5 ms 364 KB Output is correct
17 Correct 10 ms 364 KB Output is correct
18 Correct 15 ms 364 KB Output is correct
19 Correct 20 ms 364 KB Output is correct
20 Correct 19 ms 364 KB Output is correct
21 Correct 23 ms 364 KB Output is correct
22 Correct 18 ms 364 KB Output is correct
23 Correct 20 ms 364 KB Output is correct
24 Correct 19 ms 364 KB Output is correct
25 Correct 20 ms 364 KB Output is correct
26 Correct 23 ms 364 KB Output is correct
27 Correct 20 ms 364 KB Output is correct
28 Correct 19 ms 364 KB Output is correct
29 Correct 21 ms 492 KB Output is correct
30 Correct 20 ms 364 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 3 ms 364 KB Output is correct
12 Correct 2 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 3 ms 492 KB Output is correct
16 Correct 5 ms 364 KB Output is correct
17 Correct 10 ms 364 KB Output is correct
18 Correct 15 ms 364 KB Output is correct
19 Correct 20 ms 364 KB Output is correct
20 Correct 19 ms 364 KB Output is correct
21 Correct 23 ms 364 KB Output is correct
22 Correct 18 ms 364 KB Output is correct
23 Correct 20 ms 364 KB Output is correct
24 Correct 19 ms 364 KB Output is correct
25 Correct 20 ms 364 KB Output is correct
26 Correct 23 ms 364 KB Output is correct
27 Correct 20 ms 364 KB Output is correct
28 Correct 19 ms 364 KB Output is correct
29 Correct 21 ms 492 KB Output is correct
30 Correct 20 ms 364 KB Output is correct
31 Correct 46 ms 364 KB Output is correct
32 Correct 104 ms 492 KB Output is correct
33 Correct 123 ms 492 KB Output is correct
34 Correct 156 ms 492 KB Output is correct
35 Correct 177 ms 420 KB Output is correct
36 Correct 96 ms 492 KB Output is correct
37 Correct 190 ms 492 KB Output is correct
38 Correct 89 ms 620 KB Output is correct
39 Correct 131 ms 492 KB Output is correct
40 Correct 164 ms 400 KB Output is correct
41 Correct 192 ms 536 KB Output is correct
42 Correct 83 ms 492 KB Output is correct
43 Correct 172 ms 620 KB Output is correct
44 Correct 81 ms 492 KB Output is correct
45 Correct 137 ms 384 KB Output is correct
46 Correct 174 ms 512 KB Output is correct
47 Correct 186 ms 492 KB Output is correct
48 Correct 115 ms 492 KB Output is correct
49 Correct 205 ms 420 KB Output is correct
50 Correct 176 ms 492 KB Output is correct
51 Correct 125 ms 492 KB Output is correct
52 Correct 107 ms 492 KB Output is correct
53 Correct 211 ms 492 KB Output is correct
54 Correct 174 ms 492 KB Output is correct
55 Correct 365 ms 364 KB Output is correct
56 Correct 396 ms 492 KB Output is correct
57 Correct 186 ms 400 KB Output is correct
58 Correct 229 ms 492 KB Output is correct
59 Correct 191 ms 492 KB Output is correct
60 Correct 152 ms 420 KB Output is correct