Submission #263813

#	Time	Username	Problem	Language	Result	Execution time	Memory
263813		Falcon	Xylophone (JOI18_xylophone)	C++14	100 / 100	109 ms	536 KiB

xylophone

#pragma GCC optimize("O2")

#include "xylophone.h"
#include <bits/stdc++.h>
#ifdef DEBUG
    #include "debug.hpp"
#endif

using namespace std;

#define all(c) (c).begin(), (c).end()
#define traverse(c, it) for(auto it = (c).begin(); it != (c).end(); it++)
#define rep(i, N) for(int i = 0; i < (N); i++)
#define rep1(i, N) for(int i = 1; i <= (N); i++)
#define rep2(i, s, e) for(int i = (s); i <= (e); i++)
#define rep3(i, s, e, d) for(int i = (s); (d) >= 0 ? i <= (e) : i >= (e); i += (d))
#define pb push_back


#ifdef DEBUG
    #define debug(x...) {dbg::depth++; string dbg_vals = dbg::to_string(x); dbg::depth--; dbg::fprint(__func__, __LINE__, #x, dbg_vals);}
    #define light_debug(x) {dbg::light = 1; dbg::dout << __func__ << ":" << __LINE__ << "  " << #x << " = " << x << endl; dbg::light = 0;}
#else
    #define debug(x...)
    #define light_debug(x) 
#endif

template<typename T>
T& ckmin(T& a, T b){ return a = a > b ? b : a; }

template<typename T>
T& ckmax(T& a, T b){ return a = a < b ? b : a; }

using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
	

void solve(int N) {
	vi A(N + 1), d(N);
	rep1(i, N - 1)
		d[i] =  query(i, i + 1);
	A[2] = A[1] + d[1];

	int pre = 1;
	rep1(i, N - 2){
		if(query(i, i + 2) != d[i] + d[i + 1])
			pre *= -1;
		A[i + 2] = A[i + 1] + d[i + 1] * pre;
	}
	int shift = 1 - *min_element(1 + all(A));

	rep1(i, N) A[i] += shift;

	if(min_element(1 + all(A)) > max_element(1 + all(A)))
		rep1(i, N) A[i] = 1 + N - A[i];

	rep1(i, N) answer(i, A[i]);
}

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