제출 #419584

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
419584		Collypso	Xylophone (JOI18_xylophone)	C++17	0 / 100	1 ms	200 KiB

xylophone

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()
#pragma GCC optimize ("O3")
#pragma GCC optimize ("O2")
#define F first
#define S second
//#define endl '\n'
//#define int long long

using namespace std;

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

void solve(int N)
{
	int f = 1, r = N - 1;
	while(f <= r)
    {
        int m = (f + r) / 2;
        if (query(m + 1, N) == N - 1) f = m + 1;
        else r = m - 1;
    }
    vt<int> ans(N + 1), used(N + 1);
    used[1] = ans[f] = 1;
    for(int i = f - 1, q, a, b; i >= 1; i--)
    {
        q = query(i, i + 1), a = ans[i + 1] - q, b = ans[i + 1] + q;
        if (a < 1 || used[a]) used[b] = 1, ans[i] = b;
        else if (b > N || used[b]) used[a] = 1, ans[i] = a;
        else
        {
            int new_q = query(i, i + 2);
            if (ans[i + 2] > ans[i + 1])
            {
                if (new_q == (ans[i + 2] - ans[i + 1])) used[b] = 1, ans[i] = b;
                else used[a] = 1, ans[i] = a;
            }
            else
            {
                if (new_q == (b - ans[i + 2])) used[b] = 1, ans[i] = b;
                else used[a] = 1, ans[i] = a;
            }
        }
    }
    for(int i = f + 1, q, a, b; i <= N; i++)
    {
        q = query(i - 1, i), a = ans[i - 1] - q, b = ans[i - 1] + q;
        if (a < 1 || used[a]) used[b] = 1, ans[i] = b;
        else if (b > N || used[b]) used[a] = 1, ans[i] = a;
        else
        {
            int new_q = query(i - 2, i);
            if (ans[i - 2] > ans[i - 1])
            {
                if (new_q == (ans[i - 2] - ans[i - 1])) used[b] = 1, ans[i] = b;
                else used[a] = 1, ans[i] = a;
            }
            else
            {
                if (new_q == (b - ans[i - 2])) used[b] = 1, ans[i] = b;
                else used[a] = 1, ans[i] = a;
            }
        }
    }
    for(int i = 1; i <= N; i++) answer(i, ans[i]);
    //cout << endl;
}

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