oj.uz

답안 #922871

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
922871 2024-02-06T08:32:51 Z boris_mihov Minerals (JOI19_minerals) C++17
75 / 100
 31 ms 4172 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];
int taken[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);

    int lg = 0;
    while ((1 << lg + 1) < n)
    {
        lg++;
    }

    for (int bit = lg ; bit >= 0 ; --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;
            }

            if (bit == 0 && taken[with[second[i]]])
            {
                if (taken[with[second[i]]] == 1)
                {
                    with[second[i]] |= (1 << bit);
                }

                continue;
            }
            
            int curr = countDiff;
            int next = query(second[i]);
            if (curr == next)
            {
                if (bit == 0) taken[with[second[i]]] = 2;
                with[second[i]] |= (1 << bit);
                cntIn--;
            } else
            {
                if (bit == 0) taken[with[second[i]]] = 1;
                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:46:27: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   46 |         if (unique.size() < n && (second.size() == n || query(i) > last))
      |             ~~~~~~~~~~~~~~^~~
minerals.cpp:46:49: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   46 |         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: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(unique.size() == n);
      |            ~~~~~~~~~~~~~~^~~~
minerals.cpp:57:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   57 |     assert(second.size() == n);
      |            ~~~~~~~~~~~~~~^~~~
minerals.cpp:60:21: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   60 |     while ((1 << lg + 1) < n)
      |                  ~~~^~~
minerals.cpp:42:9: warning: unused variable 'cnt' [-Wunused-variable]
   42 |     int cnt = 0;
      |         ^~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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

# 결과 실행 시간 메모리 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 2648 KB Output is correct
5 Correct 8 ms 2864 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 2648 KB Output is correct
9 Correct 8 ms 2864 KB Output is correct
10 Correct 1 ms 2388 KB Output is correct
11 Correct 6 ms 2564 KB Output is correct
12 Correct 8 ms 2904 KB Output is correct
13 Correct 8 ms 3160 KB Output is correct
14 Correct 8 ms 3360 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 2648 KB Output is correct
9 Correct 8 ms 2864 KB Output is correct
10 Correct 1 ms 2388 KB Output is correct
11 Correct 6 ms 2564 KB Output is correct
12 Correct 8 ms 2904 KB Output is correct
13 Correct 8 ms 3160 KB Output is correct
14 Correct 8 ms 3360 KB Output is correct
15 Correct 31 ms 3540 KB Output is correct
16 Correct 26 ms 3540 KB Output is correct
17 Correct 25 ms 3792 KB Output is correct
18 Correct 24 ms 4004 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 2648 KB Output is correct
9 Correct 8 ms 2864 KB Output is correct
10 Correct 1 ms 2388 KB Output is correct
11 Correct 6 ms 2564 KB Output is correct
12 Correct 8 ms 2904 KB Output is correct
13 Correct 8 ms 3160 KB Output is correct
14 Correct 8 ms 3360 KB Output is correct
15 Correct 31 ms 3540 KB Output is correct
16 Correct 26 ms 3540 KB Output is correct
17 Correct 25 ms 3792 KB Output is correct
18 Correct 24 ms 4004 KB Output is correct
19 Correct 27 ms 3676 KB Output is correct
20 Correct 31 ms 3684 KB Output is correct
21 Correct 27 ms 4052 KB Output is correct
22 Correct 27 ms 4172 KB Output is correct

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 2648 KB Output is correct
9 Correct 8 ms 2864 KB Output is correct
10 Correct 1 ms 2388 KB Output is correct
11 Correct 6 ms 2564 KB Output is correct
12 Correct 8 ms 2904 KB Output is correct
13 Correct 8 ms 3160 KB Output is correct
14 Correct 8 ms 3360 KB Output is correct
15 Correct 31 ms 3540 KB Output is correct
16 Correct 26 ms 3540 KB Output is correct
17 Correct 25 ms 3792 KB Output is correct
18 Correct 24 ms 4004 KB Output is correct
19 Correct 27 ms 3676 KB Output is correct
20 Correct 31 ms 3684 KB Output is correct
21 Correct 27 ms 4052 KB Output is correct
22 Correct 27 ms 4172 KB Output is correct
23 Incorrect 28 ms 3532 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 2648 KB Output is correct
9 Correct 8 ms 2864 KB Output is correct
10 Correct 1 ms 2388 KB Output is correct
11 Correct 6 ms 2564 KB Output is correct
12 Correct 8 ms 2904 KB Output is correct
13 Correct 8 ms 3160 KB Output is correct
14 Correct 8 ms 3360 KB Output is correct
15 Correct 31 ms 3540 KB Output is correct
16 Correct 26 ms 3540 KB Output is correct
17 Correct 25 ms 3792 KB Output is correct
18 Correct 24 ms 4004 KB Output is correct
19 Correct 27 ms 3676 KB Output is correct
20 Correct 31 ms 3684 KB Output is correct
21 Correct 27 ms 4052 KB Output is correct
22 Correct 27 ms 4172 KB Output is correct
23 Incorrect 28 ms 3532 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 2648 KB Output is correct
9 Correct 8 ms 2864 KB Output is correct
10 Correct 1 ms 2388 KB Output is correct
11 Correct 6 ms 2564 KB Output is correct
12 Correct 8 ms 2904 KB Output is correct
13 Correct 8 ms 3160 KB Output is correct
14 Correct 8 ms 3360 KB Output is correct
15 Correct 31 ms 3540 KB Output is correct
16 Correct 26 ms 3540 KB Output is correct
17 Correct 25 ms 3792 KB Output is correct
18 Correct 24 ms 4004 KB Output is correct
19 Correct 27 ms 3676 KB Output is correct
20 Correct 31 ms 3684 KB Output is correct
21 Correct 27 ms 4052 KB Output is correct
22 Correct 27 ms 4172 KB Output is correct
23 Incorrect 28 ms 3532 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 2648 KB Output is correct
9 Correct 8 ms 2864 KB Output is correct
10 Correct 1 ms 2388 KB Output is correct
11 Correct 6 ms 2564 KB Output is correct
12 Correct 8 ms 2904 KB Output is correct
13 Correct 8 ms 3160 KB Output is correct
14 Correct 8 ms 3360 KB Output is correct
15 Correct 31 ms 3540 KB Output is correct
16 Correct 26 ms 3540 KB Output is correct
17 Correct 25 ms 3792 KB Output is correct
18 Correct 24 ms 4004 KB Output is correct
19 Correct 27 ms 3676 KB Output is correct
20 Correct 31 ms 3684 KB Output is correct
21 Correct 27 ms 4052 KB Output is correct
22 Correct 27 ms 4172 KB Output is correct
23 Incorrect 28 ms 3532 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -