oj.uz

Submission #904877

# Submission time Handle Problem Language Result Execution time Memory
904877 2024-01-12T10:41:58 Z KK_1729 Handcrafted Gift (IOI20_gift) C++17
100 / 100
 212 ms 40960 KB 
#include <bits/stdc++.h>
using namespace std;
#include "gift.h"


// #define int long long 
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define pb push_back
#define all(a) a.begin(), a.end()
#define endl "\n"

void printVector(vector<int> a){
    for (auto x: a) cout << x << " ";
    cout << endl;
}
bool compare(pair<int, int> x, pair<int, int> y){
    if (x.first < y.first) return true;
    if (x.first == y.first){
        if (x.second < y.second) return true;
    }
    return false;
}

bool intersect(pair<int, int> x, pair<int, int> y){
    if (y.first < x.first) swap(x, y);
    if (x.second >= y.first) return true;
    return false;
}
int construct(int n, int r, vector<int> a, vector<int> b, vector<int> x) {
    vector<int> ans(n);
    vector<int> component(n);
    
    vector<pair<int, int>> first;
    vector<pair<int, int>> second;
    FOR(i,0,r){
        int l = a[i]; int r = b[i]; int t = x[i];
        if (t == 1){
            first.pb({l, r});
        }else{
            second.pb({l, r});
        }

    }
    FOR(i,0,n) first.pb({i, i});
    sort(all(first));

    vector<pair<int, int>> ranges;
    pair<int, int> current = {0, 0};

    FOR(i,0,first.size()){
        if (i == 0){
            current = first[i];
            continue;
        }
        if (intersect(first[i], current)){
            current.second = max(current.second, first[i].second);
        }else{
            ranges.pb(current);
            current = first[i];
        }
    }
    ranges.pb(current);

    int comp = 0;
    // cout << endl;
    for (auto x: ranges){
        
        FOR(i,x.first,x.second+1){
            component[i] = comp;
            if (comp%2){
                ans[i] = 0;
            }else{
                ans[i] = 1;
            }
        }
        comp++;
    }


    for (auto x: second){
        if (component[x.first] == component[x.second]){
            return 0;
        }
    }

	string answer = "";
    for (auto x: ans){
        if (x) answer+='R';
        else answer+='B';
    }
	// cout << answer << endl;
    craft(answer);
	return 1;
}

Compilation message

gift.cpp: In function 'int construct(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
gift.cpp:7:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define FOR(i,a,b) for (int i = (a); i < (b); ++i)
      |                                        ^
gift.cpp:50:5: note: in expansion of macro 'FOR'
   50 |     FOR(i,0,first.size()){
      |     ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 4 ms 1108 KB Output is correct
5 Correct 189 ms 39604 KB Output is correct
6 Correct 197 ms 39540 KB Output is correct
7 Correct 201 ms 34936 KB Output is correct
8 Correct 212 ms 35004 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 3 ms 1116 KB Output is correct
4 Correct 139 ms 38792 KB Output is correct
5 Correct 156 ms 37952 KB Output is correct
6 Correct 133 ms 37512 KB Output is correct
7 Correct 138 ms 38464 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 500 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 348 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 4 ms 1108 KB Output is correct
5 Correct 189 ms 39604 KB Output is correct
6 Correct 197 ms 39540 KB Output is correct
7 Correct 201 ms 34936 KB Output is correct
8 Correct 212 ms 35004 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 3 ms 1116 KB Output is correct
12 Correct 139 ms 38792 KB Output is correct
13 Correct 156 ms 37952 KB Output is correct
14 Correct 133 ms 37512 KB Output is correct
15 Correct 138 ms 38464 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 1 ms 500 KB Output is correct
31 Correct 2 ms 348 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 2 ms 348 KB Output is correct
35 Correct 27 ms 14792 KB Output is correct
36 Correct 26 ms 14956 KB Output is correct
37 Correct 38 ms 17028 KB Output is correct
38 Correct 182 ms 39408 KB Output is correct
39 Correct 182 ms 39172 KB Output is correct
40 Correct 178 ms 40176 KB Output is correct
41 Correct 176 ms 40960 KB Output is correct
42 Correct 163 ms 39040 KB Output is correct