oj.uz

Submission #213621

# Submission time Handle Problem Language Result Execution time Memory
213621 2020-03-26T09:33:56 Z balbit Xylophone (JOI18_xylophone) C++14
100 / 100
 130 ms 512 KB 
#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.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 7 ms 384 KB Output is correct
5 Correct 7 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 7 ms 512 KB Output is correct
8 Correct 7 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 7 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 7 ms 128 KB Output is correct
13 Correct 7 ms 384 KB Output is correct
14 Correct 7 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 7 ms 384 KB Output is correct
5 Correct 7 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 7 ms 512 KB Output is correct
8 Correct 7 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 7 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 7 ms 128 KB Output is correct
13 Correct 7 ms 384 KB Output is correct
14 Correct 7 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 10 ms 384 KB Output is correct
17 Correct 14 ms 384 KB Output is correct
18 Correct 20 ms 384 KB Output is correct
19 Correct 24 ms 384 KB Output is correct
20 Correct 30 ms 384 KB Output is correct
21 Correct 24 ms 384 KB Output is correct
22 Correct 29 ms 384 KB Output is correct
23 Correct 29 ms 384 KB Output is correct
24 Correct 29 ms 384 KB Output is correct
25 Correct 24 ms 384 KB Output is correct
26 Correct 30 ms 384 KB Output is correct
27 Correct 27 ms 384 KB Output is correct
28 Correct 24 ms 384 KB Output is correct
29 Correct 29 ms 384 KB Output is correct
30 Correct 14 ms 416 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 7 ms 384 KB Output is correct
5 Correct 7 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 7 ms 512 KB Output is correct
8 Correct 7 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 7 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 7 ms 128 KB Output is correct
13 Correct 7 ms 384 KB Output is correct
14 Correct 7 ms 384 KB Output is correct
15 Correct 6 ms 384 KB Output is correct
16 Correct 10 ms 384 KB Output is correct
17 Correct 14 ms 384 KB Output is correct
18 Correct 20 ms 384 KB Output is correct
19 Correct 24 ms 384 KB Output is correct
20 Correct 30 ms 384 KB Output is correct
21 Correct 24 ms 384 KB Output is correct
22 Correct 29 ms 384 KB Output is correct
23 Correct 29 ms 384 KB Output is correct
24 Correct 29 ms 384 KB Output is correct
25 Correct 24 ms 384 KB Output is correct
26 Correct 30 ms 384 KB Output is correct
27 Correct 27 ms 384 KB Output is correct
28 Correct 24 ms 384 KB Output is correct
29 Correct 29 ms 384 KB Output is correct
30 Correct 14 ms 416 KB Output is correct
31 Correct 45 ms 384 KB Output is correct
32 Correct 76 ms 384 KB Output is correct
33 Correct 45 ms 416 KB Output is correct
34 Correct 128 ms 384 KB Output is correct
35 Correct 98 ms 384 KB Output is correct
36 Correct 125 ms 384 KB Output is correct
37 Correct 100 ms 384 KB Output is correct
38 Correct 124 ms 384 KB Output is correct
39 Correct 92 ms 384 KB Output is correct
40 Correct 99 ms 384 KB Output is correct
41 Correct 101 ms 384 KB Output is correct
42 Correct 100 ms 384 KB Output is correct
43 Correct 98 ms 384 KB Output is correct
44 Correct 94 ms 384 KB Output is correct
45 Correct 99 ms 384 KB Output is correct
46 Correct 91 ms 384 KB Output is correct
47 Correct 125 ms 384 KB Output is correct
48 Correct 89 ms 384 KB Output is correct
49 Correct 130 ms 384 KB Output is correct
50 Correct 89 ms 384 KB Output is correct
51 Correct 96 ms 384 KB Output is correct
52 Correct 91 ms 384 KB Output is correct
53 Correct 129 ms 384 KB Output is correct
54 Correct 94 ms 384 KB Output is correct
55 Correct 127 ms 384 KB Output is correct
56 Correct 123 ms 384 KB Output is correct
57 Correct 50 ms 428 KB Output is correct
58 Correct 125 ms 384 KB Output is correct
59 Correct 100 ms 384 KB Output is correct
60 Correct 97 ms 384 KB Output is correct