제출 #774037

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

xylophone

#include "xylophone.h"
#include <iostream>
using namespace std;

int a[5010], _ok[20000];
int *ok = _ok+10000;
void Answer(int x, int v){
    answer(x,v); a[x]=v; ok[v]=1; 
}

void solve(int n) {
    int l = 1, r = n-1;
    while(l<r){
        int mid = (l+r)/2;
        if(query(mid,n)==n-1) r=mid;
        else l=mid+1;
    }
    Answer(l,1);
    if(l!=1) Answer(l-1,query(l-1,l)+1);
    Answer(l+1,query(l,l+1)+1);
    for(int i = -n; i <= n; i++) ok[i]=(i<1 or i>n);
    for(int i = l-2; i>=1; i--){
        int dif = query(i,i+1);
        int x1 = a[i+1]-dif;
        int x2 = a[i+1]+dif;
        if(ok[x1]) swap(x1,x2);
        if(ok[x2]) answer(i,x1);
        else{
            int dif2 = query(i,i+2);
            if(abs(x1-a[i+2])==dif2) answer(i,x1);
            else answer(i,x2);
        }
    }
    for(int i = l+2; i<=n; i++){
        int dif = query(i-1,i);
        int x1 = a[i-1]-dif;
        int x2 = a[i-1]+dif;
        if(ok[x1]) swap(x1,x2);
        if(ok[x2]) answer(i,x1);
        else{
            int dif2 = query(i-2,i);
            if(abs(x1-a[i-2])==dif2) answer(i,x1);
            else answer(i,x2);
        }
    }
}

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