제출 #379006

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
379006		gustason	Xylophone (JOI18_xylophone)	C++14	0 / 100	1 ms	364 KiB

xylophone

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

map<pair<int, int>, int> m;
int qq(int L, int R) {
    if (m[{L, R}] != 0) {
        return m[{L, R}];
    }
    return m[{L, R}] = query(L, R);
}
int getl(int n) {
    int l = 1, r = n, idx = r-1;
    while(l <= r) {
        int mid = (l + r) / 2;
        if (qq(mid, n) == n-1) {
            idx = mid;
            r = mid - 1;
        } else {
            l = mid + 1;
        }
    }
    return idx;
}
void solve(int n) {
    int l0 = getl(n);
	int l = l0, r = n, idx = r;
    while(l <= r) {
        int mid = (l + r) / 2;
        if (qq(l0, mid) != n-1) {
            l = mid + 1;
        } else {
            idx = mid;
            r = mid - 1;
        }
    }

    vector<bool> seen(n+5, false);
    vector<int> an(n+5, -1);
    an[idx] = n;
    for(int i = idx-1; i >= 1; i--) {
        int val = qq(i, idx);
        if (!seen[val]) {
            an[i] = n - val;
            seen[val] = true;
        }
    }
    for(int i = idx+1; i <= n; i++) {
        int val = qq(idx, i);
        if (!seen[val]) {
            an[i] = n - val;
            seen[val] = true;
        }
    }

    for(int i = idx; i > 1; i--) {
        assert(an[i] != -1);
        if (an[i-1] != -1) continue;
        int val = qq(i-1, i);
        an[i-1] = an[i] + val;
    }
    for(int i = idx; i < n; i++) {
        assert(an[i] != -1);
        if (an[i+1] != -1) continue;
        int val = qq(i, i+1);
        an[i+1] = an[i] + val;
    }

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

}

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