oj.uz

답안 #922891

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
922891 2024-02-06T09:02:20 Z boris_mihov Minerals (JOI19_minerals) C++17
85 / 100
 38 ms 5208 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 min[MAXN];
int with[MAXN];
int perm[MAXN];
bool isIn[MAXN];
int taken[MAXN];
int taken0[MAXN];
int taken1[MAXN];
int taken2[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++;
    }

    int maskFound = 0;
    for (int bit = lg ; bit >= 0 ; --bit)
    {
        // std::cout << "  new bit: " << bit << '\n';        
        std::fill(taken, taken + n, 0);
        std::fill(taken0, taken0 + n, 0);
        std::fill(taken1, taken1 + n, 0);
        std::fill(min, min + n, INF);
        for (int i = 0 ; i < n ; ++i)
        {
            // std::cout << "prefix: " << i << ' ' << (maskFound & i) << '\n';
            taken[(i >> bit + 1) << bit + 1]++;
            taken2[(i >> bit + 1) << bit + 1]++;
            if (i & (1 << bit)) taken1[(i >> bit + 1) << bit + 1]++;
            else taken0[(i >> bit + 1) << bit + 1]++;

            if (((i & (1 << bit)) > 0) != isIn[unique[i]])
            {
                query(unique[i]);
            }

            if (isIn[unique[i]])
            {
                min[(i >> bit + 1) << bit + 1] = std::min(min[(i >> bit + 1) << bit + 1], i);
            }
        }

        // std::cout << "zero: " << taken[0] << ' ' << n << '\n';
        for (int i = 0 ; i < n ; ++i)
        {
            taken[with[second[i]]]--;
            if (to[second[i]] < min[with[second[i]]])
            {
                taken0[with[second[i]]]--;
                continue;
            }

            if (taken1[with[second[i]]] == 0)
            {
                taken0[with[second[i]]]--;
                continue;
            }

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

        maskFound |= (1 << bit);
    }

    for (int i = 0 ; i < n ; ++i)
    {
        // if (!(1 <= unique[with[second[i]]] && unique[with[second[i]]] <= 2 * n))
        // {
        //     std::cout << "the fuck: " << second[i] << ' ' << with[second[i]] << ' ' << unique[with[second[i]]] << '\n';
        // }
        answer(second[i], unique[with[second[i]]]);
    }
}

Compilation message

minerals.cpp: In function 'void Solve(int)':
minerals.cpp:50:27: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   50 |         if (unique.size() < n && (second.size() == n || query(i) > last))
      |             ~~~~~~~~~~~~~~^~~
minerals.cpp:50:49: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   50 |         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:60:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   60 |     assert(unique.size() == n);
      |            ~~~~~~~~~~~~~~^~~~
minerals.cpp:61:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   61 |     assert(second.size() == n);
      |            ~~~~~~~~~~~~~~^~~~
minerals.cpp:64:21: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   64 |     while ((1 << lg + 1) < n)
      |                  ~~~^~~
minerals.cpp:80:29: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   80 |             taken[(i >> bit + 1) << bit + 1]++;
      |                         ~~~~^~~
minerals.cpp:80:41: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   80 |             taken[(i >> bit + 1) << bit + 1]++;
      |                                     ~~~~^~~
minerals.cpp:81:30: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   81 |             taken2[(i >> bit + 1) << bit + 1]++;
      |                          ~~~~^~~
minerals.cpp:81:42: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   81 |             taken2[(i >> bit + 1) << bit + 1]++;
      |                                      ~~~~^~~
minerals.cpp:82:50: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   82 |             if (i & (1 << bit)) taken1[(i >> bit + 1) << bit + 1]++;
      |                                              ~~~~^~~
minerals.cpp:82:62: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   82 |             if (i & (1 << bit)) taken1[(i >> bit + 1) << bit + 1]++;
      |                                                          ~~~~^~~
minerals.cpp:83:35: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   83 |             else taken0[(i >> bit + 1) << bit + 1]++;
      |                               ~~~~^~~
minerals.cpp:83:47: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   83 |             else taken0[(i >> bit + 1) << bit + 1]++;
      |                                           ~~~~^~~
minerals.cpp:92:31: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   92 |                 min[(i >> bit + 1) << bit + 1] = std::min(min[(i >> bit + 1) << bit + 1], i);
      |                           ~~~~^~~
minerals.cpp:92:43: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   92 |                 min[(i >> bit + 1) << bit + 1] = std::min(min[(i >> bit + 1) << bit + 1], i);
      |                                       ~~~~^~~
minerals.cpp:92:73: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   92 |                 min[(i >> bit + 1) << bit + 1] = std::min(min[(i >> bit + 1) << bit + 1], i);
      |                                                                     ~~~~^~~
minerals.cpp:92:85: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   92 |                 min[(i >> bit + 1) << bit + 1] = std::min(min[(i >> bit + 1) << bit + 1], i);
      |                                                                                 ~~~~^~~
minerals.cpp:46:9: warning: unused variable 'cnt' [-Wunused-variable]
   46 |     int cnt = 0;
      |         ^~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 ms 2484 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 2644 KB Output is correct
3 Correct 3 ms 2648 KB Output is correct
4 Correct 5 ms 2856 KB Output is correct
5 Correct 10 ms 3160 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 ms 2484 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 2644 KB Output is correct
7 Correct 3 ms 2648 KB Output is correct
8 Correct 5 ms 2856 KB Output is correct
9 Correct 10 ms 3160 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 7 ms 3016 KB Output is correct
12 Correct 12 ms 3160 KB Output is correct
13 Correct 10 ms 3308 KB Output is correct
14 Correct 10 ms 3160 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 ms 2484 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 2644 KB Output is correct
7 Correct 3 ms 2648 KB Output is correct
8 Correct 5 ms 2856 KB Output is correct
9 Correct 10 ms 3160 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 7 ms 3016 KB Output is correct
12 Correct 12 ms 3160 KB Output is correct
13 Correct 10 ms 3308 KB Output is correct
14 Correct 10 ms 3160 KB Output is correct
15 Correct 32 ms 4560 KB Output is correct
16 Correct 34 ms 4576 KB Output is correct
17 Correct 36 ms 4712 KB Output is correct
18 Correct 32 ms 4696 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 ms 2484 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 2644 KB Output is correct
7 Correct 3 ms 2648 KB Output is correct
8 Correct 5 ms 2856 KB Output is correct
9 Correct 10 ms 3160 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 7 ms 3016 KB Output is correct
12 Correct 12 ms 3160 KB Output is correct
13 Correct 10 ms 3308 KB Output is correct
14 Correct 10 ms 3160 KB Output is correct
15 Correct 32 ms 4560 KB Output is correct
16 Correct 34 ms 4576 KB Output is correct
17 Correct 36 ms 4712 KB Output is correct
18 Correct 32 ms 4696 KB Output is correct
19 Correct 34 ms 4688 KB Output is correct
20 Correct 32 ms 4432 KB Output is correct
21 Correct 34 ms 4764 KB Output is correct
22 Correct 32 ms 4444 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 ms 2484 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 2644 KB Output is correct
7 Correct 3 ms 2648 KB Output is correct
8 Correct 5 ms 2856 KB Output is correct
9 Correct 10 ms 3160 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 7 ms 3016 KB Output is correct
12 Correct 12 ms 3160 KB Output is correct
13 Correct 10 ms 3308 KB Output is correct
14 Correct 10 ms 3160 KB Output is correct
15 Correct 32 ms 4560 KB Output is correct
16 Correct 34 ms 4576 KB Output is correct
17 Correct 36 ms 4712 KB Output is correct
18 Correct 32 ms 4696 KB Output is correct
19 Correct 34 ms 4688 KB Output is correct
20 Correct 32 ms 4432 KB Output is correct
21 Correct 34 ms 4764 KB Output is correct
22 Correct 32 ms 4444 KB Output is correct
23 Correct 35 ms 4824 KB Output is correct
24 Correct 33 ms 4584 KB Output is correct
25 Correct 33 ms 4680 KB Output is correct
26 Correct 32 ms 4568 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 ms 2484 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 2644 KB Output is correct
7 Correct 3 ms 2648 KB Output is correct
8 Correct 5 ms 2856 KB Output is correct
9 Correct 10 ms 3160 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 7 ms 3016 KB Output is correct
12 Correct 12 ms 3160 KB Output is correct
13 Correct 10 ms 3308 KB Output is correct
14 Correct 10 ms 3160 KB Output is correct
15 Correct 32 ms 4560 KB Output is correct
16 Correct 34 ms 4576 KB Output is correct
17 Correct 36 ms 4712 KB Output is correct
18 Correct 32 ms 4696 KB Output is correct
19 Correct 34 ms 4688 KB Output is correct
20 Correct 32 ms 4432 KB Output is correct
21 Correct 34 ms 4764 KB Output is correct
22 Correct 32 ms 4444 KB Output is correct
23 Correct 35 ms 4824 KB Output is correct
24 Correct 33 ms 4584 KB Output is correct
25 Correct 33 ms 4680 KB Output is correct
26 Correct 32 ms 4568 KB Output is correct
27 Correct 38 ms 4600 KB Output is correct
28 Correct 34 ms 4820 KB Output is correct
29 Correct 35 ms 5208 KB Output is correct
30 Correct 36 ms 4716 KB Output is correct

Subtask #8
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 ms 2484 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 2644 KB Output is correct
7 Correct 3 ms 2648 KB Output is correct
8 Correct 5 ms 2856 KB Output is correct
9 Correct 10 ms 3160 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 7 ms 3016 KB Output is correct
12 Correct 12 ms 3160 KB Output is correct
13 Correct 10 ms 3308 KB Output is correct
14 Correct 10 ms 3160 KB Output is correct
15 Correct 32 ms 4560 KB Output is correct
16 Correct 34 ms 4576 KB Output is correct
17 Correct 36 ms 4712 KB Output is correct
18 Correct 32 ms 4696 KB Output is correct
19 Correct 34 ms 4688 KB Output is correct
20 Correct 32 ms 4432 KB Output is correct
21 Correct 34 ms 4764 KB Output is correct
22 Correct 32 ms 4444 KB Output is correct
23 Correct 35 ms 4824 KB Output is correct
24 Correct 33 ms 4584 KB Output is correct
25 Correct 33 ms 4680 KB Output is correct
26 Correct 32 ms 4568 KB Output is correct
27 Correct 38 ms 4600 KB Output is correct
28 Correct 34 ms 4820 KB Output is correct
29 Correct 35 ms 5208 KB Output is correct
30 Correct 36 ms 4716 KB Output is correct
31 Incorrect 35 ms 4352 KB Wrong Answer [2]
32 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 0 ms 2484 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 2644 KB Output is correct
7 Correct 3 ms 2648 KB Output is correct
8 Correct 5 ms 2856 KB Output is correct
9 Correct 10 ms 3160 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 7 ms 3016 KB Output is correct
12 Correct 12 ms 3160 KB Output is correct
13 Correct 10 ms 3308 KB Output is correct
14 Correct 10 ms 3160 KB Output is correct
15 Correct 32 ms 4560 KB Output is correct
16 Correct 34 ms 4576 KB Output is correct
17 Correct 36 ms 4712 KB Output is correct
18 Correct 32 ms 4696 KB Output is correct
19 Correct 34 ms 4688 KB Output is correct
20 Correct 32 ms 4432 KB Output is correct
21 Correct 34 ms 4764 KB Output is correct
22 Correct 32 ms 4444 KB Output is correct
23 Correct 35 ms 4824 KB Output is correct
24 Correct 33 ms 4584 KB Output is correct
25 Correct 33 ms 4680 KB Output is correct
26 Correct 32 ms 4568 KB Output is correct
27 Correct 38 ms 4600 KB Output is correct
28 Correct 34 ms 4820 KB Output is correct
29 Correct 35 ms 5208 KB Output is correct
30 Correct 36 ms 4716 KB Output is correct
31 Incorrect 35 ms 4352 KB Wrong Answer [2]
32 Halted 0 ms 0 KB -