oj.uz

Submission #841581

# Submission time Handle Problem Language Result Execution time Memory
841581 2023-09-01T17:39:52 Z LucaIlie Minerals (JOI19_minerals) C++17
90 / 100
 49 ms 4068 KB 
#include "minerals.h"
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 43000;
int perm[2 * MAX_N + 1];
bool inSet[2 * MAX_N + 1];
vector<int> firstt, secondd;
int ans = 0;
auto seed = default_random_engine( 30 );

void solve( vector <int> &f, vector<int> &s ) {
    if ( f.size() == 1 && s.size() == 1 ) {
        Answer( s[0], f[0] );
        return;
    }

    vector<int> fl, fr, sl, sr;

    bool status = inSet[f[0]] ^ 1;

    int leftt = 0, rightt = 0;
    for ( int i = 0; i < f.size() / 2; i++ ) {
        if ( inSet[f[i]] != status ) {
            ans = Query( f[i] );
            inSet[f[i]] = status;
        }
        fl.push_back( f[i] );
        leftt++;
    }
    for ( int i = f.size() / 2; i < f.size(); i++ ) {
        if ( inSet[f[i]] == status ) {
            ans = Query( f[i] );
            inSet[f[i]] = status ^ 1;
        }
        fr.push_back( f[i] );
        rightt++;
    }

    shuffle( s.begin(), s.end(), seed );
    for ( int i = 0; i < s.size(); i++ ) {
        if ( rightt == 0 ) {
            sl.push_back( s[i] );
            leftt--;
            continue;
        }
        if ( leftt == 0 ) {
            sr.push_back( s[i] );
            rightt--;
            continue;
        }

        int prevAns = ans;
        ans = Query( s[i] );
        inSet[s[i]] ^= 1;

        if ( (status == true && ans == prevAns) || (status == false && ans != prevAns) ) {
            sl.push_back( s[i] );
            leftt--;
        } else {
            sr.push_back( s[i] );
            rightt--;
        }
    }
    solve( fl, sl );
    solve( fr, sr );
}

void Solve( int n ) {
    for ( int i = 1; i <= 2 * n; i++ )
        perm[i] = i;
    shuffle( perm + 1, perm + 1 + 2 * n, seed );

    int prevAns = 0;
    for ( int i = 1; i <= 2 * n; i++ ) {
        if ( firstt.size() == n ) {
            secondd.push_back( perm[i] );
            continue;
        }

        ans = Query( perm[i] );
        inSet[perm[i]] = true;
        if ( ans > prevAns )
            firstt.push_back( perm[i] );
        else
            secondd.push_back( perm[i] );
        prevAns = ans;
    }

    shuffle( firstt.begin(), firstt.end(), seed );
    shuffle( secondd.begin(), secondd.end(), seed );
    solve( firstt, secondd );
}

Compilation message

minerals.cpp: In function 'void solve(std::vector<int>&, std::vector<int>&)':
minerals.cpp:24:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |     for ( int i = 0; i < f.size() / 2; i++ ) {
      |                      ~~^~~~~~~~~~~~~~
minerals.cpp:32:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |     for ( int i = f.size() / 2; i < f.size(); i++ ) {
      |                                 ~~^~~~~~~~~~
minerals.cpp:42:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     for ( int i = 0; i < s.size(); i++ ) {
      |                      ~~^~~~~~~~~~
minerals.cpp: In function 'void Solve(int)':
minerals.cpp:77:28: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   77 |         if ( firstt.size() == n ) {
      |              ~~~~~~~~~~~~~~^~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 3 ms 600 KB Output is correct
4 Correct 7 ms 856 KB Output is correct
5 Correct 13 ms 1388 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 7 ms 856 KB Output is correct
9 Correct 13 ms 1388 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 8 ms 1024 KB Output is correct
12 Correct 13 ms 1460 KB Output is correct
13 Correct 13 ms 1624 KB Output is correct
14 Correct 13 ms 1368 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 7 ms 856 KB Output is correct
9 Correct 13 ms 1388 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 8 ms 1024 KB Output is correct
12 Correct 13 ms 1460 KB Output is correct
13 Correct 13 ms 1624 KB Output is correct
14 Correct 13 ms 1368 KB Output is correct
15 Correct 38 ms 3032 KB Output is correct
16 Correct 44 ms 3044 KB Output is correct
17 Correct 37 ms 3324 KB Output is correct
18 Correct 37 ms 3252 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 7 ms 856 KB Output is correct
9 Correct 13 ms 1388 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 8 ms 1024 KB Output is correct
12 Correct 13 ms 1460 KB Output is correct
13 Correct 13 ms 1624 KB Output is correct
14 Correct 13 ms 1368 KB Output is correct
15 Correct 38 ms 3032 KB Output is correct
16 Correct 44 ms 3044 KB Output is correct
17 Correct 37 ms 3324 KB Output is correct
18 Correct 37 ms 3252 KB Output is correct
19 Correct 37 ms 3152 KB Output is correct
20 Correct 42 ms 3048 KB Output is correct
21 Correct 37 ms 3068 KB Output is correct
22 Correct 37 ms 3172 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 7 ms 856 KB Output is correct
9 Correct 13 ms 1388 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 8 ms 1024 KB Output is correct
12 Correct 13 ms 1460 KB Output is correct
13 Correct 13 ms 1624 KB Output is correct
14 Correct 13 ms 1368 KB Output is correct
15 Correct 38 ms 3032 KB Output is correct
16 Correct 44 ms 3044 KB Output is correct
17 Correct 37 ms 3324 KB Output is correct
18 Correct 37 ms 3252 KB Output is correct
19 Correct 37 ms 3152 KB Output is correct
20 Correct 42 ms 3048 KB Output is correct
21 Correct 37 ms 3068 KB Output is correct
22 Correct 37 ms 3172 KB Output is correct
23 Correct 39 ms 3056 KB Output is correct
24 Correct 41 ms 3052 KB Output is correct
25 Correct 39 ms 3408 KB Output is correct
26 Correct 37 ms 2936 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 7 ms 856 KB Output is correct
9 Correct 13 ms 1388 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 8 ms 1024 KB Output is correct
12 Correct 13 ms 1460 KB Output is correct
13 Correct 13 ms 1624 KB Output is correct
14 Correct 13 ms 1368 KB Output is correct
15 Correct 38 ms 3032 KB Output is correct
16 Correct 44 ms 3044 KB Output is correct
17 Correct 37 ms 3324 KB Output is correct
18 Correct 37 ms 3252 KB Output is correct
19 Correct 37 ms 3152 KB Output is correct
20 Correct 42 ms 3048 KB Output is correct
21 Correct 37 ms 3068 KB Output is correct
22 Correct 37 ms 3172 KB Output is correct
23 Correct 39 ms 3056 KB Output is correct
24 Correct 41 ms 3052 KB Output is correct
25 Correct 39 ms 3408 KB Output is correct
26 Correct 37 ms 2936 KB Output is correct
27 Correct 40 ms 3252 KB Output is correct
28 Correct 40 ms 3052 KB Output is correct
29 Correct 39 ms 3076 KB Output is correct
30 Correct 38 ms 3328 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 7 ms 856 KB Output is correct
9 Correct 13 ms 1388 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 8 ms 1024 KB Output is correct
12 Correct 13 ms 1460 KB Output is correct
13 Correct 13 ms 1624 KB Output is correct
14 Correct 13 ms 1368 KB Output is correct
15 Correct 38 ms 3032 KB Output is correct
16 Correct 44 ms 3044 KB Output is correct
17 Correct 37 ms 3324 KB Output is correct
18 Correct 37 ms 3252 KB Output is correct
19 Correct 37 ms 3152 KB Output is correct
20 Correct 42 ms 3048 KB Output is correct
21 Correct 37 ms 3068 KB Output is correct
22 Correct 37 ms 3172 KB Output is correct
23 Correct 39 ms 3056 KB Output is correct
24 Correct 41 ms 3052 KB Output is correct
25 Correct 39 ms 3408 KB Output is correct
26 Correct 37 ms 2936 KB Output is correct
27 Correct 40 ms 3252 KB Output is correct
28 Correct 40 ms 3052 KB Output is correct
29 Correct 39 ms 3076 KB Output is correct
30 Correct 38 ms 3328 KB Output is correct
31 Correct 49 ms 3160 KB Output is correct
32 Correct 45 ms 3052 KB Output is correct
33 Correct 41 ms 4068 KB Output is correct
34 Correct 41 ms 3812 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 7 ms 856 KB Output is correct
9 Correct 13 ms 1388 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 8 ms 1024 KB Output is correct
12 Correct 13 ms 1460 KB Output is correct
13 Correct 13 ms 1624 KB Output is correct
14 Correct 13 ms 1368 KB Output is correct
15 Correct 38 ms 3032 KB Output is correct
16 Correct 44 ms 3044 KB Output is correct
17 Correct 37 ms 3324 KB Output is correct
18 Correct 37 ms 3252 KB Output is correct
19 Correct 37 ms 3152 KB Output is correct
20 Correct 42 ms 3048 KB Output is correct
21 Correct 37 ms 3068 KB Output is correct
22 Correct 37 ms 3172 KB Output is correct
23 Correct 39 ms 3056 KB Output is correct
24 Correct 41 ms 3052 KB Output is correct
25 Correct 39 ms 3408 KB Output is correct
26 Correct 37 ms 2936 KB Output is correct
27 Correct 40 ms 3252 KB Output is correct
28 Correct 40 ms 3052 KB Output is correct
29 Correct 39 ms 3076 KB Output is correct
30 Correct 38 ms 3328 KB Output is correct
31 Correct 49 ms 3160 KB Output is correct
32 Correct 45 ms 3052 KB Output is correct
33 Correct 41 ms 4068 KB Output is correct
34 Correct 41 ms 3812 KB Output is correct
35 Incorrect 42 ms 3332 KB Wrong Answer [2]
36 Halted 0 ms 0 KB -