oj.uz

Submission #111333

# Submission time Handle Problem Language Result Execution time Memory
111333 2019-05-14T20:07:33 Z vex Xylophone (JOI18_xylophone) C++14
100 / 100
 107 ms 516 KB 
#include<bits/stdc++.h>
#include<xylophone.h>
using namespace std;
 
int d1[5005];
int d2[5005];
int zn[5005];
int a[5005];
 
void solve(int n)
{
	for(int i=1;i<n;i++)d1[i]=query(i,i+1);
	for(int i=1;i<n-1;i++)d2[i]=query(i,i+2);
	
	zn[1]=1;
	for(int i=2;i<=n-1;i++)
	{
		if(d1[i-1]+d1[i]==d2[i-1])zn[i]=zn[i-1];
		else zn[i]=-zn[i-1];
	}
	
	int tre=0;
	int minv=0;int minn=1;
	int maxv=0;int maxx=1;
	for(int i=2;i<=n;i++)
	{
		tre+=d1[i-1]*zn[i-1];
		if(tre>maxv)
		{
			maxv=tre;
			maxx=i;
		}
		if(tre<minv)
		{
			minv=tre;
			minn=i;
		}
	}
	
	int sgn=1;
	if(minn>maxx)
	{
		sgn=-sgn;
		swap(minn,maxx);
	}
	
	a[minn]=1;
	for(int i=minn+1;i<=n;i++)a[i]=a[i-1]+sgn*d1[i-1]*zn[i-1];
	for(int i=minn-1;i>0;i--)a[i]=a[i+1]-sgn*d1[i]*zn[i];
	
	for(int i=1;i<=n;i++)answer(i,a[i]);
}

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 328 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 4 ms 408 KB Output is correct
5 Correct 3 ms 324 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 4 ms 256 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 256 KB Output is correct
11 Correct 4 ms 256 KB Output is correct
12 Correct 3 ms 256 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 324 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 7 ms 256 KB Output is correct
17 Correct 5 ms 404 KB Output is correct
18 Correct 14 ms 384 KB Output is correct
19 Correct 21 ms 300 KB Output is correct
20 Correct 14 ms 384 KB Output is correct
21 Correct 26 ms 384 KB Output is correct
22 Correct 20 ms 384 KB Output is correct
23 Correct 9 ms 412 KB Output is correct
24 Correct 9 ms 404 KB Output is correct
25 Correct 15 ms 384 KB Output is correct
26 Correct 22 ms 328 KB Output is correct
27 Correct 9 ms 324 KB Output is correct
28 Correct 18 ms 448 KB Output is correct
29 Correct 9 ms 320 KB Output is correct
30 Correct 9 ms 320 KB Output is correct
31 Correct 22 ms 344 KB Output is correct
32 Correct 48 ms 336 KB Output is correct
33 Correct 60 ms 384 KB Output is correct
34 Correct 67 ms 340 KB Output is correct
35 Correct 69 ms 376 KB Output is correct
36 Correct 73 ms 380 KB Output is correct
37 Correct 68 ms 332 KB Output is correct
38 Correct 90 ms 376 KB Output is correct
39 Correct 94 ms 332 KB Output is correct
40 Correct 65 ms 448 KB Output is correct
41 Correct 84 ms 376 KB Output is correct
42 Correct 46 ms 516 KB Output is correct
43 Correct 95 ms 484 KB Output is correct
44 Correct 77 ms 384 KB Output is correct
45 Correct 90 ms 376 KB Output is correct
46 Correct 99 ms 420 KB Output is correct
47 Correct 100 ms 384 KB Output is correct
48 Correct 107 ms 348 KB Output is correct
49 Correct 78 ms 424 KB Output is correct
50 Correct 87 ms 384 KB Output is correct
51 Correct 34 ms 324 KB Output is correct
52 Correct 63 ms 352 KB Output is correct
53 Correct 82 ms 384 KB Output is correct
54 Correct 98 ms 380 KB Output is correct
55 Correct 99 ms 376 KB Output is correct
56 Correct 48 ms 348 KB Output is correct
57 Correct 68 ms 504 KB Output is correct
58 Correct 55 ms 320 KB Output is correct
59 Correct 91 ms 424 KB Output is correct
60 Correct 38 ms 412 KB Output is correct