제출 #363295

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
363295		teewar	Xylophone (JOI18_xylophone)	C++14	47 / 100	103 ms	492 KiB

xylophone

#include "xylophone.h"
#include <cmath>
#include <cassert>

using namespace std;

void solve(int n) {
  	int cnt = 0;
    int a[n + 1];
    int l = 1, r = n;
    while(r - l > 1) {
        int m = (l + r) / 2;
      ++cnt;
        if(query(1, m) >= n - 1) {
            r = m;
        }
        else {
            l = m;
        }
    }
    int mxid = r;
    a[mxid] = n;
    if(mxid > 1) {
        a[mxid - 1] = a[mxid] - query(mxid - 1, mxid);
      ++cnt;
    }
    if(mxid + 1 <= n) {
        a[mxid + 1] = a[mxid] - query(mxid, mxid + 1);
      ++cnt;
    }
    for(int i = mxid + 2; i <= n; ++i) {
      ++cnt;
      assert(cnt <= 10000);
        int p = query(i - 1, i);
        int val1 = a[i - 1] - p;
        int val2 = a[i - 1] + p;
        if(val1 < 1) {
            a[i] = val2;
            continue;
        }
        if(val2 >= n) {
            a[i] = val1;
            continue;
        }
      ++cnt;
      assert(cnt <= 10000);
        int t = query(i - 2, i);
        if(abs(a[i - 1] - a[i - 2]) + p == t) {
            if(a[i - 2] < a[i - 1]) {
                a[i] = val2;
            }
            else {
                a[i] = val1;
            }
        }
        else {
            if(a[i - 2] < a[i - 1]) {
                a[i] = val1;
            }
            else {
                a[i] = val2;
            }
        }
    }
    for(int i = mxid - 2; i >= 1; --i) {
      ++cnt;
      assert(cnt <= 10000);
        int p = query(i, i + 1);
        int val1 = a[i + 1] - p;
        int val2 = a[i + 1] + p;
        if(val1 < 1) {
            a[i] = val2;
            continue;
        }
        if(val2 >= n) {
            a[i] = val1;
            continue;
        }
      ++cnt;
      assert(cnt <= 10000);
        int t = query(i, i + 2);
        if(abs(a[i + 1] - a[i + 2]) + p == t) {
            if(a[i + 1] < a[i + 2]) {
                a[i] = val1;
            }
            else {
                a[i] = val2;
            }
        }
        else {
            if(a[i + 1] < a[i + 2]) {
                a[i] = val2;
            }
            else {
                a[i] = val1;
            }
        }
    }
    for(int i = 1; i <= n; ++i) {
        answer(i, a[i]);
    }
}

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