Submission #156361

#	Time	Username	Problem	Language	Result	Execution time	Memory
156361		georgerapeanu	Xylophone (JOI18_xylophone)	C++11	100 / 100	124 ms	504 KiB

xylophone

#include "xylophone.h"
#pragma once
#include <algorithm>

using namespace std;

int ans[5005];

int a[5005];
int b[5005];

void solve(int n) {

    for(int i = 1;i < n;i++){
        a[i] = query(i,i + 1);
    }
    for(int i = 1;i < n - 1;i++){
        b[i] = query(i,i + 2);
    }

    int dir = 1;
    ans[1] = 0;
    ans[2] = a[1];

    for(int i = 3;i <= n;i++){
        if(a[i - 2] + a[i - 1] != b[i - 2]){
            dir *= -1;
        }
        ans[i] = ans[i - 1] + dir * a[i - 1];
    }

    pair<int,int> mi = {n + 5,n + 5},ma = {0,0};

    for(int i = 1;i <= n;i++){
        mi = min(mi,{ans[i],i});
        ma = max(ma,{ans[i],i});
    }

    for(int i = 1;i <= n;i++){
        ans[i] = ans[i] - mi.first + 1;
        if(mi.second > ma.second){
            ans[i] = n - ans[i] + 1;
        }
        answer(i,ans[i]);
    }
}

Compilation message (stderr)

xylophone.cpp:2:9: warning: #pragma once in main file
 #pragma once
         ^~~~

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