oj.uz

Submission #201485

# Submission time Handle Problem Language Result Execution time Memory
201485 2020-02-10T17:36:26 Z wilwxk Xylophone (JOI18_xylophone) C++14
0 / 100
 7 ms 376 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 5e3+5;
int ans[MAXN];
int mem[MAXN];
int mn;

void solve(int n) {
	ans[0] = 0;
	int op = 1;
	for(int i = 2; i <= n; i++) {
		mem[i] = query(i-1, i);
		if(i == 2) {
			ans[i] = mem[i];
			continue;
		}
		int x = query(i-2, i);
		if(mem[i-1] >= max(mem[i], x) || mem[i] >= max(mem[i-1], x)) op *= -1;
		ans[i] = ans[i-1]+op*mem[i];
		mn = min(ans[i], mn); 
	}

	for(int i = 1; i <= n; i++) ans[i] -= (mn-1);

	for(int i = 1; i <= n; i++) answer(i, ans[i]);
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 7 ms 252 KB Output is correct
5 Incorrect 7 ms 248 KB Wrong Answer [7]
6 Halted 0 ms 0 KB -

Subtask #2
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 7 ms 252 KB Output is correct
5 Incorrect 7 ms 248 KB Wrong Answer [7]
6 Halted 0 ms 0 KB -

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 7 ms 252 KB Output is correct
5 Incorrect 7 ms 248 KB Wrong Answer [7]
6 Halted 0 ms 0 KB -