Submission #505226

#	Time	Username	Problem	Language	Result	Execution time	Memory
505226		colossal_pepe	Xylophone (JOI18_xylophone)	C++17	0 / 100	1 ms	200 KiB

xylophone

#include <iostream>
using namespace std;
 
int n, a[5005];
 
int query(int s, int t);
void answer(int i, int x);
 
int find1Pos() {
    int l = 1, r = n;
    while (r - l > 1) {
        int mid = (r + l) / 2;
        if (query(mid, n) == n - 1) l = mid;
        else r = mid - 1;
    }
    if (query(r, n) == n - 1) return r;
    return l;
}
 
int getVal(int cur, int p, int pp) {
    int d = query(min(cur, p), max(cur, p));
    if (a[p] + d > n) {
        return a[p] - d;
    } else if (a[p] - d < 1) {
        return a[p] + d;
    } else {
        int e = query(min(cur, pp), max(cur, pp));
        /*
        int c = 1;
        if (a[p] > a[pp]) c = -1;
        return (e == abs(a[p] - a[pp]) ? a[p] + (c * d) : a[p] - (c * d));
        */
        if (a[p] > a[pp]) {
            return (e == a[p] - a[pp] ? a[p] - d : a[p] + d);
        } else {
            return (e == a[pp] - a[p] ? a[p] + d : a[p] - d);
        }
    }
}
 
void solve(int N) {
    n = N;
    int k = find1Pos();
    a[k] = 1;
    for (int i = k - 1; i >= 1; i--) {
        a[i] = getVal(i, i + 1, i + 2);
    }
    for (int i = k + 1; i <= n; i++) {
        a[i] = getVal(i, i - 1, i - 2);
    }
    for (int i = 1; i <= n; i++) {
        answer(i, a[i]);
    }
}

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