제출 #763233

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
763233		Polar_Bear_2007	Xylophone (JOI18_xylophone)	C++14	컴파일 에러	0 ms	0 KiB

xylophone

#ifdef MINHDEPTRAI

#include "/Library/Developer/CommandLineTools/usr/include/c++/v1/bits/stdc++.h"  
#include <chrono>
#define __gcd(a, b) gcd(a, b)
using namespace std ::chrono;
#else 
#include <bits/stdc++.h>
#include <xylophone.h>
#endif

using namespace std;
#define foru(i, a, b) for(int i = a; i <= b; ++i)
#define ford(i, a, b) for(int i = a; i >= b; --i)
#define IOS ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp(a, b) make_pair(a, b)
#define endl '\n'

#define int long long
const int maxN = 2e6 + 5;
const int mod = 998244353;
const long long inf = 1e17;

vector<int> number, triple;
int dau[maxN], ans[maxN];
void solve(){
    int n;
    cin >> n;
    int i = 1, j = 2;
    while(j <= N){
        number.push_back(query(i, j));
        i++;
        j++;
    }
    int k = 3;
    i = 1;
    while(k <= N){
        triple.push_back(query(i, k));
        i++;
        k++;
    }

    dau[0] = 1;
    for(int j = 0; j < (int) triple.size(); j++){
        if(triple[j] == number[j + 1] + number[j]){
            dau[j + 1] = dau[j];
        }
        else{
            dau[j + 1] = -dau[j];   
        }
    }
    bool check = true;
    int cnt = 0;
    while(check){
        ans[0] = ++cnt;
        if(cnt > N) break;

        for(int j = 1; j <= N - 1; j++){
            ans[j] = ans[j - 1] +  number[j - 1] * (-dau[j - 1]);
        }

        foru(j, 0, N - 1){
            if(ans[j] < 1 || ans[j] > N){
                break;
            }
            if(j == N - 1) check = false;
        }        
    }
    
    cnt = 0;
    while(check){
        ans[0] = ++cnt;
        
        if(cnt > N) break;
        for(int j = 1; j <= N - 1; j++){
            ans[j] = ans[j - 1] +  number[j - 1] * dau[j - 1];
            
        }

        foru(j, 0, N - 1){
            if(ans[j] < 1 || ans[j] > N){
                break;
            }
            
            if(j == N - 1) check = false;
        }
    }
    foru(j, 0, N - 1) answer(j + 1, ans[j]);
  
}

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

xylophone.cpp: In function 'void solve()':
xylophone.cpp:31:16: error: 'N' was not declared in this scope
   31 |     while(j <= N){
      |                ^
xylophone.cpp:38:16: error: 'N' was not declared in this scope
   38 |     while(k <= N){
      |                ^
xylophone.cpp:57:18: error: 'N' was not declared in this scope
   57 |         if(cnt > N) break;
      |                  ^
xylophone.cpp:59:29: error: 'N' was not declared in this scope
   59 |         for(int j = 1; j <= N - 1; j++){
      |                             ^
xylophone.cpp:63:20: error: 'N' was not declared in this scope
   63 |         foru(j, 0, N - 1){
      |                    ^
xylophone.cpp:14:43: note: in definition of macro 'foru'
   14 | #define foru(i, a, b) for(int i = a; i <= b; ++i)
      |                                           ^
xylophone.cpp:75:18: error: 'N' was not declared in this scope
   75 |         if(cnt > N) break;
      |                  ^
xylophone.cpp:76:29: error: 'N' was not declared in this scope
   76 |         for(int j = 1; j <= N - 1; j++){
      |                             ^
xylophone.cpp:81:20: error: 'N' was not declared in this scope
   81 |         foru(j, 0, N - 1){
      |                    ^
xylophone.cpp:14:43: note: in definition of macro 'foru'
   14 | #define foru(i, a, b) for(int i = a; i <= b; ++i)
      |                                           ^
xylophone.cpp:89:16: error: 'N' was not declared in this scope
   89 |     foru(j, 0, N - 1) answer(j + 1, ans[j]);
      |                ^
xylophone.cpp:14:43: note: in definition of macro 'foru'
   14 | #define foru(i, a, b) for(int i = a; i <= b; ++i)
      |                                           ^