oj.uz

Submission #896144

# Submission time Handle Problem Language Result Execution time Memory
896144 2023-12-31T22:16:46 Z starchan Xylophone (JOI18_xylophone) C++17
100 / 100
 65 ms 740 KB 
#include "xylophone.h"
#include<bits/stdc++.h>
using namespace std;
#define in pair<int, int>
#define f first
#define s second
#define pb push_back
#define pob pop_back
#define INF (int)1e17
#define MX (int)3e5+5
#define fast() ios_base::sync_with_stdio(false); cin.tie(NULL)
void solve(int n)
{
	if(n == 2)
	{
		answer(1, 1);
		answer(2, 2);
		return;
	}
	vector<int> d(n+1);
	vector<int> d2(n+1);
	vector<int> a(n+1);
	for(int i = 2; i <= n; i++)
		d[i] = query(i-1, i);
	for(int i = 3; i <= n; i++)
		d2[i] = query(i-2, i);
	a[1] = 0;
	a[2] = d[2];
	for(int i = 3; i <= n; i++)
	{
		if(d2[i] == (d[i]+d[i-1]))
		{
			if(a[i-2] > a[i-1])
				a[i] = a[i-1]-d[i];
			else
				a[i] = a[i-1]+d[i];
		}
		else
		{
			if(a[i-2] > a[i-1])
				a[i] = a[i-1]+d[i];
			else
				a[i] = a[i-1]-d[i];
		}
	}
	in ok_min = {INF, -1};
	in ok_max = {-INF, -1};
	for(int i = 1; i <= n; i++)
		ok_min = min(ok_min, {a[i], i});
	for(int i = 1; i <= n; i++)
		ok_max = max(ok_max, {a[i], i});
	int delta = 1-ok_min.f;
	for(int i = 1; i <= n; i++)
		a[i]+=delta;
	if(ok_min.s > ok_max.s)
	{
		for(int i = 1; i <= n; i++)
			a[i] = n+1-a[i];
	}
	for(int i = 1; i <= n; i++)
		answer(i, a[i]);
	return;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 2 ms 356 KB Output is correct
17 Correct 4 ms 440 KB Output is correct
18 Correct 7 ms 344 KB Output is correct
19 Correct 11 ms 444 KB Output is correct
20 Correct 10 ms 444 KB Output is correct
21 Correct 8 ms 448 KB Output is correct
22 Correct 9 ms 444 KB Output is correct
23 Correct 8 ms 448 KB Output is correct
24 Correct 8 ms 448 KB Output is correct
25 Correct 11 ms 440 KB Output is correct
26 Correct 8 ms 452 KB Output is correct
27 Correct 9 ms 344 KB Output is correct
28 Correct 11 ms 436 KB Output is correct
29 Correct 8 ms 344 KB Output is correct
30 Correct 9 ms 444 KB Output is correct
31 Correct 18 ms 448 KB Output is correct
32 Correct 28 ms 464 KB Output is correct
33 Correct 40 ms 468 KB Output is correct
34 Correct 56 ms 484 KB Output is correct
35 Correct 44 ms 468 KB Output is correct
36 Correct 44 ms 488 KB Output is correct
37 Correct 53 ms 472 KB Output is correct
38 Correct 46 ms 476 KB Output is correct
39 Correct 41 ms 492 KB Output is correct
40 Correct 45 ms 476 KB Output is correct
41 Correct 65 ms 468 KB Output is correct
42 Correct 41 ms 472 KB Output is correct
43 Correct 45 ms 488 KB Output is correct
44 Correct 44 ms 492 KB Output is correct
45 Correct 43 ms 476 KB Output is correct
46 Correct 50 ms 472 KB Output is correct
47 Correct 48 ms 468 KB Output is correct
48 Correct 42 ms 476 KB Output is correct
49 Correct 45 ms 488 KB Output is correct
50 Correct 41 ms 468 KB Output is correct
51 Correct 43 ms 472 KB Output is correct
52 Correct 45 ms 740 KB Output is correct
53 Correct 40 ms 472 KB Output is correct
54 Correct 43 ms 484 KB Output is correct
55 Correct 44 ms 484 KB Output is correct
56 Correct 51 ms 488 KB Output is correct
57 Correct 47 ms 472 KB Output is correct
58 Correct 44 ms 472 KB Output is correct
59 Correct 49 ms 488 KB Output is correct
60 Correct 46 ms 476 KB Output is correct