Submission #67542

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
67542	2018-08-14T21:21:58 Z	JustasZ	Xylophone (JOI18_xylophone)	C++14	Compilation error	0 ms	0 KB

xylophone

#include <bits/stdc++.h>
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) (int)a.size()
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int>pii;
const int maxn=1e5+100;
int n;
int arr[maxn];
int two[maxn], three[maxn], sgn[maxn];
void solve(int n)
{
    for(int i=1; i<=n-1; i++)
        two[i]=query(i, i+1);
    for(int i=1; i<=n-2; i++)
        three[i]=query(i, i+2);
    if(three[1]==two[1]+two[2])
        sgn[1]=sgn[2]=1;
    else sgn[1]=1, sgn[2]=-1;
    for(int i=3; i<=n-1; i++)
    {
        if(two[i-1]+two[i]!=three[i-1])
            sgn[i]=-sgn[i-1];
        else sgn[i]=sgn[i-1];
    }
    arr[1]=1;
    int mn=INT_MAX;
    for(int i=2; i<=n; i++)
    {
        arr[i]=arr[i-1]+sgn[i-1]*two[i-1];
        mn=min(mn, arr[i]);
    }
    int add=1-mn;
    for(int i=1; i<=n; i++)
        arr[i]+=add;
    for(int i=1; i<=n; i++)
    {
        if(arr[i]==1)break;
        if(arr[i]==n)
        {
            for(int j=1; j<=n; j++)
                arr[j]=n-arr[j]+1;
            break;
        }
    }
    for(int i=1; i<=n; i++)
        answer(i, arr[i]);
}

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:18:16: error: 'query' was not declared in this scope
         two[i]=query(i, i+1);
                ^~~~~
xylophone.cpp:20:18: error: 'query' was not declared in this scope
         three[i]=query(i, i+2);
                  ^~~~~
xylophone.cpp:51:9: error: 'answer' was not declared in this scope
         answer(i, arr[i]);
         ^~~~~~
xylophone.cpp:51:9: note: suggested alternative: 'assert'
         answer(i, arr[i]);
         ^~~~~~
         assert