Submission #1150693

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1150693	2025-02-15 11:21:18	mingga	Xylophone (JOI18_xylophone)	C++20	100 / 100	26 ms	432 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 "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
static int a[5005];
void solve(int n) {
  a[1] = 0;
  a[2] = query(1, 2);
  for(int i = 3; i <= n; i++) {
    int x1 = a[i - 1] - a[i - 2];
    int x2 = query(i - 1, i);
    int x3 = query(i - 2, i);
    int sign = (x1 > 0 ? 1 : -1);
    x1 = abs(x1);
    if(x1 + x2 == x3) {
      a[i] = a[i - 1] + x2 * sign; 
    } else {
      a[i] = a[i - 1] - x2 * sign;
    }
  }
  int mxid = 1, mnid = 1;
  for(int i = 2; i <= n; i++) {
    if(a[i] > a[mxid]) mxid = i;
    if(a[i] < a[mnid]) mnid = i;
  }
  if(mxid < mnid) {
    for(int i = 1; i <= n; i++) a[i] = -a[i];
    swap(mnid, mxid);
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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