oj.uz

Submission #922856

# Submission time Handle Problem Language Result Execution time Memory
922856 2024-02-06T08:10:56 Z boris_mihov Minerals (JOI19_minerals) C++17
70 / 100
 29 ms 2840 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(12345);

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 last = 0;
    for (int i = 1 ; i <= 2 * n ; ++i)
    {
        if (unique.size() < n && (second.size() == n || query(i) > last))
        {
            last++;
            unique.push_back(i);
        } else
        {
            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;
        for (int i = 0 ; i < n ; ++i)
        {
            if (!((i & (1 << bit)) > 0) != isIn[unique[i]])
            {
                query(unique[i]);
            }

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

        for (int i = 0 ; i < n ; ++i)
        {
            if (cntIn == 0)
            {
                with[second[i]] |= (1 << bit);
                continue;
            }

            if (cntOut == 0)
            {
                continue;
            }

            int curr = countDiff;
            int next = query(second[i]);
            if (curr == next)
            {
                cntIn--;
            } else
            {
                with[second[i]] |= (1 << bit);
                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:43:27: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   43 |         if (unique.size() < n && (second.size() == n || query(i) > last))
      |             ~~~~~~~~~~~~~~^~~
minerals.cpp:43:49: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   43 |         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:53:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   53 |     assert(unique.size() == n);
      |            ~~~~~~~~~~~~~~^~~~
minerals.cpp:54:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   54 |     assert(second.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 1 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 1 ms 344 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 1068 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 1 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 1 ms 344 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 1068 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 5 ms 1180 KB Output is correct
12 Correct 8 ms 1368 KB Output is correct
13 Correct 8 ms 1540 KB Output is correct
14 Correct 7 ms 1112 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 1 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 1 ms 344 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 1068 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 5 ms 1180 KB Output is correct
12 Correct 8 ms 1368 KB Output is correct
13 Correct 8 ms 1540 KB Output is correct
14 Correct 7 ms 1112 KB Output is correct
15 Correct 29 ms 2840 KB Output is correct
16 Correct 26 ms 2776 KB Output is correct
17 Correct 28 ms 2724 KB Output is correct
18 Correct 23 ms 2720 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 1 ms 344 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 1068 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 5 ms 1180 KB Output is correct
12 Correct 8 ms 1368 KB Output is correct
13 Correct 8 ms 1540 KB Output is correct
14 Correct 7 ms 1112 KB Output is correct
15 Correct 29 ms 2840 KB Output is correct
16 Correct 26 ms 2776 KB Output is correct
17 Correct 28 ms 2724 KB Output is correct
18 Correct 23 ms 2720 KB Output is correct
19 Incorrect 28 ms 2260 KB Wrong Answer [2]
20 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 1 ms 344 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 1068 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 5 ms 1180 KB Output is correct
12 Correct 8 ms 1368 KB Output is correct
13 Correct 8 ms 1540 KB Output is correct
14 Correct 7 ms 1112 KB Output is correct
15 Correct 29 ms 2840 KB Output is correct
16 Correct 26 ms 2776 KB Output is correct
17 Correct 28 ms 2724 KB Output is correct
18 Correct 23 ms 2720 KB Output is correct
19 Incorrect 28 ms 2260 KB Wrong Answer [2]
20 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 1 ms 344 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 1068 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 5 ms 1180 KB Output is correct
12 Correct 8 ms 1368 KB Output is correct
13 Correct 8 ms 1540 KB Output is correct
14 Correct 7 ms 1112 KB Output is correct
15 Correct 29 ms 2840 KB Output is correct
16 Correct 26 ms 2776 KB Output is correct
17 Correct 28 ms 2724 KB Output is correct
18 Correct 23 ms 2720 KB Output is correct
19 Incorrect 28 ms 2260 KB Wrong Answer [2]
20 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 1 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 1 ms 344 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 1068 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 5 ms 1180 KB Output is correct
12 Correct 8 ms 1368 KB Output is correct
13 Correct 8 ms 1540 KB Output is correct
14 Correct 7 ms 1112 KB Output is correct
15 Correct 29 ms 2840 KB Output is correct
16 Correct 26 ms 2776 KB Output is correct
17 Correct 28 ms 2724 KB Output is correct
18 Correct 23 ms 2720 KB Output is correct
19 Incorrect 28 ms 2260 KB Wrong Answer [2]
20 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 1 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 1 ms 344 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 1068 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 5 ms 1180 KB Output is correct
12 Correct 8 ms 1368 KB Output is correct
13 Correct 8 ms 1540 KB Output is correct
14 Correct 7 ms 1112 KB Output is correct
15 Correct 29 ms 2840 KB Output is correct
16 Correct 26 ms 2776 KB Output is correct
17 Correct 28 ms 2724 KB Output is correct
18 Correct 23 ms 2720 KB Output is correct
19 Incorrect 28 ms 2260 KB Wrong Answer [2]
20 Halted 0 ms 0 KB -