제출 #1137029

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1137029		pan	Xylophone (JOI18_xylophone)	C++20	100 / 100	18 ms	660 KiB

xylophone

#include <bits/stdc++.h>
//#include "includeall.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define all(x) x.begin(), x.end()
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define FOR(i, x, n) for (ll i =x; i<=n; ++i) 
#define RFOR(i, x, n) for (ll i =x; i>=n; --i) 
#pragma GCC optimize("O3","unroll-loops")
using namespace std;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<pi, ll> pii;
typedef pair<pi, pi> piii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int query(int s, int t);
void answer(int i, int a);

ll ans[5005];

void solve(int N)
{
	ll n = N;
	ll lo = 1, hi = N;
	while (lo!=hi)
	{
		ll mid = (lo + hi + 1) >> 1;
		if (query(mid, N) == n-1) lo = mid;
		else hi = mid-1;
	}
	fill(ans, ans + n + 1, -1);
	ans[lo] = 1;
	unordered_set<ll> found;
	for (ll i=lo + 1; i <=n ;++i)
	{
		ll x = query(i-1, i);
		if (ans[i-1] - x <= 0 || found.find(ans[i-1]-x)!=found.end()) ans[i] = ans[i-1] + x;
		else if (ans[i - 1] + x > n || found.find(ans[i-1]+x)!=found.end()) ans[i] = ans[i-1] - x;
		else
		{
			ll y = query(i-2, i);
			if (ans[i-1] > ans[i-2]) // does it lower?
			{
				if (y == x + ans[i-1] - ans[i-2]) ans[i] = x + ans[i-1];
				else ans[i] = ans[i-1] - x;
			}
			else
			{
				if (y == x + ans[i-2] - ans[i-1]) ans[i] =   ans[i-1] - x;
				else ans[i] = x + ans[i-1];
			}
		}
		found.insert(ans[i]);
	}
	for (ll i=lo-1; i>=1; --i)
	{
		ll x = query(i, i+1);
		if (ans[i + 1] - x <= 0 || found.find(ans[i+1]-x)!=found.end()) ans[i] = ans[i+1] + x;
		else if (ans[i + 1] + x > n || found.find(ans[i+1]+x)!=found.end()) ans[i] = ans[i+1] - x;
		else
		{
			ll y = query(i, i + 2);
			if (ans[i+1] > ans[i+2]) // does it lower?
			{
				if (y == x + ans[i+1] - ans[i+2]) ans[i] = x + ans[i+1];
				else ans[i] = ans[i+1] - x; 
			}
			else
			{
				if (y == x + ans[i+2] - ans[i + 1]) ans[i] =   ans[i+1] - x;
				else ans[i] = x + ans[i+1];
			}
		}
		found.insert(ans[i]);
	}
	//for (ll i=1; i<=n; ++i) { show(ans[i]);}
	for (ll i=1; i<=n; ++i) { answer(i, ans[i]);}
	
}

• Subtask 1: 11 / 11
• Subtask 2: 36 / 36
• Subtask 3: 53 / 53