제출 #1222509

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1222509		steveonalex	Handcrafted Gift (IOI20_gift)	C++20	100 / 100	379 ms	36424 KiB

gift

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(abs(a), abs(b));}
ll lcm(ll a, ll b){return abs(a) / gcd(a, b) * abs(b);}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
// mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

#include "gift.h"

int construct(int n, int r, vector<int> a, vector<int> b, vector<int> x){
    set<int> S;
    for(int i= 0; i < n-1; ++i) S.insert(i);

    for(int i = 0; i < r; ++i){
        if (x[i] == 1){
            while(true){
                auto it = S.lower_bound(a[i]);
                if (it == S.end() || (*it) >= b[i]) break;
                S.erase(it);
            }
        }
    }

    for(int i= 0; i < r; ++i){
        if (x[i] == 2){
            auto it = S.lower_bound(a[i]);
            if (it == S.end() || (*it) >= b[i]) return 0;
        }
    }

    string s(n, '0');
    for(int i: S) s[i+1] = '1';

    for(int i= 1; i < n; ++i) {
        if (s[i] == '1') s[i] = s[i-1] ^ 1;
        else s[i] = s[i-1];
    }
    for(char &c: s){
        if (c == '1') c = 'R';
        else c = 'B';
    }
    craft(s);
    return 1;
}

• Subtask 1: 10 / 10
• Subtask 2: 15 / 15
• Subtask 3: 20 / 20
• Subtask 4: 25 / 25
• Subtask 5: 30 / 30