답안 #870401

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
870401 2023-11-07T17:13:35 Z serifefedartar Xylophone (JOI18_xylophone) C++17
100 / 100
65 ms 102412 KB
#include <bits/stdc++.h>
#include "xylophone.h"
using namespace std;
 
#define fast ios::sync_with_stdio(0);cin.tie(0);
#define s second
#define f first
typedef long long ll;
const ll MOD = 1e9+9;
const ll LOGN = 20; 
const ll MAXN = 5e3 + 100;

int qry[MAXN][MAXN];
int diff[MAXN];

void solve(int N) {
	for (int i = 1; i <= N - 1; i++)
		qry[i][i+1] = query(i, i+1);
	for (int i = 1; i <= N - 2; i++)
		qry[i][i+2] = query(i, i+2);

	diff[2] = qry[1][2];
	for (int i = 1; i <= N - 2; i++) {
		if (qry[i][i+1] + qry[i+1][i+2] == qry[i][i+2]) {
			if (diff[i] < diff[i+1])
				diff[i+2] = diff[i+1] + qry[i+1][i+2];
			else
				diff[i+2] = diff[i+1] - qry[i+1][i+2];
		} else {
			if (diff[i] < diff[i+1])
				diff[i+2] = diff[i+1] - qry[i+1][i+2];
			else
				diff[i+2] = diff[i+1] + qry[i+1][i+2];
		}
	}

	int mn = 1, mx = 1;
	for (int i = 2; i <= N; i++) {
		if (diff[i] < diff[mn])
			mn = i;
		if (diff[i] > diff[mx])
			mx = i;
	}

	if (mn > mx) {
		for (int i = 1; i <= N; i++)
			diff[i] = -diff[i];
	}

	int sum = 0;
	for (int i = 1; i <= N; i++)
		sum += diff[i];

	int con = (N * (N + 1) / 2 - sum) / N;
	for (int i = 1; i <= N; i++)
		answer(i, con + diff[i]);
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 444 KB Output is correct
2 Correct 1 ms 608 KB Output is correct
3 Correct 1 ms 2492 KB Output is correct
4 Correct 1 ms 2492 KB Output is correct
5 Correct 1 ms 2496 KB Output is correct
6 Correct 1 ms 2496 KB Output is correct
7 Correct 1 ms 2496 KB Output is correct
8 Correct 1 ms 2496 KB Output is correct
9 Correct 1 ms 2496 KB Output is correct
10 Correct 1 ms 2492 KB Output is correct
11 Correct 1 ms 2492 KB Output is correct
12 Correct 1 ms 2496 KB Output is correct
13 Correct 1 ms 2492 KB Output is correct
14 Correct 1 ms 2496 KB Output is correct
15 Correct 1 ms 2492 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 444 KB Output is correct
2 Correct 1 ms 608 KB Output is correct
3 Correct 1 ms 2492 KB Output is correct
4 Correct 1 ms 2492 KB Output is correct
5 Correct 1 ms 2496 KB Output is correct
6 Correct 1 ms 2496 KB Output is correct
7 Correct 1 ms 2496 KB Output is correct
8 Correct 1 ms 2496 KB Output is correct
9 Correct 1 ms 2496 KB Output is correct
10 Correct 1 ms 2492 KB Output is correct
11 Correct 1 ms 2492 KB Output is correct
12 Correct 1 ms 2496 KB Output is correct
13 Correct 1 ms 2492 KB Output is correct
14 Correct 1 ms 2496 KB Output is correct
15 Correct 1 ms 2492 KB Output is correct
16 Correct 3 ms 7104 KB Output is correct
17 Correct 5 ms 10944 KB Output is correct
18 Correct 8 ms 16884 KB Output is correct
19 Correct 12 ms 21704 KB Output is correct
20 Correct 12 ms 21952 KB Output is correct
21 Correct 9 ms 21692 KB Output is correct
22 Correct 10 ms 21180 KB Output is correct
23 Correct 9 ms 21216 KB Output is correct
24 Correct 10 ms 21180 KB Output is correct
25 Correct 9 ms 21692 KB Output is correct
26 Correct 9 ms 20996 KB Output is correct
27 Correct 10 ms 21704 KB Output is correct
28 Correct 9 ms 21192 KB Output is correct
29 Correct 9 ms 21440 KB Output is correct
30 Correct 10 ms 21000 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 444 KB Output is correct
2 Correct 1 ms 608 KB Output is correct
3 Correct 1 ms 2492 KB Output is correct
4 Correct 1 ms 2492 KB Output is correct
5 Correct 1 ms 2496 KB Output is correct
6 Correct 1 ms 2496 KB Output is correct
7 Correct 1 ms 2496 KB Output is correct
8 Correct 1 ms 2496 KB Output is correct
9 Correct 1 ms 2496 KB Output is correct
10 Correct 1 ms 2492 KB Output is correct
11 Correct 1 ms 2492 KB Output is correct
12 Correct 1 ms 2496 KB Output is correct
13 Correct 1 ms 2492 KB Output is correct
14 Correct 1 ms 2496 KB Output is correct
15 Correct 1 ms 2492 KB Output is correct
16 Correct 3 ms 7104 KB Output is correct
17 Correct 5 ms 10944 KB Output is correct
18 Correct 8 ms 16884 KB Output is correct
19 Correct 12 ms 21704 KB Output is correct
20 Correct 12 ms 21952 KB Output is correct
21 Correct 9 ms 21692 KB Output is correct
22 Correct 10 ms 21180 KB Output is correct
23 Correct 9 ms 21216 KB Output is correct
24 Correct 10 ms 21180 KB Output is correct
25 Correct 9 ms 21692 KB Output is correct
26 Correct 9 ms 20996 KB Output is correct
27 Correct 10 ms 21704 KB Output is correct
28 Correct 9 ms 21192 KB Output is correct
29 Correct 9 ms 21440 KB Output is correct
30 Correct 10 ms 21000 KB Output is correct
31 Correct 26 ms 43748 KB Output is correct
32 Correct 33 ms 62696 KB Output is correct
33 Correct 52 ms 89296 KB Output is correct
34 Correct 57 ms 101864 KB Output is correct
35 Correct 57 ms 102148 KB Output is correct
36 Correct 55 ms 102100 KB Output is correct
37 Correct 60 ms 101900 KB Output is correct
38 Correct 54 ms 101392 KB Output is correct
39 Correct 63 ms 101216 KB Output is correct
40 Correct 63 ms 102124 KB Output is correct
41 Correct 52 ms 101144 KB Output is correct
42 Correct 54 ms 102132 KB Output is correct
43 Correct 55 ms 102220 KB Output is correct
44 Correct 47 ms 101688 KB Output is correct
45 Correct 53 ms 102372 KB Output is correct
46 Correct 57 ms 101672 KB Output is correct
47 Correct 54 ms 101812 KB Output is correct
48 Correct 57 ms 101916 KB Output is correct
49 Correct 51 ms 101900 KB Output is correct
50 Correct 46 ms 101212 KB Output is correct
51 Correct 65 ms 101208 KB Output is correct
52 Correct 55 ms 102152 KB Output is correct
53 Correct 49 ms 101684 KB Output is correct
54 Correct 53 ms 101940 KB Output is correct
55 Correct 56 ms 101332 KB Output is correct
56 Correct 50 ms 102172 KB Output is correct
57 Correct 52 ms 101832 KB Output is correct
58 Correct 58 ms 102412 KB Output is correct
59 Correct 53 ms 102088 KB Output is correct
60 Correct 49 ms 102092 KB Output is correct