oj.uz

Submission #313435

# Submission time Handle Problem Language Result Execution time Memory
313435 2020-10-16T00:58:02 Z jainbot27 Xylophone (JOI18_xylophone) C++17
100 / 100
 140 ms 504 KB 
#include <bits/stdc++.h>
#ifndef ACMX
#include "xylophone.h"
#endif
using namespace std;

#define f first
#define s second
#define pb push_back
#define ar array
#define all(x) x.begin(), x.end()
#define siz(x) (int)x.size()

#define FOR(x, y, z) for(int x = (y); x < (z); x++)
#define ROF(x, z, y) for(int x = (y-1); x >= (z); x--)
#define F0R(x, z) FOR(x, 0, z)
#define R0F(x, z) ROF(x, 0, z)
#define trav(x, y) for(auto&x:y)

using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;

template<class T> inline bool ckmin(T&a, T b) {return b < a ? a = b, 1 : 0;}
template<class T> inline bool ckmax(T&a, T b) {return b > a ? a = b, 1 : 0;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const char nl = '\n';
const int mxN = 2e5 + 10;
const int MOD = 1e9 + 7;
const long long infLL = 1e18;

#ifdef ACMX
int query(int a, int b){
    cout << a << " " << b << endl;
    int res; cin >> res;
    return res;
}
void answer(int i, int x){
    cout << i << ' ' << x << endl;
}
#endif
void solve(int N){
    vi a(N + 1);
    a[1] = 0;
    a[2] = query(1, 2);
    FOR(i, 2, N){
        int t = query(i, i+1);
        int u = query(i-1, i+1);
        if(t + abs(a[i] - a[i-1]) == u){
            if(a[i] - a[i-1] >= 0) a[i+1] = a[i] + t;
            else a[i+1] = a[i] - t;
        }
        else{
            if(a[i] - a[i-1] >= 0) a[i+1] = a[i] - t;
            else a[i+1] = a[i] + t;
        }
    }
    int mn = *min_element(1+all(a));
    FOR(i, 1, N+1) a[i] -= mn;
    int l, r;
    FOR(i, 1, N+1){
        if(a[i] == 0) l = i;
        if(a[i] == N-1) r = i;
    }
    FOR(i, 1, N+1){
        if(l < r){
            answer(i, a[i]+1);
        }
        else{
            answer(i, N-a[i]);
        }
    }
}

#ifdef ACMX
int32_t main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    solve(5);

    return 0;
}
#endif

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:69:9: warning: 'r' may be used uninitialized in this function [-Wmaybe-uninitialized]
   69 |         if(l < r){
      |         ^~
xylophone.cpp:69:9: warning: 'l' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 3 ms 256 KB Output is correct
7 Correct 3 ms 256 KB Output is correct
8 Correct 3 ms 256 KB Output is correct
9 Correct 3 ms 256 KB Output is correct
10 Correct 3 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 3 ms 256 KB Output is correct
13 Correct 3 ms 256 KB Output is correct
14 Correct 3 ms 256 KB Output is correct
15 Correct 3 ms 256 KB Output is correct
16 Correct 6 ms 256 KB Output is correct
17 Correct 11 ms 256 KB Output is correct
18 Correct 16 ms 376 KB Output is correct
19 Correct 27 ms 360 KB Output is correct
20 Correct 20 ms 384 KB Output is correct
21 Correct 18 ms 384 KB Output is correct
22 Correct 16 ms 256 KB Output is correct
23 Correct 22 ms 384 KB Output is correct
24 Correct 23 ms 376 KB Output is correct
25 Correct 18 ms 376 KB Output is correct
26 Correct 26 ms 376 KB Output is correct
27 Correct 21 ms 256 KB Output is correct
28 Correct 26 ms 376 KB Output is correct
29 Correct 25 ms 384 KB Output is correct
30 Correct 17 ms 256 KB Output is correct
31 Correct 53 ms 384 KB Output is correct
32 Correct 78 ms 388 KB Output is correct
33 Correct 93 ms 388 KB Output is correct
34 Correct 54 ms 384 KB Output is correct
35 Correct 96 ms 384 KB Output is correct
36 Correct 121 ms 360 KB Output is correct
37 Correct 122 ms 392 KB Output is correct
38 Correct 94 ms 408 KB Output is correct
39 Correct 77 ms 388 KB Output is correct
40 Correct 127 ms 392 KB Output is correct
41 Correct 140 ms 384 KB Output is correct
42 Correct 58 ms 388 KB Output is correct
43 Correct 122 ms 504 KB Output is correct
44 Correct 119 ms 392 KB Output is correct
45 Correct 119 ms 388 KB Output is correct
46 Correct 93 ms 404 KB Output is correct
47 Correct 85 ms 384 KB Output is correct
48 Correct 80 ms 384 KB Output is correct
49 Correct 65 ms 392 KB Output is correct
50 Correct 88 ms 384 KB Output is correct
51 Correct 129 ms 384 KB Output is correct
52 Correct 99 ms 388 KB Output is correct
53 Correct 97 ms 392 KB Output is correct
54 Correct 93 ms 388 KB Output is correct
55 Correct 110 ms 392 KB Output is correct
56 Correct 131 ms 396 KB Output is correct
57 Correct 94 ms 384 KB Output is correct
58 Correct 87 ms 384 KB Output is correct
59 Correct 104 ms 392 KB Output is correct
60 Correct 131 ms 384 KB Output is correct