oj.uz

Submission #320797

# Submission time Handle Problem Language Result Execution time Memory
320797 2020-11-10T01:12:47 Z mohamedsobhi777 Xylophone (JOI18_xylophone) C++14
47 / 100
 101 ms 520 KB 
#include "xylophone.h"
#include <bits/stdc++.h>

using namespace std;

int n;

int a1, an;

void dac(int l, int r)
{
        if (l + 1 == r)
        {
                a1 = l;
                an = r;
                return;
        }
        int mid = (l + r) >> 1;
        if (query(l, mid) == n - 1)
        {
                dac(l, mid);
        }
        else if (query(mid + 1, r) == n - 1)
        {
                dac(mid + 1, r);
        }
        else
        {

                int L = l, R = mid;
                while (L <= R)
                {
                        int m = (L + R) >> 1;
                        if (query(m, r) == n - 1)
                        {
                                a1 = m;
                                L = m + 1;
                        }
                        else
                                R = m - 1;
                }
                return;
        }
}

int arr[10000];
int vis[10000];

void conLhs()
{
        if (a1 > 1)
                arr[a1 - 1] = query(a1 - 1, a1) + 1;
        for (int i = a1 - 2; i > 0; --i)
        {
                int q1 = query(i, i + 1);
                int q2 = abs(arr[i + 1] - arr[i + 2]);
                int q3 = query(i, i + 2);
                int sgn = ((q1 + q2 == q3 && arr[i + 1] > arr[i + 2]) ||
                                   (arr[i + 1] < arr[i + 2] && q1 + q2 != q3)
                               ? 1
                               : -1);
                arr[i] = arr[i + 1] + q1 * sgn;
        }
}

void conMhs()
{
        if (a1 + 1 <= n)
                arr[a1 + 1] = query(a1, a1 + 1) + 1;
        for (int i = a1 + 2; i <= n; ++i)
        {
                int q1 = query(i - 1, i);
                int q2 = abs(arr[i - 1] - arr[i - 2]);
                int q3 = query(i - 2, i);
                int sgn = ((q1 + q2 == q3 && arr[i - 1] > arr[i - 2]) ||
                                   (arr[i - 1] < arr[i - 2] && q1 + q2 != q3)
                               ? 1
                               : -1);
                arr[i] = arr[i - 1] + q1 * sgn;
        }
}

void solve(int N)
{
        n = N;
        dac(1, N);
        arr[a1] = 1;
        arr[an] = N;
        conLhs();
        conMhs();
        for (int i = 1; i <= N; ++i)
        {
                answer(i, arr[i]);
                //printf("%d ", arr[i]);
        }
}

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 3 ms 364 KB Output is correct
6 Correct 3 ms 364 KB Output is correct
7 Correct 3 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 3 ms 364 KB Output is correct
10 Correct 3 ms 364 KB Output is correct
11 Correct 3 ms 364 KB Output is correct
12 Correct 3 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 2 ms 364 KB Output is correct
16 Correct 5 ms 364 KB Output is correct
17 Correct 10 ms 364 KB Output is correct
18 Correct 19 ms 364 KB Output is correct
19 Correct 20 ms 364 KB Output is correct
20 Correct 22 ms 364 KB Output is correct
21 Correct 18 ms 364 KB Output is correct
22 Correct 21 ms 492 KB Output is correct
23 Correct 18 ms 364 KB Output is correct
24 Correct 15 ms 364 KB Output is correct
25 Correct 18 ms 364 KB Output is correct
26 Correct 14 ms 484 KB Output is correct
27 Correct 17 ms 364 KB Output is correct
28 Correct 25 ms 520 KB Output is correct
29 Correct 20 ms 364 KB Output is correct
30 Correct 20 ms 364 KB Output is correct

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 3 ms 364 KB Output is correct
6 Correct 3 ms 364 KB Output is correct
7 Correct 3 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 3 ms 364 KB Output is correct
10 Correct 3 ms 364 KB Output is correct
11 Correct 3 ms 364 KB Output is correct
12 Correct 3 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 2 ms 364 KB Output is correct
16 Correct 5 ms 364 KB Output is correct
17 Correct 10 ms 364 KB Output is correct
18 Correct 19 ms 364 KB Output is correct
19 Correct 20 ms 364 KB Output is correct
20 Correct 22 ms 364 KB Output is correct
21 Correct 18 ms 364 KB Output is correct
22 Correct 21 ms 492 KB Output is correct
23 Correct 18 ms 364 KB Output is correct
24 Correct 15 ms 364 KB Output is correct
25 Correct 18 ms 364 KB Output is correct
26 Correct 14 ms 484 KB Output is correct
27 Correct 17 ms 364 KB Output is correct
28 Correct 25 ms 520 KB Output is correct
29 Correct 20 ms 364 KB Output is correct
30 Correct 20 ms 364 KB Output is correct
31 Correct 41 ms 488 KB Output is correct
32 Correct 55 ms 364 KB Output is correct
33 Correct 101 ms 484 KB Output is correct
34 Incorrect 93 ms 364 KB Wrong Answer [2]
35 Halted 0 ms 0 KB -