Submission #465657

#	Time	Username	Problem	Language	Result	Execution time	Memory
465657		AmirElarbi	Handcrafted Gift (IOI20_gift)	C++14	0 / 100	1571 ms	2097156 KiB

gift

#include <bits/stdc++.h>
#include "gift.h"
#define vi vector<int>
#define ve vector
#define ll long long
#define vf vector<float>
#define vll vector<pair<ll,ll>>
#define ii pair<int,int>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define fi first
#define se second
#define INF 1e10
#define unsigned u
#define eps 1e-18
#define eps1 1e-25
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);
#define MAX_A 100005
#define V 450
#define re register
#define maxi(a,b) ((a) > (b) ? (a) : (b))
ll MOD = 998244353;
using namespace std;
vi p;
int findSet(int x){return (p[x] == x ? x : p[x] = findSet(x));}
bool isSameSet(int x, int y){return findSet(x) == findSet(y);}
void unionSet(int x, int y){
    int i = findSet(x), j = findSet(y);
    p[i] = j;
}
int construct(int n, int r, vector<int> a, vector<int> b, vector<int> x)
{
    p.resize(n);
    string s;
    for(int i = 0 ; i < n; i++){
        p[i] = i;
    }
    for (int i = 0; i < n; ++i)
    {
        if(x[i] == 1){
            for (int j = a[i]; j <= b[i]; ++j)
            {
                unionSet(i,j);
            }
        } 
    }
    for (int i = 0; i < n; ++i)
    {
        bool p = false;
        if(x[i] == 2){
            for (int j = a[i]; j <= b[i]; ++j)
            {
                if(!isSameSet(i,j)){
                    p = true;
                }
            }
            if(!p)
                return 0;
        } 
    }
    char p = 'R';
    s += p;
    for (int i = 1; i < n; ++i)
    {
        if(isSameSet(i,i-1)){
            s += p;
        } else {
            if(p == 'R')
                p = 'B';
            else
                p = 'R';
            s += p;
        }
    }
    craft(s);
    return 1;
}

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