oj.uz

Submission #590474

# Submission time Handle Problem Language Result Execution time Memory
590474 2022-07-06T02:52:15 Z tamthegod Xylophone (JOI18_xylophone) C++14
100 / 100
 67 ms 448 KB 
#include<bits/stdc++.h>
#include "xylophone.h"

#define pb push_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 5000 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e18;
int res[maxN];
int vis[maxN];
int random(int l, int r)
{
    return l + (rng() % (r - l + 1));
}
void solve(int n)
{
    int low = 1, high = n, mid;
    while(low <= high)
    {
        mid = (low + high) / 2;
        if(query(mid, n) == n - 1) low = mid + 1;
        else high = mid -1;
    }
    low--;
    res[low] = 1;
    //cout << query(1, 2);exit(0);
    if(low > 1)
    {
        res[low - 1] = 1 + query(low - 1, low);
    }
    vis[res[low]] = vis[res[low - 1]] = vis[res[low + 1]] = 1;
    if(low < n) res[low + 1] = 1 + query(low, low + 1);
    for(int i=low-2; i>=1; i--)
    {
        int val1 = query(i, i + 1);
        if(res[i + 1] + val1 > n || vis[res[i + 1] + val1])
        {
            res[i] = res[i + 1] - val1;
            vis[res[i]] = 1;
            continue;
        }
        if(res[i + 1] - val1 < 1 || vis[res[i + 1] - val1])
        {
            res[i] = res[i + 1] + val1;
            vis[res[i]] = 1;
            continue;
        }
        int val2 = query(i, i + 2);
        if(res[i + 1] > res[i + 2])
        {
            if(res[i + 1] - res[i + 2] == val2)
            {
                res[i] = res[i + 1] - val1;
            }
            else
            {
                int val = res[i + 2] + val2;
                if(val - res[i + 1] == val1) res[i] = val;
                else res[i] = res[i + 1] - val2;
            }
        }
        else
        {
            if(res[i + 2] - res[i + 1] == val2)
            {
                res[i] = res[i + 1] + val1;
            }
            else
            {
                int val = res[i + 2] - val2;
                if(res[i + 1] - val == val1) res[i] = val;
                else res[i] = res[i + 1] + val2;
            }
        }
        vis[res[i]] = 1;
    }
    for(int i=low+2; i<=n; i++)
    {
        int val1 = query(i - 1, i);
        if(res[i - 1] + val1 > n || vis[res[i - 1] + val1])
        {
            res[i] = res[i - 1] - val1;
            vis[res[i]] = 1;
            continue;
        }
        if(res[i - 1] - val1 < 1 || vis[res[i - 1] - val1])
        {
            res[i] = res[i - 1] + val1;
            vis[res[i]] = 1;
            continue;
        }
        int val2 = query(i - 2, i);
        if(res[i - 1] > res[i - 2])
        {
            if(res[i - 1] - res[i - 2] == val2)
            {
                res[i] = res[i - 1] - val1;
            }
            else
            {
                int val = res[i - 2] + val2;
                if(val - res[i - 1] == val1) res[i] = val;
                else res[i] = res[i - 1] - val2;
            }
        }
        else
        {
            if(res[i - 2] - res[i - 1] == val2)
            {
                res[i] = res[i - 1] + val1;
            }
            else
            {
                int val = res[i - 2] - val2;
                if(res[i - 1] - val == val1) res[i] = val;
                else res[i] = res[i - 1] + val2;
            }
        }
        vis[res[i]] = 1;
    }
    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 208 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 228 KB Output is correct
9 Correct 2 ms 288 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 2 ms 208 KB Output is correct
15 Correct 1 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 208 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 228 KB Output is correct
9 Correct 2 ms 288 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 2 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 4 ms 208 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 10 ms 208 KB Output is correct
19 Correct 12 ms 308 KB Output is correct
20 Correct 12 ms 208 KB Output is correct
21 Correct 5 ms 308 KB Output is correct
22 Correct 12 ms 208 KB Output is correct
23 Correct 9 ms 316 KB Output is correct
24 Correct 8 ms 208 KB Output is correct
25 Correct 8 ms 208 KB Output is correct
26 Correct 10 ms 208 KB Output is correct
27 Correct 12 ms 208 KB Output is correct
28 Correct 12 ms 208 KB Output is correct
29 Correct 10 ms 208 KB Output is correct
30 Correct 12 ms 312 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 208 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 2 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 2 ms 228 KB Output is correct
9 Correct 2 ms 288 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 2 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 4 ms 208 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 10 ms 208 KB Output is correct
19 Correct 12 ms 308 KB Output is correct
20 Correct 12 ms 208 KB Output is correct
21 Correct 5 ms 308 KB Output is correct
22 Correct 12 ms 208 KB Output is correct
23 Correct 9 ms 316 KB Output is correct
24 Correct 8 ms 208 KB Output is correct
25 Correct 8 ms 208 KB Output is correct
26 Correct 10 ms 208 KB Output is correct
27 Correct 12 ms 208 KB Output is correct
28 Correct 12 ms 208 KB Output is correct
29 Correct 10 ms 208 KB Output is correct
30 Correct 12 ms 312 KB Output is correct
31 Correct 30 ms 304 KB Output is correct
32 Correct 27 ms 316 KB Output is correct
33 Correct 40 ms 320 KB Output is correct
34 Correct 25 ms 328 KB Output is correct
35 Correct 55 ms 448 KB Output is correct
36 Correct 36 ms 312 KB Output is correct
37 Correct 38 ms 324 KB Output is correct
38 Correct 44 ms 320 KB Output is correct
39 Correct 27 ms 336 KB Output is correct
40 Correct 64 ms 324 KB Output is correct
41 Correct 56 ms 324 KB Output is correct
42 Correct 40 ms 328 KB Output is correct
43 Correct 43 ms 432 KB Output is correct
44 Correct 33 ms 316 KB Output is correct
45 Correct 48 ms 336 KB Output is correct
46 Correct 49 ms 328 KB Output is correct
47 Correct 67 ms 324 KB Output is correct
48 Correct 51 ms 332 KB Output is correct
49 Correct 50 ms 332 KB Output is correct
50 Correct 62 ms 320 KB Output is correct
51 Correct 56 ms 328 KB Output is correct
52 Correct 26 ms 376 KB Output is correct
53 Correct 47 ms 324 KB Output is correct
54 Correct 51 ms 320 KB Output is correct
55 Correct 57 ms 328 KB Output is correct
56 Correct 60 ms 316 KB Output is correct
57 Correct 66 ms 320 KB Output is correct
58 Correct 38 ms 444 KB Output is correct
59 Correct 39 ms 340 KB Output is correct
60 Correct 58 ms 328 KB Output is correct