Submission #1114445

#	Time	Username	Problem	Language	Result	Execution time	Memory
1114445		sunboi	Xylophone (JOI18_xylophone)	C++17	0 / 100	1 ms	336 KiB

xylophone

#include <bits/stdc++.h>
#include "xylophone.h"
using namespace std;
 
 
 
void solve(int n){
    int i = 1;
    while(query(i, n) == n - 1){
        i++;
    }
    i--;
    int reference = i;
    vector<int> a(n + 100);
    int x = query(i, i + 1);
    
    a[i] = 1;
    a[i + 1] = x + 1;
    i += 2;
    int last = x;
    
    for (; i <= n; i++){
        int mn = min(a[i - 1], a[i - 2]);
        int mx = max(a[i - 1], a[i - 2]);
        int uno = query(i - 1, i);
        int dos = query(i - 2, i);
        
        if (dos > last){
            
            if (a[i - 1] + uno == a[i - 2] + dos){
                a[i] = a[i - 1] + uno;
            }else{
                a[i] = a[i - 1] - uno;
            }
        }else{
            if (a[i - 1] == mn) a[i] = a[i - 1] + uno;
            else a[i] = a[i - 1] - uno;
        }
        last = uno;
    }
    
    i = reference;
    x = query(i - 1, i);
    a[i - 1] = 1 + x;
    last = x;
    i -= 2;
    for (; i >= 1; i--){
        int mn = min(a[i + 1], a[i + 2]);
        int mx = max(a[i + 1], a[i + 2]);
        int uno = query(i, i + 1);
        int dos = query(i, i + 2);
        if (dos > last){
            if (a[i + 1] + uno == a[i + 2] + dos){
                a[i] = a[i + 1] + uno;
            }else{
                a[i] = a[i + 1] - uno;
            }
        }else{
            if (a[i + 1] == mn) a[i] = a[i + 1] + uno;
            else a[i] = a[i + 1] - uno;
        }
        last = uno;
    }
    for (int i = 1; i <= n; i++) answer(i, a[i]);
}

Compilation message (stderr)

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:24:13: warning: unused variable 'mx' [-Wunused-variable]
   24 |         int mx = max(a[i - 1], a[i - 2]);
      |             ^~
xylophone.cpp:49:13: warning: unused variable 'mx' [-Wunused-variable]
   49 |         int mx = max(a[i + 1], a[i + 2]);
      |             ^~

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