oj.uz

Submission #704267

# Submission time Handle Problem Language Result Execution time Memory
704267 2023-03-02T02:19:18 Z CDuong Xylophone (JOI18_xylophone) C++17
100 / 100
 125 ms 364 KB 
/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,sse4.2,popcnt,lzcnt")
*/

#include <bits/stdc++.h>
#include "xylophone.h"
#define taskname ""
#define all(x) x.begin(), x.end()
#define ll long long
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define pii pair<int, int>
#define vi vector<int>
using namespace std;

const int mxN = 5e3 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e18;

void solve(int N) {
    int n = N;
    if(n == 2) {
        answer(1, 1);
        answer(2, 2);
        return;
    }
    int diff_1[n + 5], diff_2[n + 5];
    for(int i = 1; i <= n - 1; ++i)
        diff_1[i] = query(i, i + 1);
    for(int i = 1; i <= n - 2; ++i)
        diff_2[i] = query(i, i + 2);
    int diff[n + 5]; diff[1] = 0;
    bool last_time = true;
    for(int i = 1; i <= n - 2; ++i) {
        if(diff_1[i] + diff_1[i + 1] == diff_2[i]) {
            if(last_time) {
                diff[i + 1] = diff[i] + diff_1[i];
                diff[i + 2] = diff[i] + diff_2[i];
            }
            else {
                diff[i + 1] = diff[i] - diff_1[i];
                diff[i + 2] = diff[i] - diff_2[i];
            }
        }
        else {
            if(last_time) {
                diff[i + 1] = diff[i] + diff_1[i];
                diff[i + 2] = diff[i] + diff_1[i] - diff_1[i + 1];
            }
            else {
                diff[i + 1] = diff[i] - diff_1[i];
                diff[i + 2] = diff[i] - diff_1[i] + diff_1[i + 1];
            }
            last_time ^= 1;
        }
    }

    int pos_max = 1, pos_min = 1, cur_max = 0, cur_min = 0;
    for(int i = 2; i <= n; ++i) {
        cur_max = max(cur_max, diff[i]);
        cur_min = min(cur_min, diff[i]);
        pos_max = (cur_max == diff[i] ? i : pos_max);
        pos_min = (cur_min == diff[i] ? i : pos_min);
    }

    // for(int i = 1; i <= n; ++i)
    //     cout << i << " " << diff[i] << endl;
    // cout << endl;

    int coef = 1;
    if(pos_max < pos_min)
        coef = -1;

    int first_element = 1 - diff[min(pos_min, pos_max)] * coef;
    answer(1, first_element);
    for(int i = 2; i <= n; ++i)
        answer(i, first_element + diff[i] * coef);
}

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 3 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 2 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 2 ms 208 KB Output is correct
13 Correct 3 ms 208 KB Output is correct
14 Correct 3 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 5 ms 208 KB Output is correct
17 Correct 9 ms 208 KB Output is correct
18 Correct 16 ms 208 KB Output is correct
19 Correct 20 ms 284 KB Output is correct
20 Correct 14 ms 208 KB Output is correct
21 Correct 22 ms 288 KB Output is correct
22 Correct 14 ms 304 KB Output is correct
23 Correct 24 ms 284 KB Output is correct
24 Correct 15 ms 208 KB Output is correct
25 Correct 15 ms 208 KB Output is correct
26 Correct 19 ms 208 KB Output is correct
27 Correct 25 ms 288 KB Output is correct
28 Correct 15 ms 208 KB Output is correct
29 Correct 16 ms 284 KB Output is correct
30 Correct 15 ms 208 KB Output is correct
31 Correct 49 ms 208 KB Output is correct
32 Correct 46 ms 300 KB Output is correct
33 Correct 60 ms 312 KB Output is correct
34 Correct 104 ms 324 KB Output is correct
35 Correct 125 ms 364 KB Output is correct
36 Correct 63 ms 316 KB Output is correct
37 Correct 109 ms 312 KB Output is correct
38 Correct 63 ms 336 KB Output is correct
39 Correct 81 ms 312 KB Output is correct
40 Correct 92 ms 316 KB Output is correct
41 Correct 102 ms 312 KB Output is correct
42 Correct 88 ms 336 KB Output is correct
43 Correct 76 ms 336 KB Output is correct
44 Correct 80 ms 336 KB Output is correct
45 Correct 77 ms 316 KB Output is correct
46 Correct 87 ms 348 KB Output is correct
47 Correct 86 ms 316 KB Output is correct
48 Correct 85 ms 336 KB Output is correct
49 Correct 76 ms 316 KB Output is correct
50 Correct 92 ms 324 KB Output is correct
51 Correct 87 ms 312 KB Output is correct
52 Correct 70 ms 336 KB Output is correct
53 Correct 99 ms 336 KB Output is correct
54 Correct 102 ms 336 KB Output is correct
55 Correct 95 ms 324 KB Output is correct
56 Correct 84 ms 316 KB Output is correct
57 Correct 97 ms 316 KB Output is correct
58 Correct 100 ms 316 KB Output is correct
59 Correct 100 ms 312 KB Output is correct
60 Correct 100 ms 312 KB Output is correct