oj.uz

Submission #363261

# Submission time Handle Problem Language Result Execution time Memory
363261 2021-02-05T11:53:36 Z r57shell Xylophone (JOI18_xylophone) C++14
100 / 100
 122 ms 624 KB 
#include "xylophone.h"
#include <algorithm>

using namespace std;

static const int MAXN = 5000;
static int C[MAXN];

void solve(int N)
{
	if (N == 2)
	{
		answer(1, 1);
		answer(2, 2);
		return;
	}
	C[0] = 0;
	C[1] = query(1, 2);
	for (int i = 2; i < N; ++i)
	{
		int w = query(i, i+1);
		int w1 = query(i-1, i+1);
		int x = C[i-1] + w;
		int lmin = C[i-1];
		int lmax = C[i-2];
		if (lmin > lmax)
			swap(lmin, lmax);
		//printf("%d(%d?)",w,x);
		if (max(x, lmax) - min(x, lmin) == w1)
		{
		}
		else
		{
			x = C[i-1] - w;
			//printf("(%d?)",x);
			//if (max(x, lmax) - min(x, lmin) == w1)
			//{
			//}
			//else
				//printf("wut");
		}
		//printf("\n");
		C[i] = x;
	}
	pair<int,int> m1(int(1e9),0);
	pair<int,int> m2(int(-1e9),0);
	for (int i = 0; i < N; ++i)
	{
		m1 = min(m1, pair<int,int>(C[i], i));
		m2 = max(m2, pair<int,int>(C[i], i));
	}
	if (m1.second < m2.second)
	{
		//for (int i = 0; i < N; ++i)
		//	printf("%d ", C[i]-m1.first+1);
		for (int i = 0; i < N; ++i)
			answer(i+1, C[i]-m1.first+1);
	}
	else
	{
		//for (int i = 0; i < N; ++i)
		//	printf("%d ", m2.first-C[i]+1);
		for (int i = 0; i < N; ++i)
			answer(i+1, m2.first-C[i]+1);
	}
}

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 3 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 6 ms 256 KB Output is correct
17 Correct 8 ms 256 KB Output is correct
18 Correct 15 ms 364 KB Output is correct
19 Correct 18 ms 364 KB Output is correct
20 Correct 17 ms 364 KB Output is correct
21 Correct 16 ms 364 KB Output is correct
22 Correct 18 ms 364 KB Output is correct
23 Correct 10 ms 364 KB Output is correct
24 Correct 20 ms 364 KB Output is correct
25 Correct 22 ms 364 KB Output is correct
26 Correct 20 ms 364 KB Output is correct
27 Correct 23 ms 364 KB Output is correct
28 Correct 25 ms 364 KB Output is correct
29 Correct 15 ms 364 KB Output is correct
30 Correct 25 ms 364 KB Output is correct
31 Correct 54 ms 368 KB Output is correct
32 Correct 40 ms 364 KB Output is correct
33 Correct 104 ms 364 KB Output is correct
34 Correct 66 ms 620 KB Output is correct
35 Correct 51 ms 364 KB Output is correct
36 Correct 122 ms 492 KB Output is correct
37 Correct 119 ms 364 KB Output is correct
38 Correct 93 ms 368 KB Output is correct
39 Correct 111 ms 492 KB Output is correct
40 Correct 74 ms 364 KB Output is correct
41 Correct 97 ms 492 KB Output is correct
42 Correct 54 ms 368 KB Output is correct
43 Correct 101 ms 364 KB Output is correct
44 Correct 88 ms 364 KB Output is correct
45 Correct 114 ms 364 KB Output is correct
46 Correct 89 ms 364 KB Output is correct
47 Correct 98 ms 372 KB Output is correct
48 Correct 92 ms 364 KB Output is correct
49 Correct 104 ms 492 KB Output is correct
50 Correct 90 ms 624 KB Output is correct
51 Correct 98 ms 364 KB Output is correct
52 Correct 88 ms 492 KB Output is correct
53 Correct 86 ms 364 KB Output is correct
54 Correct 114 ms 364 KB Output is correct
55 Correct 77 ms 504 KB Output is correct
56 Correct 74 ms 364 KB Output is correct
57 Correct 87 ms 364 KB Output is correct
58 Correct 120 ms 364 KB Output is correct
59 Correct 96 ms 500 KB Output is correct
60 Correct 115 ms 364 KB Output is correct