oj.uz

Submission #846100

# Submission time Handle Problem Language Result Execution time Memory
846100 2023-09-07T09:51:06 Z LucaIlie Xylophone (JOI18_xylophone) C++17
47 / 100
 52 ms 86960 KB 
#include "xylophone.h"
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 5000;
int v[MAX_N + 1], ans[MAX_N + 1][MAX_N + 1];

int q( int l, int r ) {
    if ( ans[l][r] == -1 )
        ans[l][r] = query( l, r );
    return ans[l][r];
}

void solve( int n ) {
    int l = 1, r = n;
    while ( r - l > 1 ) {
        int mid = (l + r) / 2;
        if ( query( mid, n ) == n - 1 )
            l = mid;
        else
            r = mid;
    }

    int p1 = l;
    for ( int l = 1; l <= n; l++ ) {
        for ( int r = l; r <= n; r++ )
            ans[l][r] = -1;
    }

    v[p1] = 1;
    v[p1 + 1] = 1 + q( p1, p1 + 1 );
    if ( p1 > 1 )
        v[p1 - 1] = 1 + q( p1 - 1, p1 );

    for ( int i = p1 + 2; i <= n; i++ ) {
        if ( v[i - 2] < v[i - 1] ) {
            if ( q( i - 2, i ) == q( i - 2, i - 1 ) )
                v[i] = v[i - 1] - q( i - 1, i );
            else if ( q( i - 2, i ) == q( i - 1, i ) )
                v[i] = v[i - 1] - q( i - 1, i );
            else
                v[i] = v[i - 1] + q( i - 1, i );
        } else {
            if ( q( i - 2, i ) == q( i - 2, i - 1 ) )
                v[i] = v[i - 1] + q( i - 1, i );
            else if ( q( i - 2, i ) == q( i - 1, i ) )
                v[i] = v[i - 1] + q( i - 1, i );
            else
                v[i] = v[i - 1] - q( i - 1, i );
        }
    }

    for ( int i = p1 - 2; i >= 1; i-- ) {
        int x = query( i, i + 1 );
        if ( v[i + 2] < v[i + 1] ) {
            if ( q( i, i + 2 ) == q( i + 1, i + 2 ) )
                v[i] = v[i + 1] - q( i, i + 1);
            else if ( q( i, i + 2 ) == q( i, i + 1 ) )
                v[i] = v[i + 1] - q( i, i + 1 );
            else
                v[i] = v[i + 1] + q( i, i + 1 );
        } else {
            if ( q( i, i + 2 ) == q( i + 1, i + 2 ) )
                v[i] = v[i + 1] + q( i, i + 1 );
            else if ( q( i, i + 2 ) == q( i, i + 1 ) )
                v[i] = v[i + 1] + q( i, i + 1 );
            else
                v[i] = v[i + 1] - q( i, i + 1 );
        }
    }

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

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:55:13: warning: unused variable 'x' [-Wunused-variable]
   55 |         int x = query( i, i + 1 );
      |             ^

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 440 KB Output is correct
3 Correct 1 ms 2496 KB Output is correct
4 Correct 1 ms 2492 KB Output is correct
5 Correct 1 ms 2488 KB Output is correct
6 Correct 1 ms 2488 KB Output is correct
7 Correct 1 ms 2492 KB Output is correct
8 Correct 1 ms 2484 KB Output is correct
9 Correct 1 ms 2488 KB Output is correct
10 Correct 1 ms 2492 KB Output is correct
11 Correct 1 ms 2492 KB Output is correct
12 Correct 1 ms 2484 KB Output is correct
13 Correct 1 ms 2488 KB Output is correct
14 Correct 1 ms 2492 KB Output is correct
15 Correct 1 ms 2496 KB Output is correct
16 Correct 3 ms 6744 KB Output is correct
17 Correct 5 ms 10680 KB Output is correct
18 Correct 9 ms 16916 KB Output is correct
19 Correct 10 ms 21036 KB Output is correct
20 Correct 12 ms 21176 KB Output is correct
21 Correct 13 ms 21180 KB Output is correct
22 Correct 12 ms 21180 KB Output is correct
23 Correct 9 ms 20920 KB Output is correct
24 Correct 14 ms 21180 KB Output is correct
25 Correct 13 ms 21176 KB Output is correct
26 Correct 11 ms 21440 KB Output is correct
27 Correct 13 ms 21188 KB Output is correct
28 Correct 13 ms 21432 KB Output is correct
29 Correct 12 ms 21180 KB Output is correct
30 Correct 14 ms 21032 KB Output is correct

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 440 KB Output is correct
3 Correct 1 ms 2496 KB Output is correct
4 Correct 1 ms 2492 KB Output is correct
5 Correct 1 ms 2488 KB Output is correct
6 Correct 1 ms 2488 KB Output is correct
7 Correct 1 ms 2492 KB Output is correct
8 Correct 1 ms 2484 KB Output is correct
9 Correct 1 ms 2488 KB Output is correct
10 Correct 1 ms 2492 KB Output is correct
11 Correct 1 ms 2492 KB Output is correct
12 Correct 1 ms 2484 KB Output is correct
13 Correct 1 ms 2488 KB Output is correct
14 Correct 1 ms 2492 KB Output is correct
15 Correct 1 ms 2496 KB Output is correct
16 Correct 3 ms 6744 KB Output is correct
17 Correct 5 ms 10680 KB Output is correct
18 Correct 9 ms 16916 KB Output is correct
19 Correct 10 ms 21036 KB Output is correct
20 Correct 12 ms 21176 KB Output is correct
21 Correct 13 ms 21180 KB Output is correct
22 Correct 12 ms 21180 KB Output is correct
23 Correct 9 ms 20920 KB Output is correct
24 Correct 14 ms 21180 KB Output is correct
25 Correct 13 ms 21176 KB Output is correct
26 Correct 11 ms 21440 KB Output is correct
27 Correct 13 ms 21188 KB Output is correct
28 Correct 13 ms 21432 KB Output is correct
29 Correct 12 ms 21180 KB Output is correct
30 Correct 14 ms 21032 KB Output is correct
31 Correct 30 ms 43708 KB Output is correct
32 Correct 45 ms 62384 KB Output is correct
33 Incorrect 52 ms 86960 KB Wrong Answer [2]
34 Halted 0 ms 0 KB -