Submission #139316

#	Time	Username	Problem	Language	Result	Execution time	Memory
139316		rzbt	Xylophone (JOI18_xylophone)	C++14	0 / 100	2 ms	376 KiB

xylophone

#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#include "xylophone.h"
using namespace std;
#define MAXN 5003
int niz[MAXN];

void solve(int n)
{
    niz[1]=1;
    niz[2]=1+query(1,2);
    niz[n]=n;
    for(int i=3;i<n;i++){
        int x=query(i-2,i);
        int y=query(i-1,i);
        
        if(x==abs(niz[i-1]-niz[i-2])){
            if(niz[i-2]<niz[i-1])niz[i]=niz[i-1]-y;
            else niz[i]=niz[i-1]+y;
        }else{
            if(niz[i-2]<niz[i-1])niz[i]=niz[i-1]+y;
            else niz[i]=niz[i-1]-y;
        }
    }
    for(int i=1;i<=n;i++)answer(i,niz[i]);

}

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