oj.uz

Submission #498191

# Submission time Handle Problem Language Result Execution time Memory
498191 2021-12-24T14:52:31 Z Kipras Monthly railway pass (LMIO18_menesinis_bilietas) C++14
65 / 100
 3000 ms 45620 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxN = 1e5*5+1;

int n, m;
vector<pair<bool, int>> adj[maxN];
int par[maxN];
int s[maxN];
vector<int> routes[maxN];
bool checkedContainer[maxN];

int find(int a){
    if(par[a]==a)return a;
    return par[a]=find(par[a]);
}

void unite(int a, int b){
    a = find(a), b = find(b);
    if(a==b)return;
    par[b]=a;
    s[a]+=s[b];
}

bool same(int a, int b){
    return find(a)==find(b);
}

int main()
{

    ios_base::sync_with_stdio(0);cin.tie(nullptr);

    cin>>n>>m;

    for(int i = 0; i < m; i++){
        int a, b;
        char t;
        bool type;
        cin>>a>>b>>t;
        if(t=='A')type=0;
        else type=1;
        adj[a].push_back({type, b});
        adj[b].push_back({type, a});
    }

    for(int i = 0; i < maxN; i++)par[i]=i;
    for(int i = 0; i < maxN; i++)s[i]=1;

    for(int i = 1; i <= n; i++){
        for(auto x : adj[i]){
            if(x.first==0){

            }else{
                unite(x.second, i);
            }
        }
    }



    for(int i = 1; i <= n; i++){
        for(auto x : adj[i]){
            if(x.first==0){
                routes[find(i)].push_back(find(x.second));
                routes[find(x.second)].push_back(find(i));
            }else{

            }
        }
    }

    int ans=0;



    for(int i = 1; i <= n; i++){
        if(checkedContainer[find(i)])continue;
        int ss=s[find(i)];
        bool checked[maxN]={0};
        for(auto x : routes[find(i)]){
            if(!same(i, x)&&!checked[find(x)]){
                ss+=s[find(x)];
                checked[find(x)]=1;
            }
        }
        if(ss==n){
            ans+=s[find(i)];
            checkedContainer[find(i)]=true;
        }
    }

    cout<<ans;


    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 375 ms 43236 KB Output is correct
2 Correct 16 ms 28168 KB Output is correct
3 Correct 17 ms 28132 KB Output is correct
4 Execution timed out 3057 ms 28108 KB Time limit exceeded

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3057 ms 28108 KB Time limit exceeded

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 28168 KB Output is correct
2 Correct 17 ms 28132 KB Output is correct
3 Correct 15 ms 28108 KB Output is correct
4 Correct 16 ms 28108 KB Output is correct
5 Correct 18 ms 28364 KB Output is correct
6 Correct 21 ms 28364 KB Output is correct
7 Correct 19 ms 28612 KB Output is correct
8 Correct 19 ms 28408 KB Output is correct
9 Correct 17 ms 28108 KB Output is correct
10 Correct 16 ms 28108 KB Output is correct
11 Correct 29 ms 28688 KB Output is correct
12 Correct 15 ms 28148 KB Output is correct
13 Correct 25 ms 28304 KB Output is correct
14 Correct 20 ms 28192 KB Output is correct
15 Correct 20 ms 28228 KB Output is correct
16 Correct 15 ms 28312 KB Output is correct
17 Correct 26 ms 28220 KB Output is correct
18 Correct 15 ms 28132 KB Output is correct
19 Correct 16 ms 28236 KB Output is correct
20 Correct 27 ms 28492 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28108 KB Output is correct
2 Correct 16 ms 28108 KB Output is correct
3 Correct 18 ms 28364 KB Output is correct
4 Correct 21 ms 28364 KB Output is correct
5 Correct 19 ms 28612 KB Output is correct
6 Correct 19 ms 28408 KB Output is correct
7 Correct 17 ms 28108 KB Output is correct
8 Correct 16 ms 28108 KB Output is correct
9 Correct 29 ms 28688 KB Output is correct
10 Correct 15 ms 28148 KB Output is correct
11 Correct 25 ms 28304 KB Output is correct
12 Correct 20 ms 28192 KB Output is correct
13 Correct 20 ms 28228 KB Output is correct
14 Correct 15 ms 28312 KB Output is correct
15 Correct 26 ms 28220 KB Output is correct
16 Correct 16 ms 28168 KB Output is correct
17 Correct 17 ms 28132 KB Output is correct
18 Correct 15 ms 28132 KB Output is correct
19 Correct 16 ms 28236 KB Output is correct
20 Correct 27 ms 28492 KB Output is correct
21 Correct 26 ms 29852 KB Output is correct
22 Correct 421 ms 45620 KB Output is correct
23 Correct 58 ms 35372 KB Output is correct
24 Correct 73 ms 37936 KB Output is correct
25 Correct 46 ms 33848 KB Output is correct
26 Correct 291 ms 36444 KB Output is correct
27 Correct 155 ms 28180 KB Output is correct
28 Correct 208 ms 29352 KB Output is correct
29 Correct 194 ms 29856 KB Output is correct
30 Correct 59 ms 32968 KB Output is correct

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 28108 KB Output is correct
2 Correct 16 ms 28108 KB Output is correct
3 Correct 18 ms 28364 KB Output is correct
4 Correct 21 ms 28364 KB Output is correct
5 Correct 19 ms 28612 KB Output is correct
6 Correct 19 ms 28408 KB Output is correct
7 Correct 17 ms 28108 KB Output is correct
8 Correct 16 ms 28108 KB Output is correct
9 Correct 29 ms 28688 KB Output is correct
10 Correct 15 ms 28148 KB Output is correct
11 Correct 25 ms 28304 KB Output is correct
12 Correct 20 ms 28192 KB Output is correct
13 Correct 20 ms 28228 KB Output is correct
14 Correct 15 ms 28312 KB Output is correct
15 Correct 26 ms 28220 KB Output is correct
16 Correct 26 ms 29852 KB Output is correct
17 Correct 421 ms 45620 KB Output is correct
18 Correct 58 ms 35372 KB Output is correct
19 Correct 73 ms 37936 KB Output is correct
20 Correct 46 ms 33848 KB Output is correct
21 Correct 291 ms 36444 KB Output is correct
22 Correct 375 ms 43236 KB Output is correct
23 Correct 16 ms 28168 KB Output is correct
24 Correct 17 ms 28132 KB Output is correct
25 Execution timed out 3057 ms 28108 KB Time limit exceeded