제출 #1143823

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
1143823	2025-02-01 16:21:29	lightentheshadow	Xylophone (JOI18_xylophone)	C++20	100 / 100	26 ms	496 KiB

xylophone

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#include "xylophone.h"
using namespace std;
int cmp2[5005], cmp3[5005], diff[5005], a[5005];
void solve(int n) {
    for (int i = 1; i < n; i++) {
        cmp2[i] = query(i, i + 1);
        if (i + 2 <= n) cmp3[i] = query(i, i + 2);
    }
    diff[1] = cmp2[1];
    for (int i = 2; i < n; i++) {
        diff[i] = cmp2[i];
        if (cmp2[i - 1] + cmp2[i] == cmp3[i - 1]) {
            if (diff[i] * diff[i - 1] < 0) diff[i] *= -1;
        }
        else {
            if (diff[i] * diff[i - 1] > 0) diff[i] *= -1;
        }
    }
    a[1] = 0;
    for (int i = 1; i < n; i++)
        a[i + 1] = a[i] + diff[i];
    int mnPos = min_element(a + 1, a + n + 1) - a, mxPos = max_element(a + 1, a + n + 1) - a;
    if (mnPos > mxPos) {
        for (int i = 1; i <= n; i++)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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