oj.uz

Submission #200184

# Submission time Handle Problem Language Result Execution time Memory
200184 2020-02-05T15:46:46 Z nsn Xylophone (JOI18_xylophone) C++14
100 / 100
 107 ms 632 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
int r[5005], g, pr[5005];
vector <int> mp;
int maxm, minm, maxn = 0, minn = 0;
int n[5005];
void solve(int N) 
{
	for(int i = 1; i < N; i++) 
	{
		pr[i] = query(i, i+1);
	}
	for(int i = 1; i < N-1; i++) 
	{
		r[i] = query(i, i+2);
		if(r[i] == pr[i] || r[i] == pr[i+1])
		{
			mp.push_back(i+1);
		}
	}
	mp.push_back(N);
	int tv = 0;
	int x = 0, tx = 0;
	for(int i = 1; i < N; i++)
	{
		if(i == mp[tx])
		{
			tx++;
		}
		if(tx % 2 == 0)
		{
			tv += pr[i]; 
		}
		else
		{
			tv -= pr[i];
		}
		if(maxn < tv)
		{
			maxn = tv;
			maxm = i+1;
		}
		if(minn > tv)
		{
			minn = tv;
			minm = i+1;
		}
	}
	if(minm > maxm)
	{
		x = 1;
		swap(maxm, minm);
	}
	tx = 0;
	int tp = 0;
	for(int i = 1; i < N; i++)
	{
		if(i == mp[tx])
		{
			tx++;
		}
		if(tx % 2 != x)
		{
			pr[i] = -pr[i];
		}
	}
	n[minm] = 1;
	for(int i = minm-1; i >= 1; i--)
	{
		n[i] = n[i+1] - pr[i];
	}
	for(int i = minm+1; i <= N; i++)
	{
		n[i] = n[i-1] + pr[i-1];
	}
	for(int i = 1; i <= N; i++)
	{
		answer(i, n[i]);
	}
}

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:56:6: warning: unused variable 'tp' [-Wunused-variable]
  int tp = 0;
      ^~

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 248 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 7 ms 248 KB Output is correct
5 Correct 6 ms 252 KB Output is correct
6 Correct 8 ms 376 KB Output is correct
7 Correct 7 ms 248 KB Output is correct
8 Correct 7 ms 248 KB Output is correct
9 Correct 7 ms 248 KB Output is correct
10 Correct 7 ms 248 KB Output is correct
11 Correct 6 ms 248 KB Output is correct
12 Correct 7 ms 376 KB Output is correct
13 Correct 6 ms 248 KB Output is correct
14 Correct 7 ms 248 KB Output is correct
15 Correct 8 ms 376 KB Output is correct
16 Correct 9 ms 376 KB Output is correct
17 Correct 16 ms 248 KB Output is correct
18 Correct 16 ms 248 KB Output is correct
19 Correct 24 ms 252 KB Output is correct
20 Correct 26 ms 376 KB Output is correct
21 Correct 25 ms 376 KB Output is correct
22 Correct 14 ms 328 KB Output is correct
23 Correct 25 ms 328 KB Output is correct
24 Correct 20 ms 376 KB Output is correct
25 Correct 25 ms 340 KB Output is correct
26 Correct 20 ms 248 KB Output is correct
27 Correct 28 ms 376 KB Output is correct
28 Correct 23 ms 248 KB Output is correct
29 Correct 22 ms 376 KB Output is correct
30 Correct 23 ms 248 KB Output is correct
31 Correct 41 ms 376 KB Output is correct
32 Correct 62 ms 332 KB Output is correct
33 Correct 84 ms 504 KB Output is correct
34 Correct 85 ms 504 KB Output is correct
35 Correct 89 ms 376 KB Output is correct
36 Correct 91 ms 376 KB Output is correct
37 Correct 90 ms 376 KB Output is correct
38 Correct 92 ms 504 KB Output is correct
39 Correct 94 ms 376 KB Output is correct
40 Correct 85 ms 632 KB Output is correct
41 Correct 94 ms 332 KB Output is correct
42 Correct 90 ms 376 KB Output is correct
43 Correct 91 ms 504 KB Output is correct
44 Correct 103 ms 376 KB Output is correct
45 Correct 81 ms 508 KB Output is correct
46 Correct 89 ms 452 KB Output is correct
47 Correct 86 ms 516 KB Output is correct
48 Correct 88 ms 376 KB Output is correct
49 Correct 94 ms 504 KB Output is correct
50 Correct 93 ms 384 KB Output is correct
51 Correct 93 ms 376 KB Output is correct
52 Correct 89 ms 428 KB Output is correct
53 Correct 85 ms 376 KB Output is correct
54 Correct 87 ms 376 KB Output is correct
55 Correct 83 ms 428 KB Output is correct
56 Correct 103 ms 320 KB Output is correct
57 Correct 83 ms 376 KB Output is correct
58 Correct 107 ms 332 KB Output is correct
59 Correct 98 ms 428 KB Output is correct
60 Correct 90 ms 504 KB Output is correct