oj.uz

Submission #924787

# Submission time Handle Problem Language Result Execution time Memory
924787 2024-02-09T16:47:54 Z boris_mihov Xylophone (JOI18_xylophone) C++17
100 / 100
 54 ms 1104 KB 
#include "xylophone.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <chrono>
#include <random>

typedef long long llong;
const int MAXN = 5000 + 10;

int a[MAXN];
bool isTaken[MAXN];
void solve(int n) 
{
    int l = 1, r = n, mid;
    while (l < r - 1)
    {
        mid = (l + r) / 2;
        if (query(1, mid) < n - 1) l = mid;
        else r = mid;
    }

    a[r] = n;
    if (r > 1) 
    {
        a[r - 1] = a[r] - query(r - 1, r);
        isTaken[a[r - 1]] = true;
    }
    if (r < n) 
    {
        a[r + 1] = a[r] - query(r, r + 1);
        isTaken[a[r + 1]] = true;
    }

    isTaken[a[r]] = true;
    for (int pos = r + 2 ; pos <= n ; ++pos)
    {
        int curr = query(pos - 1, pos);
        if (a[pos - 1] - curr <= 0 || isTaken[a[pos - 1] - curr])
        {
            a[pos] = a[pos - 1] + curr;
            continue;
        }

        if (a[pos - 1] - curr > n || isTaken[a[pos - 1] + curr])
        {
            a[pos] = a[pos - 1] - curr;
            continue;
        }
        
        int all = query(pos - 2, pos);
        if ((all == curr + abs(a[pos - 1] - a[pos - 2])) ^ (a[pos - 2] > a[pos - 1]))
        {
            a[pos] = a[pos - 1] + curr;
        } else
        {
            a[pos] = a[pos - 1] - curr;
        }

        isTaken[a[pos]] = true;
    }

    for (int pos = r - 2 ; pos >= 1 ; --pos)
    {
        int curr = query(pos, pos + 1);
        if (a[pos + 1] - curr <= 0 || isTaken[a[pos + 1] - curr])
        {
            a[pos] = a[pos + 1] + curr;
            continue;
        }

        if (a[pos + 1] - curr > n || isTaken[a[pos + 1] + curr])
        {
            a[pos] = a[pos + 1] - curr;
            continue;
        }
        
        int all = query(pos, pos + 2);
        if ((all == curr + abs(a[pos + 1] - a[pos + 2])) ^ (a[pos + 2] > a[pos + 1]))
        {
            a[pos] = a[pos + 1] + curr;
        } else
        {
            a[pos] = a[pos + 1] - curr;
        }

        isTaken[a[pos]] = true;
    }

    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 0 ms 344 KB Output is correct
2 Correct 1 ms 444 KB Output is correct
3 Correct 1 ms 440 KB Output is correct
4 Correct 1 ms 440 KB Output is correct
5 Correct 1 ms 440 KB Output is correct
6 Correct 1 ms 440 KB Output is correct
7 Correct 1 ms 444 KB Output is correct
8 Correct 1 ms 444 KB Output is correct
9 Correct 1 ms 440 KB Output is correct
10 Correct 1 ms 688 KB Output is correct
11 Correct 1 ms 440 KB Output is correct
12 Correct 1 ms 440 KB Output is correct
13 Correct 1 ms 440 KB Output is correct
14 Correct 1 ms 440 KB Output is correct
15 Correct 1 ms 444 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 1 ms 444 KB Output is correct
3 Correct 1 ms 440 KB Output is correct
4 Correct 1 ms 440 KB Output is correct
5 Correct 1 ms 440 KB Output is correct
6 Correct 1 ms 440 KB Output is correct
7 Correct 1 ms 444 KB Output is correct
8 Correct 1 ms 444 KB Output is correct
9 Correct 1 ms 440 KB Output is correct
10 Correct 1 ms 688 KB Output is correct
11 Correct 1 ms 440 KB Output is correct
12 Correct 1 ms 440 KB Output is correct
13 Correct 1 ms 440 KB Output is correct
14 Correct 1 ms 440 KB Output is correct
15 Correct 1 ms 444 KB Output is correct
16 Correct 2 ms 436 KB Output is correct
17 Correct 3 ms 692 KB Output is correct
18 Correct 9 ms 700 KB Output is correct
19 Correct 6 ms 692 KB Output is correct
20 Correct 6 ms 440 KB Output is correct
21 Correct 6 ms 948 KB Output is correct
22 Correct 6 ms 696 KB Output is correct
23 Correct 8 ms 440 KB Output is correct
24 Correct 6 ms 704 KB Output is correct
25 Correct 5 ms 952 KB Output is correct
26 Correct 6 ms 700 KB Output is correct
27 Correct 8 ms 692 KB Output is correct
28 Correct 7 ms 696 KB Output is correct
29 Correct 7 ms 448 KB Output is correct
30 Correct 7 ms 700 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 1 ms 444 KB Output is correct
3 Correct 1 ms 440 KB Output is correct
4 Correct 1 ms 440 KB Output is correct
5 Correct 1 ms 440 KB Output is correct
6 Correct 1 ms 440 KB Output is correct
7 Correct 1 ms 444 KB Output is correct
8 Correct 1 ms 444 KB Output is correct
9 Correct 1 ms 440 KB Output is correct
10 Correct 1 ms 688 KB Output is correct
11 Correct 1 ms 440 KB Output is correct
12 Correct 1 ms 440 KB Output is correct
13 Correct 1 ms 440 KB Output is correct
14 Correct 1 ms 440 KB Output is correct
15 Correct 1 ms 444 KB Output is correct
16 Correct 2 ms 436 KB Output is correct
17 Correct 3 ms 692 KB Output is correct
18 Correct 9 ms 700 KB Output is correct
19 Correct 6 ms 692 KB Output is correct
20 Correct 6 ms 440 KB Output is correct
21 Correct 6 ms 948 KB Output is correct
22 Correct 6 ms 696 KB Output is correct
23 Correct 8 ms 440 KB Output is correct
24 Correct 6 ms 704 KB Output is correct
25 Correct 5 ms 952 KB Output is correct
26 Correct 6 ms 700 KB Output is correct
27 Correct 8 ms 692 KB Output is correct
28 Correct 7 ms 696 KB Output is correct
29 Correct 7 ms 448 KB Output is correct
30 Correct 7 ms 700 KB Output is correct
31 Correct 18 ms 704 KB Output is correct
32 Correct 24 ms 936 KB Output is correct
33 Correct 36 ms 700 KB Output is correct
34 Correct 33 ms 696 KB Output is correct
35 Correct 35 ms 956 KB Output is correct
36 Correct 45 ms 964 KB Output is correct
37 Correct 35 ms 692 KB Output is correct
38 Correct 31 ms 948 KB Output is correct
39 Correct 38 ms 696 KB Output is correct
40 Correct 44 ms 948 KB Output is correct
41 Correct 32 ms 696 KB Output is correct
42 Correct 35 ms 944 KB Output is correct
43 Correct 38 ms 440 KB Output is correct
44 Correct 35 ms 696 KB Output is correct
45 Correct 32 ms 692 KB Output is correct
46 Correct 35 ms 952 KB Output is correct
47 Correct 51 ms 732 KB Output is correct
48 Correct 37 ms 456 KB Output is correct
49 Correct 43 ms 1104 KB Output is correct
50 Correct 54 ms 448 KB Output is correct
51 Correct 34 ms 692 KB Output is correct
52 Correct 35 ms 680 KB Output is correct
53 Correct 48 ms 952 KB Output is correct
54 Correct 40 ms 448 KB Output is correct
55 Correct 34 ms 696 KB Output is correct
56 Correct 45 ms 708 KB Output is correct
57 Correct 36 ms 704 KB Output is correct
58 Correct 39 ms 692 KB Output is correct
59 Correct 44 ms 452 KB Output is correct
60 Correct 36 ms 688 KB Output is correct