답안 #1114440

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1114440	2024-11-18T21:51:52 Z	sunboi	Xylophone (JOI18_xylophone)	C++17	컴파일 오류	0 ms	0 KB

xylophone

#include <bits/stdc++.h>
using namespace std;

void solve(int n){
    return;
    int pos = 0;
    int i = 1;
    while(query(i, n) == n - 1){
        i++;
    }
    i--;
    int reference = i;
    vector<int> a(n);
    int x = query(i, i + 1) + 1;
    
    a[i] = 1;
    a[i + 1] = x;
    i += 2;
    for (i; 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 > uno){
            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;
        }
    }
    
    i = reference;
    x = query(i - 1, i);
    a[i - 1] = 1 + x;
    i -= 2;
    for (i; 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 + 1, i);
        int dos = query(i + 2, i);
        
        if (dos > uno){
            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;
        }
    }
    for (int i = 1; i <= n; i++) answer(i, a[i]);
}

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:8:11: error: 'query' was not declared in this scope
    8 |     while(query(i, n) == n - 1){
      |           ^~~~~
xylophone.cpp:14:13: error: 'query' was not declared in this scope
   14 |     int x = query(i, i + 1) + 1;
      |             ^~~~~
xylophone.cpp:19:10: warning: statement has no effect [-Wunused-value]
   19 |     for (i; i <= n; i++){
      |          ^
xylophone.cpp:21:13: warning: unused variable 'mx' [-Wunused-variable]
   21 |         int mx = max(a[i - 1], a[i - 2]);
      |             ^~
xylophone.cpp:41:10: warning: statement has no effect [-Wunused-value]
   41 |     for (i; i >= 1; i--){
      |          ^
xylophone.cpp:43:13: warning: unused variable 'mx' [-Wunused-variable]
   43 |         int mx = max(a[i + 1], a[i + 2]);
      |             ^~
xylophone.cpp:58:34: error: 'answer' was not declared in this scope
   58 |     for (int i = 1; i <= n; i++) answer(i, a[i]);
      |                                  ^~~~~~
xylophone.cpp:6:9: warning: unused variable 'pos' [-Wunused-variable]
    6 |     int pos = 0;
      |         ^~~