Submission #1116510

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1116510	2024-11-21 18:25:13	hyakup	Xylophone (JOI18_xylophone)	C++17	100 / 100	196 ms	584 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;
#define bug(x) cerr << #x << " " << x << endl;
void solve(int N) {
  int n = N;
  vector<int> dif( n + 1 ), x( n + 1, 1 );
  for( int i = 2; i <= n; i++ ){
    dif[i] = query( i - 1, i );
    if( i > 2 ){
      int aux = query( i - 2, i );
      if( aux == dif[i - 1] || aux == dif[i] ) x[i] = -x[i - 1];
      else x[i] = x[i - 1];
    }
  }
  pair<int, int> maxi( 0, 1 ), mini( 0, 1 );
  for( int i = 2, sum = 0; i <= n; i++ ){
    sum += dif[i]*x[i];
    maxi = max( maxi, make_pair( sum, i ) );
    mini = min( mini, make_pair( sum, i ) );
  }
  int val;
  if( maxi.second < mini.second ){
    val = 1 + abs(maxi.first);
    for( int i = 2; i <= n; i++ ) x[i] = -x[i];
  }
  else val = 1 + abs(mini.first);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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