oj.uz

Submission #590494

# Submission time Handle Problem Language Result Execution time Memory
590494 2022-07-06T03:58:04 Z messiuuuuu Xylophone (JOI18_xylophone) C++14
100 / 100
 66 ms 452 KB 
#include<bits/stdc++.h>
#include <xylophone.h>
#define task "main"
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
using namespace std;
const int MAXN = 1e5 + 5;
const ll INF = 1e18 + 5;

int res[MAXN];
bool ava[MAXN];

void solve(int n)
{
    int l = 1, r = n;
    while (l <= r)
    {
        int mid = (l + r) / 2;
        if (query(mid, n) == n - 1)
            l = mid + 1;
        else
            r = mid - 1;
    }
    res[r] = 1;
    ava[1] = 1;
    if (r < n)
    {
        res[r + 1] = 1 + query(r, r + 1);
        ava[res[r + 1]] = 1;
        for (int i = r + 2; i <= n; i++)
        {
            int b = query(i - 1, i);
            if (res[i - 1] + b > n || ava[res[i - 1] + b])
            {
                res[i] = res[i - 1] - b;
                ava[res[i]] = 1;
                continue;
            }
            if (res[i - 1] - b < 1 || ava[res[i - 1] - b])
            {
                res[i] = res[i - 1] + b;
                ava[res[i]] = 1;
                continue;
            }
            int a = query(i - 2, i);
            if (res[i - 1] > res[i - 2])
            {
                if (res[i - 1] + b == a + res[i - 2])
                    res[i] = res[i - 1] + b;
                else
                    res[i] = res[i - 1] - b;
            }
            else
            {
                if (res[i - 2] - a == res[i - 1] - b)
                {
                    res[i] = res[i - 1] - b;
                } else
                {
                    res[i] = res[i - 1] + b;
                }
            }
            ava[res[i]] = 1;
        }
    }
    if (r > 1)
    {
        res[r - 1] = 1 + query(r - 1, r);
        ava[res[r - 1]] = true;
        for (int i = r - 2; i >= 1; -- i)
        {
            int b = query(i, i + 1);
            if (res[i + 1] + b > n || ava[res[i + 1] + b])
            {
                res[i] = res[i + 1] - b;
                ava[res[i]] = true;
                continue;
            }
            if (res[i + 1] - b < 1 || ava[res[i + 1] - b])
            {
                res[i] = res[i + 1] + b;
                ava[res[i]] = true;
                continue;
            }
            int a = query(i, i + 2);
            if (res[i + 2] > res[i + 1])
            {
                if (res[i + 1] - b == res[i + 2] - a)
                {
                    res[i] = res[i + 1] - b;
                }
                else
                {
                    res[i] = res[i + 1] + b;
                }
            }
            else
            {
                if (res[i + 1] + b == res[i + 2] + a)
                {
                    res[i] = res[i + 1] + b;
                }
                else
                {
                    res[i] = res[i + 1] - b;
                }
            }
        }
    }
    for (int i = 1; i <= n; ++ i)
    {
        answer(i, res[i]);
    }
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 312 KB Output is correct
3 Correct 2 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 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 1 ms 308 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 2 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 0 ms 312 KB Output is correct
3 Correct 2 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 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 1 ms 308 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 4 ms 208 KB Output is correct
17 Correct 7 ms 312 KB Output is correct
18 Correct 11 ms 304 KB Output is correct
19 Correct 10 ms 312 KB Output is correct
20 Correct 12 ms 308 KB Output is correct
21 Correct 13 ms 312 KB Output is correct
22 Correct 13 ms 336 KB Output is correct
23 Correct 10 ms 292 KB Output is correct
24 Correct 13 ms 208 KB Output is correct
25 Correct 9 ms 208 KB Output is correct
26 Correct 10 ms 312 KB Output is correct
27 Correct 13 ms 308 KB Output is correct
28 Correct 13 ms 208 KB Output is correct
29 Correct 5 ms 304 KB Output is correct
30 Correct 13 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 0 ms 312 KB Output is correct
3 Correct 2 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 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 1 ms 308 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 2 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 4 ms 208 KB Output is correct
17 Correct 7 ms 312 KB Output is correct
18 Correct 11 ms 304 KB Output is correct
19 Correct 10 ms 312 KB Output is correct
20 Correct 12 ms 308 KB Output is correct
21 Correct 13 ms 312 KB Output is correct
22 Correct 13 ms 336 KB Output is correct
23 Correct 10 ms 292 KB Output is correct
24 Correct 13 ms 208 KB Output is correct
25 Correct 9 ms 208 KB Output is correct
26 Correct 10 ms 312 KB Output is correct
27 Correct 13 ms 308 KB Output is correct
28 Correct 13 ms 208 KB Output is correct
29 Correct 5 ms 304 KB Output is correct
30 Correct 13 ms 208 KB Output is correct
31 Correct 26 ms 312 KB Output is correct
32 Correct 40 ms 304 KB Output is correct
33 Correct 43 ms 312 KB Output is correct
34 Correct 60 ms 304 KB Output is correct
35 Correct 65 ms 304 KB Output is correct
36 Correct 22 ms 320 KB Output is correct
37 Correct 48 ms 312 KB Output is correct
38 Correct 47 ms 308 KB Output is correct
39 Correct 33 ms 308 KB Output is correct
40 Correct 51 ms 304 KB Output is correct
41 Correct 42 ms 364 KB Output is correct
42 Correct 48 ms 312 KB Output is correct
43 Correct 45 ms 316 KB Output is correct
44 Correct 46 ms 432 KB Output is correct
45 Correct 56 ms 312 KB Output is correct
46 Correct 47 ms 312 KB Output is correct
47 Correct 65 ms 300 KB Output is correct
48 Correct 34 ms 344 KB Output is correct
49 Correct 62 ms 300 KB Output is correct
50 Correct 62 ms 428 KB Output is correct
51 Correct 43 ms 312 KB Output is correct
52 Correct 53 ms 316 KB Output is correct
53 Correct 37 ms 348 KB Output is correct
54 Correct 60 ms 340 KB Output is correct
55 Correct 64 ms 312 KB Output is correct
56 Correct 39 ms 304 KB Output is correct
57 Correct 61 ms 452 KB Output is correct
58 Correct 66 ms 316 KB Output is correct
59 Correct 30 ms 308 KB Output is correct
60 Correct 60 ms 316 KB Output is correct