oj.uz

Submission #498208

# Submission time Handle Problem Language Result Execution time Memory
498208 2021-12-24T15:33:42 Z Kipras Monthly railway pass (LMIO18_menesinis_bilietas) C++14
65 / 100
 3000 ms 52056 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;

    set<int> all;
    for(int i = 1; i <= n; i++){
        all.insert(find(i));
    }
    int intToInd[maxN];
    int cur=0;
    for(auto i : all){
        intToInd[i]=cur;
        cur++;
    }

    for(int i = 1; i <= n; i++){
        if(checkedContainer[find(i)])continue;
        int ss=s[find(i)];
        bool checked[all.size()+1]={0};
        for(auto x : routes[find(i)]){
            if(!same(i, x)&&!checked[intToInd[find(x)]]){
                ss+=s[find(x)];
            }
            checked[intToInd[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 387 ms 44648 KB Output is correct
2 Correct 21 ms 29660 KB Output is correct
3 Correct 16 ms 29620 KB Output is correct
4 Execution timed out 3058 ms 52056 KB Time limit exceeded

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3058 ms 52056 KB Time limit exceeded

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 29660 KB Output is correct
2 Correct 16 ms 29620 KB Output is correct
3 Correct 20 ms 29644 KB Output is correct
4 Correct 21 ms 29612 KB Output is correct
5 Correct 19 ms 29848 KB Output is correct
6 Correct 18 ms 29852 KB Output is correct
7 Correct 19 ms 30176 KB Output is correct
8 Correct 19 ms 29892 KB Output is correct
9 Correct 16 ms 29644 KB Output is correct
10 Correct 19 ms 29644 KB Output is correct
11 Correct 25 ms 30276 KB Output is correct
12 Correct 20 ms 29652 KB Output is correct
13 Correct 16 ms 29772 KB Output is correct
14 Correct 16 ms 29664 KB Output is correct
15 Correct 20 ms 29684 KB Output is correct
16 Correct 17 ms 29772 KB Output is correct
17 Correct 22 ms 29720 KB Output is correct
18 Correct 21 ms 29672 KB Output is correct
19 Correct 19 ms 29644 KB Output is correct
20 Correct 21 ms 30028 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 29644 KB Output is correct
2 Correct 21 ms 29612 KB Output is correct
3 Correct 19 ms 29848 KB Output is correct
4 Correct 18 ms 29852 KB Output is correct
5 Correct 19 ms 30176 KB Output is correct
6 Correct 19 ms 29892 KB Output is correct
7 Correct 16 ms 29644 KB Output is correct
8 Correct 19 ms 29644 KB Output is correct
9 Correct 25 ms 30276 KB Output is correct
10 Correct 20 ms 29652 KB Output is correct
11 Correct 16 ms 29772 KB Output is correct
12 Correct 16 ms 29664 KB Output is correct
13 Correct 20 ms 29684 KB Output is correct
14 Correct 17 ms 29772 KB Output is correct
15 Correct 22 ms 29720 KB Output is correct
16 Correct 21 ms 29660 KB Output is correct
17 Correct 16 ms 29620 KB Output is correct
18 Correct 21 ms 29672 KB Output is correct
19 Correct 19 ms 29644 KB Output is correct
20 Correct 21 ms 30028 KB Output is correct
21 Correct 27 ms 31340 KB Output is correct
22 Correct 396 ms 47012 KB Output is correct
23 Correct 93 ms 36860 KB Output is correct
24 Correct 74 ms 39392 KB Output is correct
25 Correct 45 ms 35268 KB Output is correct
26 Correct 194 ms 37912 KB Output is correct
27 Correct 28 ms 30156 KB Output is correct
28 Correct 30 ms 31564 KB Output is correct
29 Correct 37 ms 31964 KB Output is correct
30 Correct 68 ms 34352 KB Output is correct

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 29644 KB Output is correct
2 Correct 21 ms 29612 KB Output is correct
3 Correct 19 ms 29848 KB Output is correct
4 Correct 18 ms 29852 KB Output is correct
5 Correct 19 ms 30176 KB Output is correct
6 Correct 19 ms 29892 KB Output is correct
7 Correct 16 ms 29644 KB Output is correct
8 Correct 19 ms 29644 KB Output is correct
9 Correct 25 ms 30276 KB Output is correct
10 Correct 20 ms 29652 KB Output is correct
11 Correct 16 ms 29772 KB Output is correct
12 Correct 16 ms 29664 KB Output is correct
13 Correct 20 ms 29684 KB Output is correct
14 Correct 17 ms 29772 KB Output is correct
15 Correct 22 ms 29720 KB Output is correct
16 Correct 27 ms 31340 KB Output is correct
17 Correct 396 ms 47012 KB Output is correct
18 Correct 93 ms 36860 KB Output is correct
19 Correct 74 ms 39392 KB Output is correct
20 Correct 45 ms 35268 KB Output is correct
21 Correct 194 ms 37912 KB Output is correct
22 Correct 387 ms 44648 KB Output is correct
23 Correct 21 ms 29660 KB Output is correct
24 Correct 16 ms 29620 KB Output is correct
25 Execution timed out 3058 ms 52056 KB Time limit exceeded