제출 #918520

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

xylophone

#include <bits/stdc++.h>
using namespace std;
#include "xylophone.h"

void solve(int n) {
    vector<int> a(n);
    int min = 0, max = n - 1;
    for (int i = 1; i < n; ++i) {
        if (query(i + 1, n) != n - 1) break;
        min = i;
    }
    for (int i = n - 2; i >= 0; --i) {
        if (query(1, i + 1) != n - 1) break;
        max = i;
    }
    a[min] = 1, a[max] = n;
    int last = min, val = 0;
    bool increasing = true;
    for (int i = min - 1; i >= 0; --i) {
        int diff = query(i + 1, last + 1);
        if (diff == val) {
            last = i + 1;
            diff = query(i + 1, last + 1);
            increasing ^= true;
        }
        a[i] = a[last] + (increasing ? diff : -diff);
        val = diff;
    }
    last = min, val = 0;
    increasing = true;
    for (int i = min + 1; i < max; ++i) {
        int diff = query(last + 1, i + 1);
        if (diff == val) {
            last = i + 1;
            diff = query(last + 1, i + 1);
            increasing ^= true;
        }
        a[i] = a[last] + (increasing ? diff : -diff);
        val = diff;
    }
    last = max, val = 0;
    increasing = false;
    for (int i = max + 1; i < n; ++i) {
        int diff = query(last + 1, i + 1);
        if (diff == val) {
            last = i - 1;
            diff = query(last + 1, i + 1);
            increasing ^= true;
        }
        a[i] = a[last] + (increasing ? diff : -diff);
        val = diff;
    }
    for (int i = 0; i < n; ++i) {
        answer(i + 1, a[i]);
    }
}

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