oj.uz

Submission #956333

# Submission time Handle Problem Language Result Execution time Memory
956333 2024-04-01T16:06:00 Z steveonalex Xylophone (JOI18_xylophone) C++17
100 / 100
 73 ms 768 KB 
#include <bits/stdc++.h>
#include "xylophone.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

// int query(int l, int r){
//     cout << "? " << l << " " << r << endl;
//     int verdict; cin >> verdict; 
//     return verdict;
// }

// void answer(int i, int j){
//     cout << "! " << i << " " << j << endl;
// }

void solve(int n){
    vector<int> diff(n+1);
    for(int i= 1; i<n; ++i){
        diff[i] = query(i, i + 1);
    }
    vector<int> nigga(n+1);
    for(int i = 2; i<n; ++i){
        if (diff[i-1] + diff[i] > query(i-1, i+1)) nigga[i] = 1;
        nigga[i] ^= nigga[i-1];
    }

    for(int i= 2; i<n; ++i) if (nigga[i]) diff[i] *= -1;

    pair<int, int> ma = {1, 1};
    for(int i = 1; i<n; ++i){
        int sum = 0;
        for(int j = i; j<n; ++j){
            sum += diff[j];
            if (abs(sum) == n - 1) {
                ma = {i, j + 1};
            }
        }
    }

    for(int i = n; i>=2; --i) swap(diff[i], diff[i-1]);
    for(int i = 2; i<=n; ++i) diff[i] += diff[i-1];
    if (diff[ma.first] > 0 || diff[ma.second] < 0){
        for(int i = 1; i<=n; ++i) diff[i] *= -1;
    }

    vector<int> ans(n+1);
    for(int i= 1; i<=n; ++i) ans[i] = 1 - diff[ma.first] + diff[i];
    for(int i = 1; i<=n; ++i) answer(i, ans[i]);
}

// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//     solve(5);

//     return 0;
// }

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 2 ms 436 KB Output is correct
17 Correct 4 ms 692 KB Output is correct
18 Correct 8 ms 700 KB Output is correct
19 Correct 12 ms 444 KB Output is correct
20 Correct 9 ms 440 KB Output is correct
21 Correct 8 ms 696 KB Output is correct
22 Correct 10 ms 440 KB Output is correct
23 Correct 8 ms 704 KB Output is correct
24 Correct 8 ms 696 KB Output is correct
25 Correct 7 ms 448 KB Output is correct
26 Correct 10 ms 444 KB Output is correct
27 Correct 8 ms 696 KB Output is correct
28 Correct 9 ms 696 KB Output is correct
29 Correct 8 ms 448 KB Output is correct
30 Correct 11 ms 704 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 2 ms 436 KB Output is correct
17 Correct 4 ms 692 KB Output is correct
18 Correct 8 ms 700 KB Output is correct
19 Correct 12 ms 444 KB Output is correct
20 Correct 9 ms 440 KB Output is correct
21 Correct 8 ms 696 KB Output is correct
22 Correct 10 ms 440 KB Output is correct
23 Correct 8 ms 704 KB Output is correct
24 Correct 8 ms 696 KB Output is correct
25 Correct 7 ms 448 KB Output is correct
26 Correct 10 ms 444 KB Output is correct
27 Correct 8 ms 696 KB Output is correct
28 Correct 9 ms 696 KB Output is correct
29 Correct 8 ms 448 KB Output is correct
30 Correct 11 ms 704 KB Output is correct
31 Correct 23 ms 448 KB Output is correct
32 Correct 41 ms 700 KB Output is correct
33 Correct 73 ms 688 KB Output is correct
34 Correct 59 ms 456 KB Output is correct
35 Correct 55 ms 756 KB Output is correct
36 Correct 66 ms 452 KB Output is correct
37 Correct 68 ms 768 KB Output is correct
38 Correct 70 ms 752 KB Output is correct
39 Correct 54 ms 452 KB Output is correct
40 Correct 65 ms 752 KB Output is correct
41 Correct 59 ms 732 KB Output is correct
42 Correct 72 ms 692 KB Output is correct
43 Correct 64 ms 712 KB Output is correct
44 Correct 71 ms 500 KB Output is correct
45 Correct 55 ms 760 KB Output is correct
46 Correct 61 ms 516 KB Output is correct
47 Correct 66 ms 708 KB Output is correct
48 Correct 51 ms 532 KB Output is correct
49 Correct 60 ms 472 KB Output is correct
50 Correct 58 ms 520 KB Output is correct
51 Correct 56 ms 500 KB Output is correct
52 Correct 51 ms 492 KB Output is correct
53 Correct 49 ms 756 KB Output is correct
54 Correct 53 ms 520 KB Output is correct
55 Correct 58 ms 504 KB Output is correct
56 Correct 68 ms 508 KB Output is correct
57 Correct 55 ms 712 KB Output is correct
58 Correct 61 ms 716 KB Output is correct
59 Correct 54 ms 452 KB Output is correct
60 Correct 71 ms 500 KB Output is correct