oj.uz

답안 #795670

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
795670 2023-07-27T12:39:18 Z AbdullahMohammedAhmad Minerals (JOI19_minerals) C++14
75 / 100
 27 ms 2400 KB 
#include "minerals.h"
#include <bits/stdc++.h>
using namespace std;

mt19937 rng(66);
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);
    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++ < 1) {
        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;
        }
    }
    for(int i = 0; i < n; ++i) {
        Answer(p2[i], p1[pr[i]]);
    }
}

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:2:
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 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 336 KB Output is correct
3 Correct 2 ms 464 KB Output is correct
4 Correct 5 ms 624 KB Output is correct
5 Correct 8 ms 976 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 2 ms 464 KB Output is correct
8 Correct 5 ms 624 KB Output is correct
9 Correct 8 ms 976 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 5 ms 848 KB Output is correct
12 Correct 10 ms 1120 KB Output is correct
13 Correct 11 ms 1004 KB Output is correct
14 Correct 7 ms 920 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 2 ms 464 KB Output is correct
8 Correct 5 ms 624 KB Output is correct
9 Correct 8 ms 976 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 5 ms 848 KB Output is correct
12 Correct 10 ms 1120 KB Output is correct
13 Correct 11 ms 1004 KB Output is correct
14 Correct 7 ms 920 KB Output is correct
15 Correct 27 ms 2348 KB Output is correct
16 Correct 24 ms 2384 KB Output is correct
17 Correct 24 ms 2340 KB Output is correct
18 Correct 24 ms 2120 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 2 ms 464 KB Output is correct
8 Correct 5 ms 624 KB Output is correct
9 Correct 8 ms 976 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 5 ms 848 KB Output is correct
12 Correct 10 ms 1120 KB Output is correct
13 Correct 11 ms 1004 KB Output is correct
14 Correct 7 ms 920 KB Output is correct
15 Correct 27 ms 2348 KB Output is correct
16 Correct 24 ms 2384 KB Output is correct
17 Correct 24 ms 2340 KB Output is correct
18 Correct 24 ms 2120 KB Output is correct
19 Correct 26 ms 2380 KB Output is correct
20 Correct 24 ms 2400 KB Output is correct
21 Correct 25 ms 2376 KB Output is correct
22 Correct 24 ms 2184 KB Output is correct

Subtask #6
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 2 ms 464 KB Output is correct
8 Correct 5 ms 624 KB Output is correct
9 Correct 8 ms 976 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 5 ms 848 KB Output is correct
12 Correct 10 ms 1120 KB Output is correct
13 Correct 11 ms 1004 KB Output is correct
14 Correct 7 ms 920 KB Output is correct
15 Correct 27 ms 2348 KB Output is correct
16 Correct 24 ms 2384 KB Output is correct
17 Correct 24 ms 2340 KB Output is correct
18 Correct 24 ms 2120 KB Output is correct
19 Correct 26 ms 2380 KB Output is correct
20 Correct 24 ms 2400 KB Output is correct
21 Correct 25 ms 2376 KB Output is correct
22 Correct 24 ms 2184 KB Output is correct
23 Incorrect 26 ms 2188 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 2 ms 464 KB Output is correct
8 Correct 5 ms 624 KB Output is correct
9 Correct 8 ms 976 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 5 ms 848 KB Output is correct
12 Correct 10 ms 1120 KB Output is correct
13 Correct 11 ms 1004 KB Output is correct
14 Correct 7 ms 920 KB Output is correct
15 Correct 27 ms 2348 KB Output is correct
16 Correct 24 ms 2384 KB Output is correct
17 Correct 24 ms 2340 KB Output is correct
18 Correct 24 ms 2120 KB Output is correct
19 Correct 26 ms 2380 KB Output is correct
20 Correct 24 ms 2400 KB Output is correct
21 Correct 25 ms 2376 KB Output is correct
22 Correct 24 ms 2184 KB Output is correct
23 Incorrect 26 ms 2188 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 2 ms 464 KB Output is correct
8 Correct 5 ms 624 KB Output is correct
9 Correct 8 ms 976 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 5 ms 848 KB Output is correct
12 Correct 10 ms 1120 KB Output is correct
13 Correct 11 ms 1004 KB Output is correct
14 Correct 7 ms 920 KB Output is correct
15 Correct 27 ms 2348 KB Output is correct
16 Correct 24 ms 2384 KB Output is correct
17 Correct 24 ms 2340 KB Output is correct
18 Correct 24 ms 2120 KB Output is correct
19 Correct 26 ms 2380 KB Output is correct
20 Correct 24 ms 2400 KB Output is correct
21 Correct 25 ms 2376 KB Output is correct
22 Correct 24 ms 2184 KB Output is correct
23 Incorrect 26 ms 2188 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 2 ms 464 KB Output is correct
8 Correct 5 ms 624 KB Output is correct
9 Correct 8 ms 976 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 5 ms 848 KB Output is correct
12 Correct 10 ms 1120 KB Output is correct
13 Correct 11 ms 1004 KB Output is correct
14 Correct 7 ms 920 KB Output is correct
15 Correct 27 ms 2348 KB Output is correct
16 Correct 24 ms 2384 KB Output is correct
17 Correct 24 ms 2340 KB Output is correct
18 Correct 24 ms 2120 KB Output is correct
19 Correct 26 ms 2380 KB Output is correct
20 Correct 24 ms 2400 KB Output is correct
21 Correct 25 ms 2376 KB Output is correct
22 Correct 24 ms 2184 KB Output is correct
23 Incorrect 26 ms 2188 KB Wrong Answer [2]
24 Halted 0 ms 0 KB -