oj.uz

답안 #677137

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
677137 2023-01-02T10:57:21 Z borisAngelov Xylophone (JOI18_xylophone) C++17
100 / 100
 66 ms 428 KB 
#include <iostream>
#include <math.h>
#include "xylophone.h"

using namespace std;

const int maxn = 5005;

int p[maxn];
bool appeared[maxn];

void solve(int n)
{
    for (int i = 1; i <= n; ++i)
    {
        appeared[i] = false;
    }

    int l = 1;
    int r = n;

    while (l <= r)
    {
        int mid = (l + r) >> 1;

        if (query(1, mid) == n - 1) r = mid - 1;
        else l = mid + 1;
    }

    int pos_n = l;

    p[pos_n] = n;
    appeared[n] = true;

    p[pos_n - 1] = p[pos_n] - query(pos_n - 1, pos_n);
    appeared[p[pos_n - 1]] = true;

    if (pos_n != n)
    {
        p[pos_n + 1] = p[pos_n] - query(pos_n, pos_n + 1);
        appeared[p[pos_n + 1]] = true;
    }

    for (int i = pos_n - 2; i >= 1; --i)
    {
        int x = query(i, i + 1);

        if (p[i + 1] + x > n)
        {
            p[i] = p[i + 1] - x;
            appeared[p[i]] = true;
            continue;
        }

        if (p[i + 1] - x <= 0)
        {
            p[i] = p[i + 1] + x;
            appeared[p[i]] = true;
            continue;
        }

        if (appeared[p[i + 1] + x] == true)
        {
            p[i] = p[i + 1] - x;
            appeared[p[i]] = true;
            continue;
        }

        if (appeared[p[i + 1] - x] == true)
        {
            p[i] = p[i + 1] + x;
            appeared[p[i]] = true;
            continue;
        }

        int y = abs(p[i + 1] - p[i + 2]);
        int z = query(i, i + 2);

        if (z == x + y)
        {
            if (p[i + 2] > p[i + 1])
            {
                p[i] = p[i + 1] - x;
                appeared[p[i]] = true;
            }
            else
            {
                p[i] = p[i + 1] + x;
                appeared[p[i]] = true;
            }
        }
        else
        {
            if (p[i + 1] > p[i + 2])
            {
                p[i] = p[i + 1] - x;
                appeared[p[i]] = true;
            }
            else
            {
                p[i] = p[i + 1] + x;
                appeared[p[i]] = true;
            }
        }
    }

    for (int i = pos_n + 2; i <= n; ++i)
    {
        int x = query(i - 1, i);

        if (p[i - 1] + x > n)
        {
            p[i] = p[i - 1] - x;
            appeared[p[i]] = true;
            continue;
        }

        if (p[i - 1] - x <= 0)
        {
            p[i] = p[i - 1] + x;
            appeared[p[i]] = true;
            continue;
        }

        if (appeared[p[i - 1] + x] == true)
        {
            p[i] = p[i - 1] - x;
            appeared[p[i]] = true;
            continue;
        }

        if (appeared[p[i - 1] - x] == true)
        {
            p[i] = p[i - 1] + x;
            appeared[p[i]] = true;
            continue;
        }

        int y = abs(p[i - 1] - p[i - 2]);
        int z = query(i - 2, i);

        if (z == x + y)
        {
            if (p[i - 2] > p[i - 1])
            {
                p[i] = p[i - 1] - x;
                appeared[p[i]] = true;
            }
            else
            {
                p[i] = p[i - 1] + x;
                appeared[p[i]] = true;
            }
        }
        else
        {
            if (p[i - 1] > p[i - 2])
            {
                p[i] = p[i - 1] - x;
                appeared[p[i]] = true;
            }
            else
            {
                p[i] = p[i - 1] + x;
                appeared[p[i]] = true;
            }
        }
    }

    for (int i = 1; i <= n; ++i)
    {
        answer(i, p[i]);
    }
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 312 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 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 2 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 312 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 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 2 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 2 ms 208 KB Output is correct
17 Correct 4 ms 304 KB Output is correct
18 Correct 10 ms 208 KB Output is correct
19 Correct 8 ms 208 KB Output is correct
20 Correct 10 ms 208 KB Output is correct
21 Correct 10 ms 304 KB Output is correct
22 Correct 9 ms 308 KB Output is correct
23 Correct 9 ms 208 KB Output is correct
24 Correct 8 ms 308 KB Output is correct
25 Correct 10 ms 308 KB Output is correct
26 Correct 11 ms 304 KB Output is correct
27 Correct 10 ms 208 KB Output is correct
28 Correct 9 ms 308 KB Output is correct
29 Correct 12 ms 308 KB Output is correct
30 Correct 12 ms 292 KB Output is correct

Subtask #3
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 312 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 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 2 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 1 ms 208 KB Output is correct
16 Correct 2 ms 208 KB Output is correct
17 Correct 4 ms 304 KB Output is correct
18 Correct 10 ms 208 KB Output is correct
19 Correct 8 ms 208 KB Output is correct
20 Correct 10 ms 208 KB Output is correct
21 Correct 10 ms 304 KB Output is correct
22 Correct 9 ms 308 KB Output is correct
23 Correct 9 ms 208 KB Output is correct
24 Correct 8 ms 308 KB Output is correct
25 Correct 10 ms 308 KB Output is correct
26 Correct 11 ms 304 KB Output is correct
27 Correct 10 ms 208 KB Output is correct
28 Correct 9 ms 308 KB Output is correct
29 Correct 12 ms 308 KB Output is correct
30 Correct 12 ms 292 KB Output is correct
31 Correct 25 ms 304 KB Output is correct
32 Correct 23 ms 308 KB Output is correct
33 Correct 46 ms 304 KB Output is correct
34 Correct 42 ms 308 KB Output is correct
35 Correct 52 ms 296 KB Output is correct
36 Correct 37 ms 316 KB Output is correct
37 Correct 50 ms 296 KB Output is correct
38 Correct 41 ms 300 KB Output is correct
39 Correct 51 ms 328 KB Output is correct
40 Correct 58 ms 304 KB Output is correct
41 Correct 49 ms 312 KB Output is correct
42 Correct 39 ms 308 KB Output is correct
43 Correct 50 ms 304 KB Output is correct
44 Correct 46 ms 304 KB Output is correct
45 Correct 57 ms 308 KB Output is correct
46 Correct 41 ms 300 KB Output is correct
47 Correct 64 ms 332 KB Output is correct
48 Correct 60 ms 328 KB Output is correct
49 Correct 66 ms 308 KB Output is correct
50 Correct 46 ms 308 KB Output is correct
51 Correct 56 ms 428 KB Output is correct
52 Correct 59 ms 328 KB Output is correct
53 Correct 46 ms 304 KB Output is correct
54 Correct 52 ms 292 KB Output is correct
55 Correct 37 ms 304 KB Output is correct
56 Correct 57 ms 316 KB Output is correct
57 Correct 60 ms 296 KB Output is correct
58 Correct 62 ms 312 KB Output is correct
59 Correct 48 ms 308 KB Output is correct
60 Correct 50 ms 320 KB Output is correct