oj.uz

Submission #549887

# Submission time Handle Problem Language Result Execution time Memory
549887 2022-04-16T18:45:53 Z Hanksburger Xylophone (JOI18_xylophone) C++17
100 / 100
 97 ms 416 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
int a[5005];
void solve(int n)
{
	a[2]=query(1, 2);
	for (int i=3; i<=n; i++)
	{
		int res1=query(i-1, i), res2=query(i-2, i);
		if (res1==res2)
		{
			if (a[i-2]<a[i-1])
				a[i]=a[i-1]-res1;
			else
				a[i]=a[i-1]+res1;
		}
		else
		{
			if (a[i-2]<a[i-1])
			{
				if (res2==a[i-1]-a[i-2])
					a[i]=a[i-1]-res1;
				else
					a[i]=a[i-1]+res1;
			}
			else
			{
				if (res2==a[i-2]-a[i-1])
					a[i]=a[i-1]+res1;
				else
					a[i]=a[i-1]-res1;
			}
		}
	}
	int maxi=0, pos1, posn;
	for (int i=1; i<=n; i++)
		maxi=max(maxi, a[i]);
	for (int i=1; i<=n; i++)
		a[i]+=n-maxi;
	for (int i=1; i<=n; i++)
	{
		if (a[i]==1)
			pos1=i;
		else if (a[i]==n)
			posn=i;
	}
	if (pos1>posn)
		for (int i=1; i<=n; i++)
			a[i]=n-a[i]+1;
	for (int i=1; i<=n; i++)
		answer(i, a[i]);
}

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:48:2: warning: 'posn' may be used uninitialized in this function [-Wmaybe-uninitialized]
   48 |  if (pos1>posn)
      |  ^~
xylophone.cpp:48:2: warning: 'pos1' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 2 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 3 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 3 ms 208 KB Output is correct
8 Correct 3 ms 208 KB Output is correct
9 Correct 2 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 4 ms 208 KB Output is correct
17 Correct 10 ms 208 KB Output is correct
18 Correct 12 ms 300 KB Output is correct
19 Correct 13 ms 292 KB Output is correct
20 Correct 19 ms 208 KB Output is correct
21 Correct 17 ms 208 KB Output is correct
22 Correct 17 ms 208 KB Output is correct
23 Correct 15 ms 208 KB Output is correct
24 Correct 16 ms 300 KB Output is correct
25 Correct 13 ms 296 KB Output is correct
26 Correct 15 ms 208 KB Output is correct
27 Correct 17 ms 308 KB Output is correct
28 Correct 16 ms 304 KB Output is correct
29 Correct 11 ms 208 KB Output is correct
30 Correct 14 ms 300 KB Output is correct
31 Correct 42 ms 416 KB Output is correct
32 Correct 55 ms 300 KB Output is correct
33 Correct 68 ms 292 KB Output is correct
34 Correct 81 ms 296 KB Output is correct
35 Correct 57 ms 320 KB Output is correct
36 Correct 76 ms 416 KB Output is correct
37 Correct 90 ms 300 KB Output is correct
38 Correct 81 ms 304 KB Output is correct
39 Correct 81 ms 328 KB Output is correct
40 Correct 65 ms 296 KB Output is correct
41 Correct 86 ms 308 KB Output is correct
42 Correct 73 ms 300 KB Output is correct
43 Correct 87 ms 300 KB Output is correct
44 Correct 91 ms 412 KB Output is correct
45 Correct 84 ms 300 KB Output is correct
46 Correct 79 ms 284 KB Output is correct
47 Correct 63 ms 292 KB Output is correct
48 Correct 70 ms 296 KB Output is correct
49 Correct 52 ms 300 KB Output is correct
50 Correct 83 ms 296 KB Output is correct
51 Correct 70 ms 292 KB Output is correct
52 Correct 70 ms 300 KB Output is correct
53 Correct 97 ms 296 KB Output is correct
54 Correct 79 ms 296 KB Output is correct
55 Correct 73 ms 312 KB Output is correct
56 Correct 85 ms 284 KB Output is correct
57 Correct 88 ms 292 KB Output is correct
58 Correct 74 ms 296 KB Output is correct
59 Correct 77 ms 296 KB Output is correct
60 Correct 82 ms 312 KB Output is correct