oj.uz

Submission #230194

# Submission time Handle Problem Language Result Execution time Memory
230194 2020-05-09T03:33:52 Z AngusRitossa Xylophone (JOI18_xylophone) C++14
0 / 100
 4 ms 256 KB 
#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 mn = 0, val = 0;
	for (int i = 1; i < n; i++) {
		val += diff[i];
		mn = min(mn, val);
	}
	val = -mn;
	for (int i = 1; i <= n; i++) {
		answer(i, val);
		val += diff[i];
	}
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 256 KB Wrong Answer [4]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 36.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 256 KB Wrong Answer [4]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 256 KB Wrong Answer [4]
2 Halted 0 ms 0 KB -