oj.uz

Submission #302970

# Submission time Handle Problem Language Result Execution time Memory
302970 2020-09-19T15:02:23 Z iliccmarko Xylophone (JOI18_xylophone) C++14
100 / 100
 68 ms 680 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"

using namespace std;

int used[5005];
int a[5005];

void solve(int n)
{
    int l = 1;
    int r = n - 1;
    int start;
    while(l<=r)
    {
        int mid = (l+r)/2;
        if(query(mid, n)==n-1)
        {
            start = mid;
            l = mid + 1;
        }
        else
        {
            r = mid - 1;
        }
    }
    if(start-1>0)
    {
        a[start-1] = 1 + query(start-1, start);
        used[a[start-1]] = 1;
    }
    a[start+1] = 1 + query(start, start+1);
    used[a[start+1]] = 1;
    a[start] = 1;
    used[1] = 1;
    for(int i = start-2;i>0;i--)
    {
        int s = query(i, i+1);
        int m1 = a[i+1] + s;
        int m2 = a[i+1] - s;
        if(m1>=n||used[m1])
        {
            a[i] = m2;
            used[m2] = 1;
        }
        else if(m2<=0||used[m2])
        {
            a[i] = m1;
            used[m1] = 1;
        }
        else
        {
            int ss = query(i, i+2);
            if(max({m1, a[i+1], a[i+2]}) - min({m1, a[i+1], a[i+2]}) == ss)
            {
                a[i] = m1;
                used[m1] = 1;
            }
            else
            {
                a[i] = m2;
                used[m2] = 1;
            }
        }
    }
    for(int i = start+2;i<=n;i++)
    {
        int s = query(i-1, i);
        int m1 = a[i-1] + s;
        int m2 = a[i-1] - s;
        if(m1>n||used[m1])
        {
            a[i] = m2;
            used[m2] = 1;
        }
        else if(m2<=1||used[m2])
        {
            a[i] = m1;
            used[m1] = 1;
        }
        else
        {
            int ss = query(i-2, i);
            if(max({m1, a[i-1], a[i-2]}) - min({m1, a[i-1], a[i-2]}) == ss)
            {
                a[i] = m1;
                used[m1] = 1;
            }
            else
            {
                a[i] = m2;
                used[m2] = 1;
            }
        }
    }
    for(int i = 1;i<=n;i++)
    {
        answer(i, a[i]);
    }
}

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:37:14: warning: 'start' may be used uninitialized in this function [-Wmaybe-uninitialized]
   37 |     a[start] = 1;
      |     ~~~~~~~~~^~~

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 7 ms 384 KB Output is correct
18 Correct 11 ms 504 KB Output is correct
19 Correct 11 ms 376 KB Output is correct
20 Correct 14 ms 376 KB Output is correct
21 Correct 12 ms 384 KB Output is correct
22 Correct 14 ms 256 KB Output is correct
23 Correct 9 ms 384 KB Output is correct
24 Correct 10 ms 384 KB Output is correct
25 Correct 9 ms 384 KB Output is correct
26 Correct 13 ms 384 KB Output is correct
27 Correct 12 ms 384 KB Output is correct
28 Correct 12 ms 384 KB Output is correct
29 Correct 7 ms 380 KB Output is correct
30 Correct 13 ms 512 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 7 ms 384 KB Output is correct
18 Correct 11 ms 504 KB Output is correct
19 Correct 11 ms 376 KB Output is correct
20 Correct 14 ms 376 KB Output is correct
21 Correct 12 ms 384 KB Output is correct
22 Correct 14 ms 256 KB Output is correct
23 Correct 9 ms 384 KB Output is correct
24 Correct 10 ms 384 KB Output is correct
25 Correct 9 ms 384 KB Output is correct
26 Correct 13 ms 384 KB Output is correct
27 Correct 12 ms 384 KB Output is correct
28 Correct 12 ms 384 KB Output is correct
29 Correct 7 ms 380 KB Output is correct
30 Correct 13 ms 512 KB Output is correct
31 Correct 34 ms 384 KB Output is correct
32 Correct 36 ms 384 KB Output is correct
33 Correct 49 ms 384 KB Output is correct
34 Correct 59 ms 384 KB Output is correct
35 Correct 64 ms 680 KB Output is correct
36 Correct 39 ms 384 KB Output is correct
37 Correct 44 ms 376 KB Output is correct
38 Correct 46 ms 384 KB Output is correct
39 Correct 54 ms 384 KB Output is correct
40 Correct 61 ms 408 KB Output is correct
41 Correct 67 ms 384 KB Output is correct
42 Correct 47 ms 376 KB Output is correct
43 Correct 48 ms 384 KB Output is correct
44 Correct 50 ms 384 KB Output is correct
45 Correct 60 ms 384 KB Output is correct
46 Correct 63 ms 384 KB Output is correct
47 Correct 64 ms 384 KB Output is correct
48 Correct 66 ms 384 KB Output is correct
49 Correct 54 ms 504 KB Output is correct
50 Correct 51 ms 456 KB Output is correct
51 Correct 33 ms 380 KB Output is correct
52 Correct 60 ms 384 KB Output is correct
53 Correct 56 ms 384 KB Output is correct
54 Correct 68 ms 408 KB Output is correct
55 Correct 58 ms 384 KB Output is correct
56 Correct 62 ms 384 KB Output is correct
57 Correct 62 ms 504 KB Output is correct
58 Correct 60 ms 384 KB Output is correct
59 Correct 57 ms 504 KB Output is correct
60 Correct 56 ms 384 KB Output is correct