Submission #400762

#	Time	Username	Problem	Language	Result	Execution time	Memory
400762		timmyfeng	Xylophone (JOI18_xylophone)	C++17	100 / 100	135 ms	320 KiB

xylophone

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

#include "xylophone.h"

void solve(int n) {
    vector<int> ans(n + 1);
    ans[2] = ans[1] + query(1, 2);

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

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

    int offset = *min_element(ans.begin(), ans.end());
    for (int i = 1; i <= n; ++i) {
        ans[i] -= offset - 1;
    }

    if (find(ans.begin(), ans.end(), 1) > find(ans.begin(), ans.end(), n)) {
        for (int i = 1; i <= n; ++i) {
            ans[i] = n + 1 - ans[i];
        }
    }

    for (int i = 1; i <= n; ++i) {
        answer(i, ans[i]);
    }
}

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