oj.uz

Submission #465686

# Submission time Handle Problem Language Result Execution time Memory
465686 2021-08-16T16:27:30 Z AmirElarbi Handcrafted Gift (IOI20_gift) C++14
100 / 100
 579 ms 46192 KB 
#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(p[x]));}
bool isSameSet(int x, int y){return findSet(x) == findSet(y);}
void unionSet(int x, int y){
    if(isSameSet(x,y))
        return;
    int i = findSet(x), j = findSet(y);
    p[min(i,j)] = max(i,j);
}
int construct(int n, int r, vector<int> a, vector<int> b, vector<int> x)
{
    p.resize(n);
    set<int> st;
    string s;
    for(int i = 0 ; i < n; i++){
        p[i] = i;
        st.insert(i);
    }
    for (int i = 0; i < r; ++i)
    {
        if(x[i] == 1){
            auto lb = st.lower_bound(a[i]), ub = st.lower_bound(b[i]);
            if(*ub != b[i])
                ub--;
            for (int j = (*lb)+1; j <= *ub; ++j)
            {
                if(j != b[i])
                    st.erase(j);
                unionSet(j,j-1);
            }
        } 
    }
    for (int i = 0; i < r; ++i)
    {
        bool p = false;
        if(x[i] == 2){
            if(findSet(a[i]) >= b[i])
                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;
}

Compilation message

gift.cpp: In function 'int construct(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
gift.cpp:60:14: warning: unused variable 'p' [-Wunused-variable]
   60 |         bool p = false;
      |              ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 7 ms 972 KB Output is correct
5 Correct 359 ms 38424 KB Output is correct
6 Correct 362 ms 38432 KB Output is correct
7 Correct 435 ms 38800 KB Output is correct
8 Correct 447 ms 38716 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 5 ms 972 KB Output is correct
4 Correct 299 ms 38488 KB Output is correct
5 Correct 306 ms 38556 KB Output is correct
6 Correct 295 ms 37572 KB Output is correct
7 Correct 294 ms 37404 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 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 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 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 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 7 ms 972 KB Output is correct
5 Correct 359 ms 38424 KB Output is correct
6 Correct 362 ms 38432 KB Output is correct
7 Correct 435 ms 38800 KB Output is correct
8 Correct 447 ms 38716 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 5 ms 972 KB Output is correct
12 Correct 299 ms 38488 KB Output is correct
13 Correct 306 ms 38556 KB Output is correct
14 Correct 295 ms 37572 KB Output is correct
15 Correct 294 ms 37404 KB Output is correct
16 Correct 0 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 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 2 ms 332 KB Output is correct
32 Correct 2 ms 332 KB Output is correct
33 Correct 2 ms 332 KB Output is correct
34 Correct 2 ms 332 KB Output is correct
35 Correct 155 ms 26456 KB Output is correct
36 Correct 149 ms 26744 KB Output is correct
37 Correct 167 ms 27664 KB Output is correct
38 Correct 381 ms 45500 KB Output is correct
39 Correct 403 ms 45200 KB Output is correct
40 Correct 478 ms 46136 KB Output is correct
41 Correct 579 ms 46192 KB Output is correct
42 Correct 387 ms 45504 KB Output is correct