oj.uz

답안 #795638

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
795638 2023-07-27T11:58:21 Z SlavicG Minerals (JOI19_minerals) C++17
75 / 100
 844 ms 2388 KB 
#include <bits/stdc++.h>
#include "minerals.h"
using namespace std;
 
mt19937 rng(69);
void Solve(int n) {
    vector<int> p1, p2;
    int ans = 0, prevans = -1;
    vector<int> bulanea(2 * n);
    iota(bulanea.begin(), bulanea.end(), 1);
    shuffle(bulanea.begin(), bulanea.end(), rng);
    for(int i: bulanea) {
        ans = Query(i);
        if(ans == prevans) {
            p2.push_back(i);
        } else {
            p1.push_back(i);
        }
        prevans = ans;
    }
    assert(p1.size() == n && p2.size() == n);
    vector<int> pr(n, 0);
    int IN = 1;
    vector<bool> bagat(n, 1);
    vector<int> bit_order;
    vector<int> best_order; int mn = INT_MAX;
    for(int bit = 0; (1 << bit) < n; ++bit) {
        bit_order.push_back(bit);
    }
    int f = 0;
    while(f++ < 550) {
        vector<bool> bruh(n, true);
        int cost = 0;
        for(int b: bit_order) {
            for(int i = 0; i < n; ++i) {
                if(i >> b & 1) {
                    if(!bruh[i]) ++cost;
                    bruh[i] = 1;
                } else {
                    if(bruh[i]) ++cost;
                    bruh[i] = 0;
                }
            }
        }
        if(cost < mn) {
            mn = cost;
            best_order = bit_order;
        }
        shuffle(bit_order.begin(), bit_order.end(), rng);
    }
    for(int bit: best_order) {
        int cntt = 0;
        for(int i = 0; i < n; ++i) {
            if(i >> bit & 1) {
                ++cntt;
                if(!bagat[i]) prevans = Query(p1[i]);
                bagat[i] = 1;
            } else {
                if(bagat[i]) prevans = Query(p1[i]);
                bagat[i] = 0;
            }
        }
        for(int i = 0; i < n && cntt; ++i) {
            if(pr[i] + (1 << bit) >= n) continue;
            int ans = Query(p2[i]);
            if(ans == prevans) {
                pr[i] += (1 << bit);
                --cntt;
            }
            prevans = ans;
        }
        IN ^= 1;
    }
    for(int i = 0; i < n; ++i) {
        Answer(p2[i], p1[pr[i]]);
    }
}
/*
4
1 5
2 6
3 4
7 8
*/

Compilation message

In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from minerals.cpp:1:
minerals.cpp: In function 'void Solve(int)':
minerals.cpp:21:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   21 |     assert(p1.size() == n && p2.size() == n);
      |            ~~~~~~~~~~^~~~
minerals.cpp:21:40: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   21 |     assert(p1.size() == n && p2.size() == n);
      |                              ~~~~~~~~~~^~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 356 KB Output is correct
2 Correct 34 ms 396 KB Output is correct
3 Correct 64 ms 484 KB Output is correct
4 Correct 138 ms 644 KB Output is correct
5 Correct 292 ms 912 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 14 ms 356 KB Output is correct
6 Correct 34 ms 396 KB Output is correct
7 Correct 64 ms 484 KB Output is correct
8 Correct 138 ms 644 KB Output is correct
9 Correct 292 ms 912 KB Output is correct
10 Correct 14 ms 336 KB Output is correct
11 Correct 186 ms 752 KB Output is correct
12 Correct 282 ms 1056 KB Output is correct
13 Correct 292 ms 956 KB Output is correct
14 Correct 290 ms 904 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 14 ms 356 KB Output is correct
6 Correct 34 ms 396 KB Output is correct
7 Correct 64 ms 484 KB Output is correct
8 Correct 138 ms 644 KB Output is correct
9 Correct 292 ms 912 KB Output is correct
10 Correct 14 ms 336 KB Output is correct
11 Correct 186 ms 752 KB Output is correct
12 Correct 282 ms 1056 KB Output is correct
13 Correct 292 ms 956 KB Output is correct
14 Correct 290 ms 904 KB Output is correct
15 Correct 807 ms 2348 KB Output is correct
16 Correct 809 ms 2348 KB Output is correct
17 Correct 813 ms 2340 KB Output is correct
18 Correct 805 ms 2196 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 14 ms 356 KB Output is correct
6 Correct 34 ms 396 KB Output is correct
7 Correct 64 ms 484 KB Output is correct
8 Correct 138 ms 644 KB Output is correct
9 Correct 292 ms 912 KB Output is correct
10 Correct 14 ms 336 KB Output is correct
11 Correct 186 ms 752 KB Output is correct
12 Correct 282 ms 1056 KB Output is correct
13 Correct 292 ms 956 KB Output is correct
14 Correct 290 ms 904 KB Output is correct
15 Correct 807 ms 2348 KB Output is correct
16 Correct 809 ms 2348 KB Output is correct
17 Correct 813 ms 2340 KB Output is correct
18 Correct 805 ms 2196 KB Output is correct
19 Correct 837 ms 2388 KB Output is correct
20 Correct 837 ms 2380 KB Output is correct
21 Correct 829 ms 2388 KB Output is correct
22 Correct 827 ms 2232 KB Output is correct

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 14 ms 356 KB Output is correct
6 Correct 34 ms 396 KB Output is correct
7 Correct 64 ms 484 KB Output is correct
8 Correct 138 ms 644 KB Output is correct
9 Correct 292 ms 912 KB Output is correct
10 Correct 14 ms 336 KB Output is correct
11 Correct 186 ms 752 KB Output is correct
12 Correct 282 ms 1056 KB Output is correct
13 Correct 292 ms 956 KB Output is correct
14 Correct 290 ms 904 KB Output is correct
15 Correct 807 ms 2348 KB Output is correct
16 Correct 809 ms 2348 KB Output is correct
17 Correct 813 ms 2340 KB Output is correct
18 Correct 805 ms 2196 KB Output is correct
19 Correct 837 ms 2388 KB Output is correct
20 Correct 837 ms 2380 KB Output is correct
21 Correct 829 ms 2388 KB Output is correct
22 Correct 827 ms 2232 KB Output is correct
23 Incorrect 844 ms 2176 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 14 ms 356 KB Output is correct
6 Correct 34 ms 396 KB Output is correct
7 Correct 64 ms 484 KB Output is correct
8 Correct 138 ms 644 KB Output is correct
9 Correct 292 ms 912 KB Output is correct
10 Correct 14 ms 336 KB Output is correct
11 Correct 186 ms 752 KB Output is correct
12 Correct 282 ms 1056 KB Output is correct
13 Correct 292 ms 956 KB Output is correct
14 Correct 290 ms 904 KB Output is correct
15 Correct 807 ms 2348 KB Output is correct
16 Correct 809 ms 2348 KB Output is correct
17 Correct 813 ms 2340 KB Output is correct
18 Correct 805 ms 2196 KB Output is correct
19 Correct 837 ms 2388 KB Output is correct
20 Correct 837 ms 2380 KB Output is correct
21 Correct 829 ms 2388 KB Output is correct
22 Correct 827 ms 2232 KB Output is correct
23 Incorrect 844 ms 2176 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 14 ms 356 KB Output is correct
6 Correct 34 ms 396 KB Output is correct
7 Correct 64 ms 484 KB Output is correct
8 Correct 138 ms 644 KB Output is correct
9 Correct 292 ms 912 KB Output is correct
10 Correct 14 ms 336 KB Output is correct
11 Correct 186 ms 752 KB Output is correct
12 Correct 282 ms 1056 KB Output is correct
13 Correct 292 ms 956 KB Output is correct
14 Correct 290 ms 904 KB Output is correct
15 Correct 807 ms 2348 KB Output is correct
16 Correct 809 ms 2348 KB Output is correct
17 Correct 813 ms 2340 KB Output is correct
18 Correct 805 ms 2196 KB Output is correct
19 Correct 837 ms 2388 KB Output is correct
20 Correct 837 ms 2380 KB Output is correct
21 Correct 829 ms 2388 KB Output is correct
22 Correct 827 ms 2232 KB Output is correct
23 Incorrect 844 ms 2176 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 2 ms 208 KB Output is correct
5 Correct 14 ms 356 KB Output is correct
6 Correct 34 ms 396 KB Output is correct
7 Correct 64 ms 484 KB Output is correct
8 Correct 138 ms 644 KB Output is correct
9 Correct 292 ms 912 KB Output is correct
10 Correct 14 ms 336 KB Output is correct
11 Correct 186 ms 752 KB Output is correct
12 Correct 282 ms 1056 KB Output is correct
13 Correct 292 ms 956 KB Output is correct
14 Correct 290 ms 904 KB Output is correct
15 Correct 807 ms 2348 KB Output is correct
16 Correct 809 ms 2348 KB Output is correct
17 Correct 813 ms 2340 KB Output is correct
18 Correct 805 ms 2196 KB Output is correct
19 Correct 837 ms 2388 KB Output is correct
20 Correct 837 ms 2380 KB Output is correct
21 Correct 829 ms 2388 KB Output is correct
22 Correct 827 ms 2232 KB Output is correct
23 Incorrect 844 ms 2176 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -