oj.uz

Submission #590499

# Submission time Handle Problem Language Result Execution time Memory
590499 2022-07-06T04:06:04 Z nota Xylophone (JOI18_xylophone) C++14
100 / 100
 68 ms 436 KB 
#include<bits/stdc++.h>
#include <xylophone.h>
using namespace std;
const int maxN = 5001;
int a[maxN];
int chk[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;
    }
    answer(r, 1);
    a[r] = 1;
    chk[1] = true;
    for(int i = r - 1; i >= 1; i--)
    {
        int que = query(i, i+1);
        if(a[i+1] - que < 1)
        {
            a[i] = a[i+1] + que;
            answer(i,a[i]);
        }
        else if(a[i+1] + que > n)
        {
            a[i] = a[i+1] - que;
            answer(i,a[i]);
        }
        else
        {
            if(chk[a[i+1]-que])
            {
                a[i] = a[i+1] + que;
                answer(i, a[i]);
            }
            else if(chk[a[i+1] + que])
            {
                a[i] = a[i+1] - que;
                answer(i,a[i]);
            }
            else
            {
                int c = a[i+1] - que;
                int maxx,minn;
                maxx = max(max(c,a[i+1]),a[i+2]);
                minn = min(min(c,a[i+1]),a[i+2]);
                if(query(i,i+2) == maxx - minn)
                {
                    a[i] = c;
                    answer(i,c);
                }
                else
                {
                    a[i] = a[i+1] + que;
                    answer(i,a[i+1] + que);
                }
            }
        }
        chk[a[i]] = true;
    }
    for(int i = r + 1; i <= n; i++)
    {
        int que = query(i-1,i);
        if(a[i-1] - que < 1)
        {
            a[i] = a[i-1] + que;
            answer(i,a[i]);
        }
        else if(a[i-1] + que > n)
        {
            a[i] = a[i-1] - que;
            answer(i,a[i]);
        }
        else
        {
            if(chk[a[i-1]-que])
            {
                a[i] = a[i-1] + que;
                answer(i,a[i]);
            }
            else if(chk[a[i-1]+que])
            {
                a[i] = a[i-1] - que;
                answer(i,a[i]);
            }
            else
            {
                int c = a[i-1] - que;
                int maxx,minn;
                maxx = max(max(c,a[i-1]),a[i-2]);
                minn = min(min(c,a[i-1]),a[i-2]);
                if(query(i-2,i) == maxx - minn)
                {
                    a[i] = c;
                    answer(i,c);
                }
                else
                {
                    a[i] = a[i-1] + que;
                    answer(i,a[i-1] + que);
                }
            }
        }
        chk[a[i]] = true;
    }
}

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 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 2 ms 304 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 1 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 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 2 ms 304 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 3 ms 208 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 6 ms 208 KB Output is correct
19 Correct 12 ms 304 KB Output is correct
20 Correct 9 ms 208 KB Output is correct
21 Correct 5 ms 312 KB Output is correct
22 Correct 9 ms 336 KB Output is correct
23 Correct 8 ms 208 KB Output is correct
24 Correct 10 ms 208 KB Output is correct
25 Correct 8 ms 316 KB Output is correct
26 Correct 13 ms 308 KB Output is correct
27 Correct 11 ms 312 KB Output is correct
28 Correct 5 ms 316 KB Output is correct
29 Correct 9 ms 208 KB Output is correct
30 Correct 12 ms 420 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 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 2 ms 304 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 1 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 208 KB Output is correct
13 Correct 2 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 2 ms 208 KB Output is correct
16 Correct 3 ms 208 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 6 ms 208 KB Output is correct
19 Correct 12 ms 304 KB Output is correct
20 Correct 9 ms 208 KB Output is correct
21 Correct 5 ms 312 KB Output is correct
22 Correct 9 ms 336 KB Output is correct
23 Correct 8 ms 208 KB Output is correct
24 Correct 10 ms 208 KB Output is correct
25 Correct 8 ms 316 KB Output is correct
26 Correct 13 ms 308 KB Output is correct
27 Correct 11 ms 312 KB Output is correct
28 Correct 5 ms 316 KB Output is correct
29 Correct 9 ms 208 KB Output is correct
30 Correct 12 ms 420 KB Output is correct
31 Correct 19 ms 312 KB Output is correct
32 Correct 29 ms 304 KB Output is correct
33 Correct 35 ms 208 KB Output is correct
34 Correct 44 ms 316 KB Output is correct
35 Correct 44 ms 208 KB Output is correct
36 Correct 37 ms 208 KB Output is correct
37 Correct 39 ms 308 KB Output is correct
38 Correct 53 ms 304 KB Output is correct
39 Correct 47 ms 208 KB Output is correct
40 Correct 55 ms 436 KB Output is correct
41 Correct 58 ms 304 KB Output is correct
42 Correct 47 ms 436 KB Output is correct
43 Correct 36 ms 316 KB Output is correct
44 Correct 51 ms 304 KB Output is correct
45 Correct 59 ms 208 KB Output is correct
46 Correct 55 ms 324 KB Output is correct
47 Correct 47 ms 316 KB Output is correct
48 Correct 54 ms 312 KB Output is correct
49 Correct 68 ms 316 KB Output is correct
50 Correct 35 ms 336 KB Output is correct
51 Correct 39 ms 208 KB Output is correct
52 Correct 46 ms 208 KB Output is correct
53 Correct 50 ms 316 KB Output is correct
54 Correct 53 ms 208 KB Output is correct
55 Correct 59 ms 324 KB Output is correct
56 Correct 45 ms 208 KB Output is correct
57 Correct 54 ms 312 KB Output is correct
58 Correct 52 ms 312 KB Output is correct
59 Correct 49 ms 304 KB Output is correct
60 Correct 59 ms 208 KB Output is correct