oj.uz

Submission #440315

# Submission time Handle Problem Language Result Execution time Memory
440315 2021-07-02T03:45:58 Z SorahISA Handcrafted Gift (IOI20_gift) C++17
100 / 100
 276 ms 35560 KB 
#include "gift.h"
#include <bits/stdc++.h>
using namespace std;

using pii = pair<int, int>;
template<typename T>
using Prior = std::priority_queue<T>;
template<typename T>
using prior = std::priority_queue<T, vector<T>, greater<T>>;

#define X first
#define Y second
#define eb emplace_back
#define pb pop_back
#define pf pop_front
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

vector<pii> merge_overlap(vector<pii> &vec) {
    sort(ALL(vec));
    vector<pii> ret;
    int L = vec.front().X, maxR = vec.front().Y;
    for (auto [l, r] : vec) {
        if (l <= maxR) maxR = max(maxR, r);
        else ret.eb(L, maxR), tie(L, maxR) = tie(l, r);
    }
    ret.eb(L, maxR);
    return ret;
}

int construct(int N, int R, vector<int> A, vector<int> B, vector<int> X) {
    
    vector<pii> identical;
    for (int i = 0; i < N; ++i) identical.eb(i, i);
    for (int i = 0; i < R; ++i) {
        if (X[i] == 1) identical.eb(A[i], B[i]);
    }
    identical = merge_overlap(identical);
    
    string str(N, ' ');
    for (int i = 0; i < identical.size(); ++i) {
        // cerr << identical[i].X << " " << identical[i].Y << "\n";
        for (int j = identical[i].X; j <= identical[i].Y; ++j) str[j] = "RB"[i & 1];
    }
    
    vector<int> pre_cntB(N+1, 0);
    for (int i = 0; i < N; ++i) {
        pre_cntB[i+1] = pre_cntB[i] + (str[i] == 'B');
    }
    
    for (int i = 0; i < R; ++i) {
        if (X[i] == 2) {
            if (pre_cntB[B[i]+1] - pre_cntB[A[i]] == B[i] - A[i] + 1 or
                pre_cntB[B[i]+1] - pre_cntB[A[i]] == 0) {
                return 0;
            }
        }
    }
    
    return craft(str), 1;
}

Compilation message

gift.cpp: In function 'int construct(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
gift.cpp:43:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |     for (int i = 0; i < identical.size(); ++i) {
      |                     ~~^~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 5 ms 944 KB Output is correct
5 Correct 276 ms 35560 KB Output is correct
6 Correct 276 ms 35548 KB Output is correct
7 Correct 270 ms 31064 KB Output is correct
8 Correct 267 ms 31092 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 4 ms 844 KB Output is correct
4 Correct 195 ms 28232 KB Output is correct
5 Correct 197 ms 28228 KB Output is correct
6 Correct 187 ms 28328 KB Output is correct
7 Correct 183 ms 28312 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 280 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 272 KB Output is correct
8 Correct 1 ms 292 KB Output is correct
9 Correct 1 ms 300 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 2 ms 292 KB Output is correct
10 Correct 2 ms 332 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 5 ms 944 KB Output is correct
5 Correct 276 ms 35560 KB Output is correct
6 Correct 276 ms 35548 KB Output is correct
7 Correct 270 ms 31064 KB Output is correct
8 Correct 267 ms 31092 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 4 ms 844 KB Output is correct
12 Correct 195 ms 28232 KB Output is correct
13 Correct 197 ms 28228 KB Output is correct
14 Correct 187 ms 28328 KB Output is correct
15 Correct 183 ms 28312 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 280 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 272 KB Output is correct
23 Correct 1 ms 292 KB Output is correct
24 Correct 1 ms 300 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 304 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 2 ms 332 KB Output is correct
32 Correct 1 ms 308 KB Output is correct
33 Correct 2 ms 292 KB Output is correct
34 Correct 2 ms 332 KB Output is correct
35 Correct 76 ms 10348 KB Output is correct
36 Correct 73 ms 10432 KB Output is correct
37 Correct 49 ms 11160 KB Output is correct
38 Correct 248 ms 32780 KB Output is correct
39 Correct 240 ms 32160 KB Output is correct
40 Correct 258 ms 32160 KB Output is correct
41 Correct 249 ms 32228 KB Output is correct
42 Correct 238 ms 32800 KB Output is correct