Submission #213621

#	Time	Username	Problem	Language	Result	Execution time	Memory
213621		balbit	Xylophone (JOI18_xylophone)	C++14	100 / 100	130 ms	512 KiB

xylophone

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

using namespace std;
#define ll long long
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1<<29;
const ll inf = 1ll<<60;
const ll mod = 998244353 ;


void GG(){cout<<"0\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b, ll mo = mod){
    if (b==1) return b;
    return (mo-mo/b) * inv(mo%b) % mo;
}

const int maxn = 1e6+5;

#ifdef BALBIT

void answer(int a, int b){}
int query(int a,int b){
    bug(a,b);
    int x; cin>>x;
    return x;
}
#endif // BALBIT

int qq(int a, int b){
    return query(a+1, b+1);
}

void solve(int n) {
    vector<int> ans(n);
    int prev = 0;
    int dir = 1;
    int minat = 0, maxat = 0;
    for (int i = 1; i<n; ++i) {
        if (i == 1) {
            int q = qq(0,1);
            ans[i] = ans[i-1] + q;
            prev = q;
        }else{
            int q = qq(i-1,i);
            int q2 = qq(i-2,i);
            if (q2 == max(q,prev)) {
                dir = -dir;
            }
            prev = q;
            ans[i] = ans[i-1] + q*dir;
        }
        if (ans[i] < ans[minat]) {
            minat = i;
        }
        if (ans[i] > ans[maxat]) {
            maxat = i;
        }
    }
    if (minat > maxat) {
        for (int i = 0; i<n; ++i) ans[i] = - ans[i];
    }
    int mn = 0;
    for (int i = 0; i<n; ++i) mn = min (mn, ans[i]);
    for (int i = 0; i<n; ++i) {
        ans[i] -= mn;
        bug(ans[i]);
        answer(i+1,ans[i]+1);
    }

}

#ifdef BALBIT
signed main(){
    IOS();
    solve(5);



}
#endif

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