제출 #230199

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
230199		AngusRitossa	Xylophone (JOI18_xylophone)	C++14	0 / 100	4 ms	256 KiB

xylophone

#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
#define MAXN 5010
int diff[MAXN], diffsign[MAXN];
void solve(int n) {
	for (int i = 1; i < n; i++) {
		diff[i] = query(i, i+1);
	}
	for (int i = 1; i < n-1; i++) {
		int am = query(i, i+2);
		if (am != diff[i]+diff[i+1]) diffsign[i+1] = 1;
	}
	for (int i = 2; i < n; i++) {
		if (diffsign[i] && diff[i-1] > 0) diff[i]*=-1;
		if (!diffsign[i] && diff[i-1] < 0) diff[i]*=-1;
	}
	int sum = accumulate(diff+1, diff+n, 0);
	if (sum < 0) {
		for (int i = 1; i < n; i++) diff[i]*=-1;
	}
	int val = 0, mn = 0;
	for (int i = 1; i < n; i++) {
		val += diff[i];
		printf("%d %d\n", diff[i], val);
		mn = min(mn, val);
	}
	val = -mn;
	val++;
	for (int i = 1; i <= n; i++) {
		answer(i, val);
		val += diff[i];
	}
}

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