oj.uz

Submission #491563

# Submission time Handle Problem Language Result Execution time Memory
491563 2021-12-03T08:15:37 Z Alexandruabcde Xylophone (JOI18_xylophone) C++14
100 / 100
 157 ms 552 KB 
#include <bits/stdc++.h>
#include "xylophone.h"

using namespace std;

constexpr int NMAX = 5005;

int D[NMAX];
int T[NMAX];

int val[NMAX];
int fr[NMAX];

int modul (int x) {
    if (x < 0) return -x;

    return x;
}

int FindThird (int a, int b, int ans_1, int ans_2, int ans_3) {
    int c = -1;
    if (ans_3 == ans_1) {
        if (b < a) c = b + ans_2;
        else c = b - ans_2;
    }
    else {
        c = b - ans_2;

        if (max(c, max(a, b)) - min(c, min(a, b)) == ans_3 && c > 0) return c;
        else c = b + ans_2;
    }

    return c;
}

void solve(int N) {
    for (int i = 1; i < N; ++ i )
        D[i] = query(i, i+1);
    for (int i = 1; i < N-1; ++ i )
        T[i] = query(i, i+2);

    for (int i = 1; i <= N; ++ i ) {
        val[i] = N;
        for (int j = 0; j <= N; ++ j )
            fr[j] = 0;

        fr[val[i]]++;
        bool ok = 1;

        if (i != N)
            val[i+1] = val[i] - D[i];
        if (i != 1)
            val[i-1] = val[i] - D[i-1];

        fr[val[i-1]]++;
        fr[val[i+1]]++;

        if (fr[val[i-1]] > 1 || fr[val[i+1]] > 1) continue;

        for (int j = i + 2; j <= N; ++ j ) {
            val[j] = FindThird(val[j-2], val[j-1], D[j-2], D[j-1], T[j-2]);

            if (val[j] < 1 || val[j] > N || fr[val[j]] > 0) {
                ok = false;
                break;
            }
            fr[val[j]]++;
        }

        for (int j = i-2; j >= 1; -- j ) {
            val[j] = FindThird(val[j+2], val[j+1], D[j+1], D[j], T[j]);

            if (val[j] < 1 || val[j] > N || fr[val[j]] > 0) {
                ok = false;
                break;
            }
            fr[val[j]]++;
        }

        if (ok) {
            int poz_1 = 0, poz_N = i;
            for (int j = 1; j <= N; ++ j )
                if (val[j] == 1) poz_1 = j;

            if (poz_1 > poz_N) continue;

            for (int j = 1; j <= N; ++ j )
                answer(j, val[j]);
            break;
        }
    }
}

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 2 ms 200 KB Output is correct
5 Correct 2 ms 200 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 2 ms 304 KB Output is correct
8 Correct 3 ms 200 KB Output is correct
9 Correct 3 ms 200 KB Output is correct
10 Correct 2 ms 200 KB Output is correct
11 Correct 3 ms 200 KB Output is correct
12 Correct 4 ms 312 KB Output is correct
13 Correct 2 ms 200 KB Output is correct
14 Correct 2 ms 308 KB Output is correct
15 Correct 3 ms 200 KB Output is correct
16 Correct 2 ms 300 KB Output is correct
17 Correct 9 ms 200 KB Output is correct
18 Correct 17 ms 200 KB Output is correct
19 Correct 16 ms 200 KB Output is correct
20 Correct 15 ms 300 KB Output is correct
21 Correct 15 ms 300 KB Output is correct
22 Correct 19 ms 296 KB Output is correct
23 Correct 22 ms 328 KB Output is correct
24 Correct 23 ms 300 KB Output is correct
25 Correct 21 ms 292 KB Output is correct
26 Correct 21 ms 292 KB Output is correct
27 Correct 18 ms 304 KB Output is correct
28 Correct 21 ms 292 KB Output is correct
29 Correct 19 ms 304 KB Output is correct
30 Correct 20 ms 280 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 2 ms 200 KB Output is correct
5 Correct 2 ms 200 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 2 ms 304 KB Output is correct
8 Correct 3 ms 200 KB Output is correct
9 Correct 3 ms 200 KB Output is correct
10 Correct 2 ms 200 KB Output is correct
11 Correct 3 ms 200 KB Output is correct
12 Correct 4 ms 312 KB Output is correct
13 Correct 2 ms 200 KB Output is correct
14 Correct 2 ms 308 KB Output is correct
15 Correct 3 ms 200 KB Output is correct
16 Correct 2 ms 300 KB Output is correct
17 Correct 9 ms 200 KB Output is correct
18 Correct 17 ms 200 KB Output is correct
19 Correct 16 ms 200 KB Output is correct
20 Correct 15 ms 300 KB Output is correct
21 Correct 15 ms 300 KB Output is correct
22 Correct 19 ms 296 KB Output is correct
23 Correct 22 ms 328 KB Output is correct
24 Correct 23 ms 300 KB Output is correct
25 Correct 21 ms 292 KB Output is correct
26 Correct 21 ms 292 KB Output is correct
27 Correct 18 ms 304 KB Output is correct
28 Correct 21 ms 292 KB Output is correct
29 Correct 19 ms 304 KB Output is correct
30 Correct 20 ms 280 KB Output is correct
31 Correct 37 ms 296 KB Output is correct
32 Correct 59 ms 300 KB Output is correct
33 Correct 73 ms 296 KB Output is correct
34 Correct 80 ms 304 KB Output is correct
35 Correct 62 ms 432 KB Output is correct
36 Correct 106 ms 292 KB Output is correct
37 Correct 114 ms 448 KB Output is correct
38 Correct 73 ms 544 KB Output is correct
39 Correct 84 ms 420 KB Output is correct
40 Correct 78 ms 296 KB Output is correct
41 Correct 70 ms 300 KB Output is correct
42 Correct 102 ms 288 KB Output is correct
43 Correct 157 ms 288 KB Output is correct
44 Correct 81 ms 368 KB Output is correct
45 Correct 94 ms 428 KB Output is correct
46 Correct 89 ms 304 KB Output is correct
47 Correct 74 ms 296 KB Output is correct
48 Correct 55 ms 316 KB Output is correct
49 Correct 54 ms 412 KB Output is correct
50 Correct 82 ms 304 KB Output is correct
51 Correct 98 ms 296 KB Output is correct
52 Correct 79 ms 320 KB Output is correct
53 Correct 101 ms 284 KB Output is correct
54 Correct 82 ms 296 KB Output is correct
55 Correct 87 ms 300 KB Output is correct
56 Correct 99 ms 320 KB Output is correct
57 Correct 89 ms 312 KB Output is correct
58 Correct 90 ms 316 KB Output is correct
59 Correct 80 ms 552 KB Output is correct
60 Correct 90 ms 300 KB Output is correct