Submission #320956

#	Time	Username	Problem	Language	Result	Execution time	Memory
320956		zaneyu	Xylophone (JOI18_xylophone)	C++14	Compilation error	0 ms	0 KiB

xylophone

/*input
5
1 2 5 3 4
*/
//#include "xylophone.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld double
#define pii pair<ll,ll>
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=5e3+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=(1e9+7);
const ll MOD2=1000002173;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
ll mult(ll a,ll b){
    return ((a%MOD)*(b%MOD))%MOD;
}
ll mypow(ll a,ll b,ll MOD){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
int two[maxn],three[maxn];
void solve(int n) {
    REP1(i,n-1){
        two[i]=query(i,i+1);
    } 
    REP1(i,n-2){
        three[i]=query(i,i+2);
    }
    int cur=0;
    pii mx={0,1},mn={0,1};
    int pv=1;
    REP1(i,n-1){
        if(i==1 or two[i-1]+two[i]==three[i-1]){
            cur+=pv*two[i];
        }
        else{
            pv=-pv;
            cur+=pv*two[i];
        }
        pii x={cur,i};
        //cout<<cur<<'\n';
        if(mx<x) mx=x;
        if(mn>x) mn=x;
    }
    if(mx.s<mn.s){
        mn.f=-mx.f;
        pv=-1;
    }
    else{
        pv=1;
    }
    cur=-mn.f+1;
    answer(1,cur);
    REP1(i,n-1){
        if(i==1 or two[i-1]+two[i]==three[i-1]){
            cur+=pv*two[i];
        }
        else{
            pv=-pv;
            cur+=pv*two[i];
        }
        answer(i+1,cur);
    }
}

Compilation message (stderr)

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:55:16: error: 'query' was not declared in this scope
   55 |         two[i]=query(i,i+1);
      |                ^~~~~
xylophone.cpp:58:18: error: 'query' was not declared in this scope
   58 |         three[i]=query(i,i+2);
      |                  ^~~~~
xylophone.cpp:84:5: error: 'answer' was not declared in this scope
   84 |     answer(1,cur);
      |     ^~~~~~