제출 #1016932

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1016932		lazar3141	Xylophone (JOI18_xylophone)	C++17	100 / 100	63 ms	596 KiB

xylophone

#include<bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
#include "xylophone.h"

using namespace std;

static const int N_MAX = 5000;
static const int Q_MAX = 10100;
static int N;
static int A[N_MAX];
static bool used[N_MAX];
static int query_c;
static int answer_c;

void solve(int N) {
    vector<int> v(N+1, 0);
	int l = 2, r = N;
	int rez = -1;
	if(query(1, N-1)!=N-1) rez = N;
	else{
        while(l<=r){
            int mid = (l+r)/2;
            if(query(1, mid)!=N-1){
                l = mid+1;
            } else{
                rez = mid;
                r = mid-1;

            }
        }
	}
    answer(rez, N);
    v[rez] = N;
    if(rez!=1){
        int x = N-query(rez-1, rez);
        answer(rez-1, x);
        v[rez-1] = x;
    }
    if(rez!=N){
        int x = N-query(rez, rez+1);
        answer(rez+1, x);
        v[rez+1] = x;
    }
    for(int i = rez-2;i>=1;i--){
        int d1 = query(i, i+1);
        if(d1>v[i+1]){
            v[i] = v[i+1]+d1;
            answer(i, v[i]);
            continue;
        }
        if(v[i+1]+d1>=N){
            v[i] = v[i+1]-d1;
            answer(i, v[i]);
            continue;
        }
        int d2 = query(i, i+2);
        int ans = 0;
        if(v[i+1]>v[i+2]){
            if(d1+v[i+1]-v[i+2]==d2) ans = v[i+1]+d1;
            else ans = v[i+1]-d1;
        } else{
            if(d1+v[i+2]-v[i+1]==d2) ans = v[i+1]-d1;
            else ans = v[i+1]+d1;
        }
        answer(i, ans);
        v[i] = ans;
    }
    for(int i = rez+2;i<=N;i++){
        int d1 = query(i-1, i);
        if(d1>v[i-1]){
            v[i] = v[i-1]+d1;
            answer(i, v[i]);
            continue;
        }
        if(v[i-1]+d1>=N){
            v[i] = v[i-1]-d1;
            answer(i, v[i]);
            continue;
        }
        int d2 = query(i-2, i);
        int ans = 0;
        if(v[i-1]>v[i-2]){
            if(d1+v[i-1]-v[i-2]==d2) ans = v[i-1]+d1;
            else ans = v[i-1]-d1;
        } else{
            if(d1+v[i-2]-v[i-1]==d2) ans = v[i-1]-d1;
            else ans = v[i-1]+d1;
        }
        answer(i, ans);
        v[i] = ans;
    }
}

컴파일 시 표준 에러 (stderr) 메시지

xylophone.cpp:14:12: warning: 'answer_c' defined but not used [-Wunused-variable]
   14 | static int answer_c;
      |            ^~~~~~~~
xylophone.cpp:13:12: warning: 'query_c' defined but not used [-Wunused-variable]
   13 | static int query_c;
      |            ^~~~~~~
xylophone.cpp:12:13: warning: 'used' defined but not used [-Wunused-variable]
   12 | static bool used[N_MAX];
      |             ^~~~
xylophone.cpp:11:12: warning: 'A' defined but not used [-Wunused-variable]
   11 | static int A[N_MAX];
      |            ^
xylophone.cpp:10:12: warning: 'N' defined but not used [-Wunused-variable]
   10 | static int N;
      |            ^

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