oj.uz

Submission #336137

# Submission time Handle Problem Language Result Execution time Memory
336137 2020-12-14T20:41:58 Z bigDuck Game (IOI14_game) C++14
42 / 100
 1000 ms 13676 KB 
#include<bits/stdc++.h>
using namespace std;
#define INIT  ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount
#include "game.h"


multiset<int> g[1510];
int N;


void initialize(int n) {
N=n;
for(int i=0; i<n; i++){
    for(int j=i+1; j<n; j++){
        g[i].insert(j); g[j].insert(i);
    }
}



}


int v[1510];

int is_bridge(int x, int y, int ac){
int n=N;
queue<int> q1, q2;
v[x]=ac; v[y]=ac+1;
q1.push(x); q2.push(y);

while((!q1.empty()) && (!q2.empty()) ){
    int f1=q1.front(); q1.pop();
    //cout<<"f1: "<<f1<<" ";
    if( (v[f1]==(ac+1) )  ){
        g[x].erase(g[x].find(y)); g[y].erase(g[y].find(x) );
        //cout<<"\n"<<flush;
        return 0;
    }
    v[f1]=ac;
    for(auto it=g[f1].begin(); it!=g[f1].end(); it++){
        //cout<<*it<<" ";
        if( (v[*it]!=ac) && ( (*it)!=y) ){
            //cout<<*it<<"g1 ";
            if( v[*it]==(ac+1) ){
                g[x].erase(g[x].find(y)); g[y].erase(g[y].find(x) );
        //cout<<"\n"<<flush;
        return 0;
            }
            v[*it]=ac;
            q1.push(*it);
        }
    }
    //cout<<"2x\n";
    int f2=q2.front(); q2.pop();
    //cout<<"f2: "<<f2<<" ";
    if( (v[f2]==(ac) ) ){
        g[x].erase(g[x].find(y)); g[y].erase(g[y].find(x) );
       // cout<<"\n"<<flush;
        return 0;
    }
    v[f2]=ac+1;
    for(auto it=g[f2].begin(); it!=g[f2].end(); it++){
        //cout<<*it<<" ";
        if( (v[*it]!=(ac+1)) && ( (*it)!=x ) ){
                        if( v[*it]==(ac) ){
                g[x].erase(g[x].find(y)); g[y].erase(g[y].find(x) );
        //cout<<"\n"<<flush;
        return 0;
            }
            v[*it]=ac+1;
            q2.push(*it);
        }
    }

}
//cout<<"\n"<<flush;


return 1;
}




int ac=1;
int hasEdge(int u, int v) {
    ac+=3;
    return is_bridge(u, v, ac);
}

Compilation message

game.cpp: In function 'int is_bridge(int, int, int)':
game.cpp:34:5: warning: unused variable 'n' [-Wunused-variable]
   34 | int n=N;
      |     ^

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 2 ms 492 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 1 ms 492 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 492 KB Output is correct
31 Correct 1 ms 492 KB Output is correct
32 Correct 1 ms 492 KB Output is correct
33 Correct 1 ms 492 KB Output is correct
34 Correct 6 ms 748 KB Output is correct
35 Correct 6 ms 748 KB Output is correct
36 Correct 6 ms 748 KB Output is correct
37 Correct 6 ms 748 KB Output is correct
38 Correct 6 ms 748 KB Output is correct
39 Correct 6 ms 876 KB Output is correct
40 Correct 8 ms 748 KB Output is correct
41 Correct 6 ms 748 KB Output is correct
42 Correct 5 ms 748 KB Output is correct
43 Correct 5 ms 748 KB Output is correct
44 Correct 4 ms 748 KB Output is correct
45 Correct 6 ms 748 KB Output is correct
46 Correct 6 ms 748 KB Output is correct
47 Correct 6 ms 748 KB Output is correct
48 Correct 5 ms 748 KB Output is correct
49 Correct 6 ms 876 KB Output is correct
50 Correct 6 ms 748 KB Output is correct
51 Correct 6 ms 748 KB Output is correct
52 Correct 6 ms 748 KB Output is correct
53 Correct 8 ms 748 KB Output is correct
54 Correct 6 ms 748 KB Output is correct

Subtask #3
0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 1 ms 492 KB Output is correct
27 Correct 1 ms 500 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 492 KB Output is correct
31 Correct 1 ms 492 KB Output is correct
32 Correct 1 ms 492 KB Output is correct
33 Correct 1 ms 620 KB Output is correct
34 Correct 5 ms 748 KB Output is correct
35 Correct 5 ms 748 KB Output is correct
36 Correct 5 ms 748 KB Output is correct
37 Correct 7 ms 748 KB Output is correct
38 Correct 6 ms 748 KB Output is correct
39 Correct 5 ms 748 KB Output is correct
40 Correct 5 ms 748 KB Output is correct
41 Correct 6 ms 748 KB Output is correct
42 Correct 6 ms 748 KB Output is correct
43 Correct 5 ms 748 KB Output is correct
44 Correct 5 ms 748 KB Output is correct
45 Correct 7 ms 748 KB Output is correct
46 Correct 5 ms 748 KB Output is correct
47 Correct 5 ms 748 KB Output is correct
48 Correct 6 ms 748 KB Output is correct
49 Correct 6 ms 748 KB Output is correct
50 Correct 6 ms 748 KB Output is correct
51 Correct 6 ms 748 KB Output is correct
52 Correct 6 ms 892 KB Output is correct
53 Correct 6 ms 748 KB Output is correct
54 Correct 6 ms 748 KB Output is correct
55 Execution timed out 1095 ms 13676 KB Time limit exceeded
56 Halted 0 ms 0 KB -