oj.uz

Submission #419527

# Submission time Handle Problem Language Result Execution time Memory
419527 2021-06-07T08:34:01 Z KalasLavas Xylophone (JOI18_xylophone) C++14
100 / 100
 95 ms 428 KB 
#include <bits/stdc++.h>
#include "xylophone.h"
using namespace std;

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//#undef LOCALKL
#define IO \
ios_base::sync_with_stdio(0);(cin).tie(0);(cout).tie(0)
#define y1 y1_
#define prev prev_
#define all(a) (a).begin(),(a).end()
#define pb push_back
#define eb emplace_back
#define F first
#define S second
#ifdef LOCALKL
// #define cerr cerr<<"\33[1;32m"
// #define cout cout<<"\33[0m"
#else
#ifndef OO
#define endl '\n'
#define cerr if(1){}else cerr
#endif
#endif
#define OK cout<<"OK\n"<<endl;
#define setpre(k) fixed<<setprecision(k)
#define mmset(k,y) memset(k,y,sizeof(k))
#define sz(x) ((int)(x).size())
using pii = pair<int,int>;
using pll = pair<long long,long long>;
using ull = unsigned long long;
using intt = long long;
using ll = long long;
using ld = long double;

const ll m9 = 998244353;
const ll m7 = 1000000007;
const ll m18 = 1000000000000000000;
const ll i127 = 2193062143;
const ll l127 = 9187201950435737471;


int n, a[5005], x, s[3];
bool used[5005];
void solve(int N)
{
	n=N;

	int l=1, r=n, mid;
	while(l<r)
	{
		mid=(l+r)>>1;
		if(query(mid, n)!=n-1) r=mid;
		else l=mid+1;
	}
	a[--l] = 1;
	used[1]=1;

	// cerr<<l<<endl;

	x = query(l,l+1) + 1;
	a[l+1] = x;
	used[x]=1;

	// cerr<<" > "<<x<<endl;

	if(l!=1)
	{
		x = query(l-1,l) + 1;
		a[l-1] = x;
		used[x]=1;
		// cerr<<" < "<<x<<endl;
	}
	for(int i=l+2;i<=n;i++)
	{
		x=query(i-1,i);
		// cerr<<x;
		if(a[i-1]-x<=0 or used[a[i-1]-x]) // +
		{
			x=a[i-1]+x;
			a[i] = x;
			used[x]=1;
		}
		else if(n<a[i-1]+x or used[a[i-1]+x])
		{
			x=a[i-1]-x;
			a[i] = x;
			used[x]=1;
		}
		else
		{
			int y = query(i-2, i);
			// cerr<<' '<<y<<endl;
			s[0]=a[i-2];
			s[1]=a[i-1];
			s[2]=a[i-1]+x;
			// cerr<<*max_element(s,s+3)<<" - "<<*min_element(s,s+3)<<endl;
			if(*max_element(s,s+3)-*min_element(s,s+3)==y)
			{
				x=a[i-1]+x;
				a[i] = x;
				used[x]=1;
			}
			else
			{
				x=a[i-1]-x;
				a[i] = x;
				used[x]=1;
			}
		}
		// cerr<<endl;
	}
	
	for(int i=l-2;i>=1;i--)
	{
		x=query(i,i+1);
		// cerr<<x;
		if(a[i+1]-x<=0 or used[a[i+1]-x]) // +
		{
			x=a[i+1]+x;
			a[i] = x;
			used[x]=1;
		}
		else if(n<a[i+1]+x or used[a[i+1]+x])
		{
			x=a[i+1]-x;
			a[i] = x;
			used[x]=1;
		}
		else
		{
			int y = query(i, i+2);
			// cerr<<' '<<y<<endl;
			s[0]=a[i+2];
			s[1]=a[i+1];
			s[2]=a[i+1]+x;
			// cerr<<*max_element(s,s+3)<<" - "<<*min_element(s,s+3)<<endl;
			if(*max_element(s,s+3)-*min_element(s,s+3)==y)
			{
				x=a[i+1]+x;
				a[i] = x;
				used[x]=1;
			}
			else
			{
				x=a[i+1]-x;
				a[i] = x;
				used[x]=1;
			}
		}
		// cerr<<endl;
	}
	// for(int i=1;i<=n;i++) cerr<<a[i]<<',';cerr<<endl;
	for(int i=1;i<=n;i++) answer(i, a[i]);
}
/*
5
2 1 5 3 4

10
1 9 8 7 10 6 5 4 3 2
*/

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 2 ms 200 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 2 ms 200 KB Output is correct
7 Correct 2 ms 200 KB Output is correct
8 Correct 2 ms 200 KB Output is correct
9 Correct 3 ms 300 KB Output is correct
10 Correct 2 ms 200 KB Output is correct
11 Correct 2 ms 304 KB Output is correct
12 Correct 3 ms 200 KB Output is correct
13 Correct 2 ms 200 KB Output is correct
14 Correct 3 ms 200 KB Output is correct
15 Correct 2 ms 200 KB Output is correct
16 Correct 3 ms 200 KB Output is correct
17 Correct 8 ms 200 KB Output is correct
18 Correct 13 ms 304 KB Output is correct
19 Correct 15 ms 200 KB Output is correct
20 Correct 14 ms 292 KB Output is correct
21 Correct 11 ms 200 KB Output is correct
22 Correct 13 ms 304 KB Output is correct
23 Correct 10 ms 200 KB Output is correct
24 Correct 5 ms 336 KB Output is correct
25 Correct 13 ms 288 KB Output is correct
26 Correct 14 ms 200 KB Output is correct
27 Correct 16 ms 200 KB Output is correct
28 Correct 15 ms 200 KB Output is correct
29 Correct 11 ms 324 KB Output is correct
30 Correct 12 ms 200 KB Output is correct
31 Correct 29 ms 292 KB Output is correct
32 Correct 25 ms 308 KB Output is correct
33 Correct 71 ms 300 KB Output is correct
34 Correct 95 ms 300 KB Output is correct
35 Correct 73 ms 304 KB Output is correct
36 Correct 46 ms 292 KB Output is correct
37 Correct 57 ms 308 KB Output is correct
38 Correct 45 ms 304 KB Output is correct
39 Correct 76 ms 340 KB Output is correct
40 Correct 56 ms 300 KB Output is correct
41 Correct 58 ms 304 KB Output is correct
42 Correct 47 ms 296 KB Output is correct
43 Correct 61 ms 320 KB Output is correct
44 Correct 61 ms 312 KB Output is correct
45 Correct 38 ms 320 KB Output is correct
46 Correct 66 ms 312 KB Output is correct
47 Correct 93 ms 292 KB Output is correct
48 Correct 77 ms 328 KB Output is correct
49 Correct 55 ms 428 KB Output is correct
50 Correct 60 ms 320 KB Output is correct
51 Correct 77 ms 304 KB Output is correct
52 Correct 74 ms 316 KB Output is correct
53 Correct 60 ms 324 KB Output is correct
54 Correct 77 ms 304 KB Output is correct
55 Correct 66 ms 320 KB Output is correct
56 Correct 60 ms 304 KB Output is correct
57 Correct 77 ms 300 KB Output is correct
58 Correct 79 ms 292 KB Output is correct
59 Correct 42 ms 424 KB Output is correct
60 Correct 72 ms 300 KB Output is correct