oj.uz

Submission #149411

# Submission time Handle Problem Language Result Execution time Memory
149411 2019-09-01T06:25:54 Z Cafe Maru(#3599, bryan, pps789, kazel) Bulb Game (FXCUP4_bulb) C++17
100 / 100
 144 ms 24540 KB 
#include "bulb.h"

const int RED = -1;
const int BLUE = -2;

using vi = std::vector<int>;

const int NMAX = 300000;

bool c[NMAX*4+3];
void SetTrue(int nl,int nr,int l,int r,int node){
    if(l<=nl&&nr<=r){
        c[node]=true; return;
    }
    else if(nr<l||r<nl) return;
    int mid = (nl+nr)/2;
    SetTrue(nl,mid,l,r,node*2+1);
    SetTrue(mid+1,nr,l,r,node*2+2);
}
int N;
void SetTrue(int l,int r){if(l<=r) SetTrue(0,N-1,l,r,0);}
bool ReadBool(int nl,int nr,int x,int node){
    if(c[node]) return true;
    if(nl==nr) return c[node];
    int mid = (nl+nr)/2;
    if(x<=mid) return ReadBool(nl,mid,x,node*2+1);
    else return ReadBool(mid+1,nr,x,node*2+2);
}
bool ReadBool(int x){return ReadBool(0,N-1,x,0);}

bool hasTwo[NMAX];
int L[NMAX], R[NMAX];
int reorder[NMAX];

int tc;
void ReorderDfs(const vi& _L, const vi& _R, int root=0){
    int reroot = reorder[root];
    if(_L[root] >= 0){
        reorder[_L[root]] = ++tc;
        L[reroot] = tc;
        ReorderDfs(_L, _R, _L[root]);
    }
    else{
        L[reroot] = _L[root];
    }
    if(_R[root] >= 0){
        reorder[_R[root]] = ++tc;
        R[reroot] = tc;
        ReorderDfs(_L, _R, _R[root]);
    }
    else{
        R[reroot] = _R[root];
    }
}

void FindTwo(int root, vi& rv){
    if(L[root]>=0) FindTwo(L[root], rv);
    else if(rv.size()==2 && L[root]==BLUE){
        hasTwo[rv[0]] = hasTwo[rv[1]] = true;
    }

    if(rv.size() < 2){
        rv.push_back(root);
        if(R[root]>=0) FindTwo(R[root], rv);
        else if(rv.size()==2 && R[root] == BLUE){
            hasTwo[rv[0]] = hasTwo[rv[1]] = true;
        }
        rv.pop_back();
    }
}

void FindOne(){
    int st = 0;
    int it = 0;
    while(1){
        if(R[it]==BLUE){
            SetTrue(it+1,N-1);
        }
        else if(R[it]>=0){
            int st2 = R[it];
            int it2 = st2;
            while(L[it2]>=0) it2 = L[it2];
            if(L[it2]==BLUE){
                SetTrue(it+1, st2-1);
                SetTrue(it2+1, N-1);
            }
        }
        if(L[it]>=0) it = L[it];
        else return;
    }
}

int FindWinner(int T, std::vector<int> _L, std::vector<int> _R){
    N = _L.size();

    int it=0;
    while(_L[it]>=0) it = _L[it];
    if(_L[it]==BLUE) return 0;

    ReorderDfs(_L, _R);
    FindOne();
    vi rv;
    FindTwo(0, rv);

    for(int i=0;i<N;i++){
        if(hasTwo[i]) continue;
        if(ReadBool(i)) continue;

        return 1;
    }
    return 0;
}

Compilation message

bulb.cpp: In function 'void FindOne()':
bulb.cpp:73:9: warning: unused variable 'st' [-Wunused-variable]
     int st = 0;
         ^~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 352 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 348 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 352 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct

Subtask #3
64.0 / 64.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 352 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 72 ms 6408 KB Output is correct
28 Correct 88 ms 9996 KB Output is correct
29 Correct 86 ms 9976 KB Output is correct
30 Correct 141 ms 24540 KB Output is correct
31 Correct 144 ms 24444 KB Output is correct
32 Correct 88 ms 9340 KB Output is correct
33 Correct 86 ms 9976 KB Output is correct
34 Correct 89 ms 9976 KB Output is correct
35 Correct 88 ms 9232 KB Output is correct
36 Correct 90 ms 9616 KB Output is correct
37 Correct 88 ms 9328 KB Output is correct
38 Correct 87 ms 9436 KB Output is correct
39 Correct 86 ms 9564 KB Output is correct
40 Correct 86 ms 8988 KB Output is correct
41 Correct 86 ms 9072 KB Output is correct
42 Correct 88 ms 9572 KB Output is correct
43 Correct 87 ms 10900 KB Output is correct
44 Correct 88 ms 11064 KB Output is correct
45 Correct 88 ms 9500 KB Output is correct
46 Correct 87 ms 10480 KB Output is correct
47 Correct 115 ms 13212 KB Output is correct
48 Correct 96 ms 13368 KB Output is correct
49 Correct 112 ms 15172 KB Output is correct
50 Correct 96 ms 11924 KB Output is correct