oj.uz

Submission #469159

# Submission time Handle Problem Language Result Execution time Memory
469159 2021-08-31T02:09:03 Z Killer2501 Xylophone (JOI18_xylophone) C++14
100 / 100
 133 ms 452 KB 
#include <bits/stdc++.h>
#include "xylophone.h"

#define ll long long
#define pb push_back
using namespace std;
const int N = 1e5 + 5;
int n, m, a[N], b[N], x[N];

void solve(int n)
{
    //cout << "ok" << '\n';
    for (int i = 2; i <= n; i++)
    {
        a[i] = query(i - 1, i);
    }

    b[2] = 1;

    for (int i = 3; i <= n; i++)
    {
        if (a[i] + a[i - 1] == query(i - 2, i))
            b[i] = b[i - 1];
        else
            b[i] = -b[i - 1];
    }

    int mx = 0, mn = 0, idn = 1, idx = 1;
    for (int i = 2; i <= n; i++)
    {
        a[i] = a[i] * b[i] + a[i - 1];
        if (a[i] > mx)
        {
            idx = i;
            mx = a[i];
        }
        if (a[i] < mn)
        {
            idn = i;
            mn = a[i];
        }
        //cout << a[i] << " ";
    }
    //cout << '\n';
    //cout << idn << " " << idx << '\n';
    if (idn < idx)
    {
        for (int i = 1; i <= n; i++)
            a[i] += 1 - mn;
    }
    else
        for (int i = 1; i <= n; i++)
            a[i] = -a[i] + mn + n;
    for (int i = 1; i <= n; i++)
        answer(i, a[i]);
}

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 3 ms 308 KB Output is correct
5 Correct 2 ms 200 KB Output is correct
6 Correct 2 ms 200 KB Output is correct
7 Correct 3 ms 200 KB Output is correct
8 Correct 3 ms 200 KB Output is correct
9 Correct 3 ms 200 KB Output is correct
10 Correct 3 ms 200 KB Output is correct
11 Correct 2 ms 200 KB Output is correct
12 Correct 2 ms 292 KB Output is correct
13 Correct 2 ms 200 KB Output is correct
14 Correct 3 ms 200 KB Output is correct
15 Correct 2 ms 200 KB Output is correct
16 Correct 5 ms 200 KB Output is correct
17 Correct 9 ms 304 KB Output is correct
18 Correct 19 ms 200 KB Output is correct
19 Correct 25 ms 412 KB Output is correct
20 Correct 23 ms 296 KB Output is correct
21 Correct 20 ms 300 KB Output is correct
22 Correct 18 ms 200 KB Output is correct
23 Correct 18 ms 200 KB Output is correct
24 Correct 21 ms 308 KB Output is correct
25 Correct 18 ms 200 KB Output is correct
26 Correct 25 ms 288 KB Output is correct
27 Correct 23 ms 332 KB Output is correct
28 Correct 10 ms 320 KB Output is correct
29 Correct 27 ms 300 KB Output is correct
30 Correct 19 ms 200 KB Output is correct
31 Correct 44 ms 296 KB Output is correct
32 Correct 49 ms 448 KB Output is correct
33 Correct 105 ms 320 KB Output is correct
34 Correct 112 ms 320 KB Output is correct
35 Correct 65 ms 324 KB Output is correct
36 Correct 106 ms 416 KB Output is correct
37 Correct 85 ms 356 KB Output is correct
38 Correct 121 ms 432 KB Output is correct
39 Correct 105 ms 448 KB Output is correct
40 Correct 52 ms 416 KB Output is correct
41 Correct 124 ms 440 KB Output is correct
42 Correct 133 ms 312 KB Output is correct
43 Correct 128 ms 300 KB Output is correct
44 Correct 116 ms 420 KB Output is correct
45 Correct 127 ms 320 KB Output is correct
46 Correct 120 ms 300 KB Output is correct
47 Correct 112 ms 440 KB Output is correct
48 Correct 129 ms 304 KB Output is correct
49 Correct 86 ms 308 KB Output is correct
50 Correct 89 ms 312 KB Output is correct
51 Correct 121 ms 304 KB Output is correct
52 Correct 131 ms 320 KB Output is correct
53 Correct 77 ms 320 KB Output is correct
54 Correct 56 ms 320 KB Output is correct
55 Correct 121 ms 284 KB Output is correct
56 Correct 79 ms 452 KB Output is correct
57 Correct 127 ms 332 KB Output is correct
58 Correct 90 ms 320 KB Output is correct
59 Correct 66 ms 448 KB Output is correct
60 Correct 106 ms 320 KB Output is correct