제출 #894554

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
894554		lunaTu	Xylophone (JOI18_xylophone)	C++17	47 / 100	39 ms	344 KiB

xylophone

#include <bits/stdc++.h>
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#include "xylophone.h"
typedef long long ll;
using namespace std;


void solve(int N) {

    vector<int> a(N + 1);

    int l = 1, r = N + 1;
    while (r - l > 1) {
        int m = (l + r) / 2;

        int get = 0;
        if (m < N) get = query(m, N);

        if (get != N - 1) r = m;
        else l = m;
    }

    answer(l, 1);
    a[l] = 1;
    if (l != N) {
        a[l + 1] = 1 + query(l, l + 1);
        answer(l + 1, a[l + 1]);
    }

    for (int i = l + 2; i <= N; i++) {
        int x = query(i - 2, i), y = query(i - 1, i);

        if (a[i - 1] < a[i - 2]) {
            if (x == a[i - 2] - a[i - 1]) a[i] = a[i - 1] + y;
            else {
                if (y == x) a[i] = a[i - 1] + x;
                else a[i] = a[i - 2] - x;
            }
        }
        else {
            if (x == a[i - 1] - a[i - 2]) a[i] = a[i - 1] - y;
            else {
                if (y == x) a[i] = a[i - 1] - x;
                else a[i] = a[i - 2] + x;
            }
        }
        answer(i, a[i]);
    }

    if (l != 1) {
        a[l - 1] = 1 + query(l - 1, l);
        answer(l - 1, a[l - 1]);
    }

    for (int i = l - 2; i >= 1; i--) {
        int x = query(i, i + 2), y = query(i, i + 1);

        if (a[i + 1] < a[i + 2]) {
            if (x == a[i + 2] - a[i + 1]) a[i] = a[i + 1] + y;
            else {
                if (y == x) a[i] = a[i + 1] + x;
                else a[i] = a[i + 2] - x;
            }
        }
        else {
            if (x == a[i + 1] - a[i + 2]) a[i] = a[i + 1] - y;
            else {
                if (y == x) a[i] = a[i + 1] - x;
                else a[i] = a[i + 2] + x;
            }
        }
        answer(i, a[i]);
    }
}

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