oj.uz

Submission #922862

# Submission time Handle Problem Language Result Execution time Memory
922862 2024-02-06T08:24:24 Z boris_mihov Minerals (JOI19_minerals) C++17
75 / 100
 27 ms 4012 KB 
#include "minerals.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <random>
#include <vector>
#include <queue>

typedef long long llong;
const int MAXN = 86000 + 10;
const int INF  = 1e9;

int n;
int with[MAXN];
int perm[MAXN];
bool isIn[MAXN];
std::vector <int> unique;
std::vector <int> second;
std::mt19937 rng(76543);
int to[MAXN];

int countDiff;
int query(int idx)
{
    isIn[idx] ^= 1;
    return countDiff = Query(perm[idx]);
}

void answer(int a, int b)
{
    Answer(perm[a], perm[b]);
}

void Solve(int N) 
{
    n = N;
    std::iota(perm + 1, perm + 1 + 2 * n, 1);
    std::shuffle(perm + 1, perm + 1 + 2 * n, rng);

    int cnt = 0;
    for (int i = 1 ; i <= 2 * n ; ++i)
    {
        int last = countDiff;
        if (unique.size() < n && (second.size() == n || query(i) > last))
        {
            unique.push_back(i);
        } else
        {
            to[i] = unique.size();
            second.push_back(i);
        }
    }

    assert(unique.size() == n);
    assert(second.size() == n);
    
    for (int bit = 0 ; (1 << bit) < n ; ++bit)
    {
        int cntIn = 0;
        int cntOut = 0;
        int min = INF;
        
        for (int i = 0 ; i < n ; ++i)
        {
            if (((i & (1 << bit)) > 0) != isIn[unique[i]])
            {
                query(unique[i]);
            }

            if (isIn[unique[i]])
            {
                min = std::min(min, i);
            }

            cntIn += isIn[unique[i]];
            cntOut += !isIn[unique[i]];
        }

        for (int i = 0 ; i < n ; ++i)
        {
            if (cntIn == 0)
            {
                continue;
            }

            if (to[second[i]] < min)
            {
                cntOut--;
                continue;
            }

            if (cntOut == 0)
            {
                with[second[i]] |= (1 << bit);
                continue;
            }
            
            int curr = countDiff;
            int next = query(second[i]);
            if (curr == next)
            {
                with[second[i]] |= (1 << bit);
                cntIn--;
            } else
            {
                cntOut--;
            }
        }
    }

    for (int i = 0 ; i < n ; ++i)
    {
        answer(second[i], unique[with[second[i]]]);
    }
}

Compilation message

minerals.cpp: In function 'void Solve(int)':
minerals.cpp:45:27: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   45 |         if (unique.size() < n && (second.size() == n || query(i) > last))
      |             ~~~~~~~~~~~~~~^~~
minerals.cpp:45:49: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   45 |         if (unique.size() < n && (second.size() == n || query(i) > last))
      |                                   ~~~~~~~~~~~~~~^~~~
In file included from /usr/include/c++/10/cassert:44,
                 from minerals.cpp:5:
minerals.cpp:55:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   55 |     assert(unique.size() == n);
      |            ~~~~~~~~~~~~~~^~~~
minerals.cpp:56:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   56 |     assert(second.size() == n);
      |            ~~~~~~~~~~~~~~^~~~
minerals.cpp:41:9: warning: unused variable 'cnt' [-Wunused-variable]
   41 |     int cnt = 0;
      |         ^~~

Subtask #1
6.0 / 6.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 2 ms 2392 KB Output is correct
4 Correct 4 ms 2644 KB Output is correct
5 Correct 7 ms 2648 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 2 ms 2392 KB Output is correct
8 Correct 4 ms 2644 KB Output is correct
9 Correct 7 ms 2648 KB Output is correct
10 Correct 2 ms 2392 KB Output is correct
11 Correct 6 ms 2696 KB Output is correct
12 Correct 8 ms 2648 KB Output is correct
13 Correct 7 ms 2648 KB Output is correct
14 Correct 8 ms 2648 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 2 ms 2392 KB Output is correct
8 Correct 4 ms 2644 KB Output is correct
9 Correct 7 ms 2648 KB Output is correct
10 Correct 2 ms 2392 KB Output is correct
11 Correct 6 ms 2696 KB Output is correct
12 Correct 8 ms 2648 KB Output is correct
13 Correct 7 ms 2648 KB Output is correct
14 Correct 8 ms 2648 KB Output is correct
15 Correct 24 ms 3304 KB Output is correct
16 Correct 22 ms 3272 KB Output is correct
17 Correct 23 ms 4012 KB Output is correct
18 Correct 23 ms 3544 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 2 ms 2392 KB Output is correct
8 Correct 4 ms 2644 KB Output is correct
9 Correct 7 ms 2648 KB Output is correct
10 Correct 2 ms 2392 KB Output is correct
11 Correct 6 ms 2696 KB Output is correct
12 Correct 8 ms 2648 KB Output is correct
13 Correct 7 ms 2648 KB Output is correct
14 Correct 8 ms 2648 KB Output is correct
15 Correct 24 ms 3304 KB Output is correct
16 Correct 22 ms 3272 KB Output is correct
17 Correct 23 ms 4012 KB Output is correct
18 Correct 23 ms 3544 KB Output is correct
19 Correct 27 ms 3540 KB Output is correct
20 Correct 24 ms 3540 KB Output is correct
21 Correct 23 ms 3900 KB Output is correct
22 Correct 23 ms 3584 KB Output is correct

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 2 ms 2392 KB Output is correct
8 Correct 4 ms 2644 KB Output is correct
9 Correct 7 ms 2648 KB Output is correct
10 Correct 2 ms 2392 KB Output is correct
11 Correct 6 ms 2696 KB Output is correct
12 Correct 8 ms 2648 KB Output is correct
13 Correct 7 ms 2648 KB Output is correct
14 Correct 8 ms 2648 KB Output is correct
15 Correct 24 ms 3304 KB Output is correct
16 Correct 22 ms 3272 KB Output is correct
17 Correct 23 ms 4012 KB Output is correct
18 Correct 23 ms 3544 KB Output is correct
19 Correct 27 ms 3540 KB Output is correct
20 Correct 24 ms 3540 KB Output is correct
21 Correct 23 ms 3900 KB Output is correct
22 Correct 23 ms 3584 KB Output is correct
23 Incorrect 26 ms 3292 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 2 ms 2392 KB Output is correct
8 Correct 4 ms 2644 KB Output is correct
9 Correct 7 ms 2648 KB Output is correct
10 Correct 2 ms 2392 KB Output is correct
11 Correct 6 ms 2696 KB Output is correct
12 Correct 8 ms 2648 KB Output is correct
13 Correct 7 ms 2648 KB Output is correct
14 Correct 8 ms 2648 KB Output is correct
15 Correct 24 ms 3304 KB Output is correct
16 Correct 22 ms 3272 KB Output is correct
17 Correct 23 ms 4012 KB Output is correct
18 Correct 23 ms 3544 KB Output is correct
19 Correct 27 ms 3540 KB Output is correct
20 Correct 24 ms 3540 KB Output is correct
21 Correct 23 ms 3900 KB Output is correct
22 Correct 23 ms 3584 KB Output is correct
23 Incorrect 26 ms 3292 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 2 ms 2392 KB Output is correct
8 Correct 4 ms 2644 KB Output is correct
9 Correct 7 ms 2648 KB Output is correct
10 Correct 2 ms 2392 KB Output is correct
11 Correct 6 ms 2696 KB Output is correct
12 Correct 8 ms 2648 KB Output is correct
13 Correct 7 ms 2648 KB Output is correct
14 Correct 8 ms 2648 KB Output is correct
15 Correct 24 ms 3304 KB Output is correct
16 Correct 22 ms 3272 KB Output is correct
17 Correct 23 ms 4012 KB Output is correct
18 Correct 23 ms 3544 KB Output is correct
19 Correct 27 ms 3540 KB Output is correct
20 Correct 24 ms 3540 KB Output is correct
21 Correct 23 ms 3900 KB Output is correct
22 Correct 23 ms 3584 KB Output is correct
23 Incorrect 26 ms 3292 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 2 ms 2392 KB Output is correct
8 Correct 4 ms 2644 KB Output is correct
9 Correct 7 ms 2648 KB Output is correct
10 Correct 2 ms 2392 KB Output is correct
11 Correct 6 ms 2696 KB Output is correct
12 Correct 8 ms 2648 KB Output is correct
13 Correct 7 ms 2648 KB Output is correct
14 Correct 8 ms 2648 KB Output is correct
15 Correct 24 ms 3304 KB Output is correct
16 Correct 22 ms 3272 KB Output is correct
17 Correct 23 ms 4012 KB Output is correct
18 Correct 23 ms 3544 KB Output is correct
19 Correct 27 ms 3540 KB Output is correct
20 Correct 24 ms 3540 KB Output is correct
21 Correct 23 ms 3900 KB Output is correct
22 Correct 23 ms 3584 KB Output is correct
23 Incorrect 26 ms 3292 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -