oj.uz

Submission #473434

# Submission time Handle Problem Language Result Execution time Memory
473434 2021-09-15T13:58:09 Z Blobo2_Blobo2 Paths (BOI18_paths) C++14
100 / 100
 525 ms 100496 KB 
/*
Editor: Abdelrahman Hossam
Nickname: Blobo2_Blobo2
IOI next year isA :)
*/
/*#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx2,tune=native")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-funroll-all-loops,-fpeel-loops,-funswitch-loops")*/

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define all(v)  v.begin(),v.end()
#define gen(arr,n,nxt)  generate(arr,arr+n,nxt)
#define Blobo2_el_7akim_elly_3ayz_yro7_IOI_w_3ayz_yakol_jilaty ios_base::sync_with_stdio(false);cin.tie(0);
#define EPS 0.00000001

const int mo=1e9+7,INF=1e18;
int nxt(){int x;cin>>x;return x;}
int color[300001],n,m,k;
vector<int>adj[300001];
int vis[300001][32];
int dfs(int u, int c){
    int &ret = vis[u][c];
    if(ret!=-1)return ret;
    int cnt = __builtin_popcountll(c) != 1;
    for(auto v:adj[u]){
        if(!(c&color[v]))
            cnt += dfs(v,c+color[v]);
    }
    return ret=cnt;
}
signed main(){
    Blobo2_el_7akim_elly_3ayz_yro7_IOI_w_3ayz_yakol_jilaty
    //freopen("in.txt","r",stdin);
    n=nxt(),m=nxt(),k=nxt();
    memset(vis,-1,sizeof vis);
    for(int i=0;i<n;i++){
        int x = nxt();
        if(x == 3)x=4;
        else if(x == 4)x=8;
        else if(x == 5)x=16;
        color[i] = x;
    }
    for(int i=0;i<m;i++){
        int x= nxt()-1,y=nxt()-1;
        adj[x].push_back(y);
        adj[y].push_back(x);
    }
    int cnt=0;
    for(int i=0;i<n;i++){
        int ans = dfs(i,color[i]);
        cnt+=ans;
    }
    cout<<cnt;
    return 0;
}

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 82372 KB Output is correct
2 Correct 36 ms 82468 KB Output is correct
3 Correct 37 ms 82384 KB Output is correct
4 Correct 36 ms 82492 KB Output is correct
5 Correct 36 ms 82428 KB Output is correct
6 Correct 35 ms 82440 KB Output is correct
7 Correct 36 ms 82460 KB Output is correct
8 Correct 36 ms 82416 KB Output is correct
9 Correct 35 ms 82424 KB Output is correct
10 Correct 36 ms 82372 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 89788 KB Output is correct
2 Correct 108 ms 89644 KB Output is correct
3 Correct 398 ms 95276 KB Output is correct
4 Correct 169 ms 90860 KB Output is correct
5 Correct 140 ms 90792 KB Output is correct
6 Correct 291 ms 92884 KB Output is correct
7 Correct 452 ms 99788 KB Output is correct
8 Correct 374 ms 100340 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 82372 KB Output is correct
2 Correct 36 ms 82468 KB Output is correct
3 Correct 37 ms 82384 KB Output is correct
4 Correct 36 ms 82492 KB Output is correct
5 Correct 36 ms 82428 KB Output is correct
6 Correct 35 ms 82440 KB Output is correct
7 Correct 36 ms 82460 KB Output is correct
8 Correct 36 ms 82416 KB Output is correct
9 Correct 35 ms 82424 KB Output is correct
10 Correct 36 ms 82372 KB Output is correct
11 Correct 135 ms 89788 KB Output is correct
12 Correct 108 ms 89644 KB Output is correct
13 Correct 398 ms 95276 KB Output is correct
14 Correct 169 ms 90860 KB Output is correct
15 Correct 140 ms 90792 KB Output is correct
16 Correct 291 ms 92884 KB Output is correct
17 Correct 452 ms 99788 KB Output is correct
18 Correct 374 ms 100340 KB Output is correct
19 Correct 150 ms 92696 KB Output is correct
20 Correct 106 ms 91820 KB Output is correct
21 Correct 393 ms 99804 KB Output is correct
22 Correct 172 ms 94196 KB Output is correct
23 Correct 153 ms 94224 KB Output is correct
24 Correct 296 ms 96948 KB Output is correct
25 Correct 395 ms 99780 KB Output is correct
26 Correct 371 ms 100496 KB Output is correct
27 Correct 132 ms 91816 KB Output is correct
28 Correct 153 ms 93892 KB Output is correct
29 Correct 485 ms 99780 KB Output is correct
30 Correct 349 ms 96312 KB Output is correct
31 Correct 460 ms 96452 KB Output is correct
32 Correct 525 ms 99864 KB Output is correct
33 Correct 38 ms 82388 KB Output is correct
34 Correct 37 ms 82484 KB Output is correct
35 Correct 37 ms 82368 KB Output is correct
36 Correct 38 ms 82372 KB Output is correct
37 Correct 37 ms 82496 KB Output is correct
38 Correct 37 ms 82500 KB Output is correct
39 Correct 37 ms 82508 KB Output is correct
40 Correct 38 ms 82512 KB Output is correct
41 Correct 37 ms 82496 KB Output is correct
42 Correct 37 ms 82372 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 82372 KB Output is correct
2 Correct 75 ms 84644 KB Output is correct
3 Correct 60 ms 85332 KB Output is correct
4 Correct 138 ms 88136 KB Output is correct
5 Correct 102 ms 88500 KB Output is correct
6 Correct 159 ms 88084 KB Output is correct
7 Correct 63 ms 85316 KB Output is correct
8 Correct 139 ms 88132 KB Output is correct
9 Correct 103 ms 88528 KB Output is correct
10 Correct 131 ms 88648 KB Output is correct
11 Correct 132 ms 86588 KB Output is correct
12 Correct 114 ms 87440 KB Output is correct
13 Correct 127 ms 86936 KB Output is correct
14 Correct 172 ms 88132 KB Output is correct
15 Correct 146 ms 88120 KB Output is correct
16 Correct 38 ms 82452 KB Output is correct
17 Correct 36 ms 82500 KB Output is correct
18 Correct 38 ms 82428 KB Output is correct
19 Correct 37 ms 82468 KB Output is correct
20 Correct 38 ms 82372 KB Output is correct
21 Correct 38 ms 82468 KB Output is correct
22 Correct 36 ms 82504 KB Output is correct
23 Correct 37 ms 82424 KB Output is correct
24 Correct 40 ms 82412 KB Output is correct
25 Correct 38 ms 82372 KB Output is correct