oj.uz

Submission #824684

# Submission time Handle Problem Language Result Execution time Memory
824684 2023-08-14T08:47:46 Z LucaIlie Minerals (JOI19_minerals) C++17
40 / 100
 21 ms 2896 KB 
#include "minerals.h"
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 43000;
const int UNDEF = -1;
int pairr[2 * MAX_N + 1], perm[2 * MAX_N + 1];
int ans = 0;

void solve( vector <int> &v, bool active ) {
    int n = v.size() / 2, ln = n / 2;
    vector<int> left, right;

    /*printf( "%d: ", n );
    for ( int i: v )
        printf( "%d ", perm[i] );
    printf( "\n" );*/

    if ( n == 1 ) {
        pairr[v[0]] = v[1];
        pairr[v[1]] = v[0];
        return;
    }

    int prevAns = ans, pairs = 0;
    for ( int i: v ) {
        if ( left.size() == ln * 2 ) {
            right.push_back( i );
            continue;
        }

        ans = Query( perm[i] );
        if ( active ) {
            if ( ans == prevAns )
                pairs++;
        } else {
            if ( ans > prevAns )
                pairs++;
        }

        if ( pairs > ln ) {
            right.push_back( i );
            ans = Query( perm[i] );
            pairs--;
        } else
            left.push_back( i );

        prevAns = ans;
    }

    solve( left, !active );
    solve( right, active );
}

void Solve( int n ) {
    vector<int> v;
    for ( int i = 1; i <= 2 * n; i++ ) {
        pairr[i] = UNDEF;
        v.push_back( i );
        perm[i] = i;
    }
    random_shuffle( perm + 1, perm + 1 + 2 * n );

    solve( v, false );
    for ( int i = 1; i <= 2 * n; i++ ) {
        if ( pairr[i] < i )
            Answer( perm[i], perm[pairr[i]] );
    }
}

Compilation message

minerals.cpp: In function 'void solve(std::vector<int>&, bool)':
minerals.cpp:28:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   28 |         if ( left.size() == ln * 2 ) {
      |              ~~~~~~~~~~~~^~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 448 KB Output is correct
3 Correct 3 ms 592 KB Output is correct
4 Correct 5 ms 848 KB Output is correct
5 Correct 12 ms 1212 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 448 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 5 ms 848 KB Output is correct
9 Correct 12 ms 1212 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 8 ms 976 KB Output is correct
12 Correct 11 ms 1260 KB Output is correct
13 Correct 11 ms 1232 KB Output is correct
14 Correct 12 ms 1132 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 448 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 5 ms 848 KB Output is correct
9 Correct 12 ms 1212 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 8 ms 976 KB Output is correct
12 Correct 11 ms 1260 KB Output is correct
13 Correct 11 ms 1232 KB Output is correct
14 Correct 12 ms 1132 KB Output is correct
15 Incorrect 21 ms 2896 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 448 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 5 ms 848 KB Output is correct
9 Correct 12 ms 1212 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 8 ms 976 KB Output is correct
12 Correct 11 ms 1260 KB Output is correct
13 Correct 11 ms 1232 KB Output is correct
14 Correct 12 ms 1132 KB Output is correct
15 Incorrect 21 ms 2896 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 448 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 5 ms 848 KB Output is correct
9 Correct 12 ms 1212 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 8 ms 976 KB Output is correct
12 Correct 11 ms 1260 KB Output is correct
13 Correct 11 ms 1232 KB Output is correct
14 Correct 12 ms 1132 KB Output is correct
15 Incorrect 21 ms 2896 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 448 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 5 ms 848 KB Output is correct
9 Correct 12 ms 1212 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 8 ms 976 KB Output is correct
12 Correct 11 ms 1260 KB Output is correct
13 Correct 11 ms 1232 KB Output is correct
14 Correct 12 ms 1132 KB Output is correct
15 Incorrect 21 ms 2896 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 448 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 5 ms 848 KB Output is correct
9 Correct 12 ms 1212 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 8 ms 976 KB Output is correct
12 Correct 11 ms 1260 KB Output is correct
13 Correct 11 ms 1232 KB Output is correct
14 Correct 12 ms 1132 KB Output is correct
15 Incorrect 21 ms 2896 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 448 KB Output is correct
7 Correct 3 ms 592 KB Output is correct
8 Correct 5 ms 848 KB Output is correct
9 Correct 12 ms 1212 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 8 ms 976 KB Output is correct
12 Correct 11 ms 1260 KB Output is correct
13 Correct 11 ms 1232 KB Output is correct
14 Correct 12 ms 1132 KB Output is correct
15 Incorrect 21 ms 2896 KB Wrong Answer [2]
16 Halted 0 ms 0 KB -