oj.uz

Submission #841557

# Submission time Handle Problem Language Result Execution time Memory
841557 2023-09-01T16:53:29 Z LucaIlie Minerals (JOI19_minerals) C++17
80 / 100
 26 ms 3868 KB 
#include "minerals.h"
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 43000;
int pairr[2 * MAX_N + 1], perm[2 * MAX_N + 1];
bool inSet[2 * MAX_N + 1];
vector<int> firstt, secondd;
int ans = 0;

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

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

    for ( int i = 0; i < f.size() / 2; i++ ) {
        if ( !inSet[f[i]] ) {
            ans = Query( f[i] );
            inSet[f[i]] = true;
        }
        fl.push_back( f[i] );
    }
    for ( int i = f.size() / 2; i < f.size(); i++ ) {
        if ( inSet[f[i]] ) {
            ans = Query( f[i] );
            inSet[f[i]] = false;
        }
        fr.push_back( f[i] );
    }

    for ( int i = 0; i < s.size(); i++ ) {
        int prevAns = ans;
        ans = Query( s[i] );
        inSet[s[i]] ^= 1;

        if ( ans == prevAns )
            sl.push_back( s[i] );
        else
            sr.push_back( s[i] );
    }

    solve( fl, sl );
    solve( fr, sr );
}

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

    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;
    }

    solve( firstt, secondd );

    for ( int i = 0; i < n; i++ )
        Answer( secondd[i], pairr[secondd[i]] );
}

Compilation message

minerals.cpp: In function 'void solve(std::vector<int>&, std::vector<int>&)':
minerals.cpp:20:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     for ( int i = 0; i < f.size() / 2; i++ ) {
      |                      ~~^~~~~~~~~~~~~~
minerals.cpp:27:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for ( int i = f.size() / 2; i < f.size(); i++ ) {
      |                                 ~~^~~~~~~~~~
minerals.cpp:35:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |     for ( int i = 0; i < s.size(); i++ ) {
      |                      ~~^~~~~~~~~~
minerals.cpp: In function 'void Solve(int)':
minerals.cpp:57:28: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   57 |         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 1 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 1 ms 600 KB Output is correct
3 Correct 2 ms 600 KB Output is correct
4 Correct 4 ms 856 KB Output is correct
5 Correct 8 ms 1320 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 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 4 ms 856 KB Output is correct
9 Correct 8 ms 1320 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 6 ms 1112 KB Output is correct
12 Correct 9 ms 1368 KB Output is correct
13 Correct 8 ms 1368 KB Output is correct
14 Correct 9 ms 1624 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 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 4 ms 856 KB Output is correct
9 Correct 8 ms 1320 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 6 ms 1112 KB Output is correct
12 Correct 9 ms 1368 KB Output is correct
13 Correct 8 ms 1368 KB Output is correct
14 Correct 9 ms 1624 KB Output is correct
15 Correct 24 ms 3408 KB Output is correct
16 Correct 23 ms 3152 KB Output is correct
17 Correct 22 ms 3180 KB Output is correct
18 Correct 19 ms 3152 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 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 4 ms 856 KB Output is correct
9 Correct 8 ms 1320 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 6 ms 1112 KB Output is correct
12 Correct 9 ms 1368 KB Output is correct
13 Correct 8 ms 1368 KB Output is correct
14 Correct 9 ms 1624 KB Output is correct
15 Correct 24 ms 3408 KB Output is correct
16 Correct 23 ms 3152 KB Output is correct
17 Correct 22 ms 3180 KB Output is correct
18 Correct 19 ms 3152 KB Output is correct
19 Correct 24 ms 3300 KB Output is correct
20 Correct 26 ms 3448 KB Output is correct
21 Correct 19 ms 3868 KB Output is correct
22 Correct 22 ms 3072 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 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 4 ms 856 KB Output is correct
9 Correct 8 ms 1320 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 6 ms 1112 KB Output is correct
12 Correct 9 ms 1368 KB Output is correct
13 Correct 8 ms 1368 KB Output is correct
14 Correct 9 ms 1624 KB Output is correct
15 Correct 24 ms 3408 KB Output is correct
16 Correct 23 ms 3152 KB Output is correct
17 Correct 22 ms 3180 KB Output is correct
18 Correct 19 ms 3152 KB Output is correct
19 Correct 24 ms 3300 KB Output is correct
20 Correct 26 ms 3448 KB Output is correct
21 Correct 19 ms 3868 KB Output is correct
22 Correct 22 ms 3072 KB Output is correct
23 Correct 25 ms 3304 KB Output is correct
24 Correct 25 ms 3304 KB Output is correct
25 Correct 21 ms 3656 KB Output is correct
26 Correct 19 ms 3372 KB Output is correct

Subtask #7
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 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 4 ms 856 KB Output is correct
9 Correct 8 ms 1320 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 6 ms 1112 KB Output is correct
12 Correct 9 ms 1368 KB Output is correct
13 Correct 8 ms 1368 KB Output is correct
14 Correct 9 ms 1624 KB Output is correct
15 Correct 24 ms 3408 KB Output is correct
16 Correct 23 ms 3152 KB Output is correct
17 Correct 22 ms 3180 KB Output is correct
18 Correct 19 ms 3152 KB Output is correct
19 Correct 24 ms 3300 KB Output is correct
20 Correct 26 ms 3448 KB Output is correct
21 Correct 19 ms 3868 KB Output is correct
22 Correct 22 ms 3072 KB Output is correct
23 Correct 25 ms 3304 KB Output is correct
24 Correct 25 ms 3304 KB Output is correct
25 Correct 21 ms 3656 KB Output is correct
26 Correct 19 ms 3372 KB Output is correct
27 Incorrect 24 ms 3160 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -

Subtask #8
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 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 4 ms 856 KB Output is correct
9 Correct 8 ms 1320 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 6 ms 1112 KB Output is correct
12 Correct 9 ms 1368 KB Output is correct
13 Correct 8 ms 1368 KB Output is correct
14 Correct 9 ms 1624 KB Output is correct
15 Correct 24 ms 3408 KB Output is correct
16 Correct 23 ms 3152 KB Output is correct
17 Correct 22 ms 3180 KB Output is correct
18 Correct 19 ms 3152 KB Output is correct
19 Correct 24 ms 3300 KB Output is correct
20 Correct 26 ms 3448 KB Output is correct
21 Correct 19 ms 3868 KB Output is correct
22 Correct 22 ms 3072 KB Output is correct
23 Correct 25 ms 3304 KB Output is correct
24 Correct 25 ms 3304 KB Output is correct
25 Correct 21 ms 3656 KB Output is correct
26 Correct 19 ms 3372 KB Output is correct
27 Incorrect 24 ms 3160 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -

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 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 2 ms 600 KB Output is correct
8 Correct 4 ms 856 KB Output is correct
9 Correct 8 ms 1320 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 6 ms 1112 KB Output is correct
12 Correct 9 ms 1368 KB Output is correct
13 Correct 8 ms 1368 KB Output is correct
14 Correct 9 ms 1624 KB Output is correct
15 Correct 24 ms 3408 KB Output is correct
16 Correct 23 ms 3152 KB Output is correct
17 Correct 22 ms 3180 KB Output is correct
18 Correct 19 ms 3152 KB Output is correct
19 Correct 24 ms 3300 KB Output is correct
20 Correct 26 ms 3448 KB Output is correct
21 Correct 19 ms 3868 KB Output is correct
22 Correct 22 ms 3072 KB Output is correct
23 Correct 25 ms 3304 KB Output is correct
24 Correct 25 ms 3304 KB Output is correct
25 Correct 21 ms 3656 KB Output is correct
26 Correct 19 ms 3372 KB Output is correct
27 Incorrect 24 ms 3160 KB Wrong Answer [2]
28 Halted 0 ms 0 KB -