oj.uz

Submission #498188

# Submission time Handle Problem Language Result Execution time Memory
498188 2021-12-24T14:41:29 Z Kipras Monthly railway pass (LMIO18_menesinis_bilietas) C++14
81 / 100
 3000 ms 84752 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];

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;

    bool checkedContainer[maxN];

    for(int i = 1; i <= n; i++){
        //if(checkedContainer[find(i)])continue;
        int ss=s[find(i)];
        set<int> checked;
        for(auto x : routes[find(i)]){
            if(!same(i, x)&&checked.find(find(x))==checked.end()){
                ss+=s[find(x)];
            }
            checked.insert(find(x));
        }
        if(ss==n){
            ans++;
            //checkedContainer[find(i)]=true;
        }
    }

    cout<<ans;


    return 0;
}

Compilation message

menesinis_bilietas.cpp: In function 'int main()':
menesinis_bilietas.cpp:75:10: warning: unused variable 'checkedContainer' [-Wunused-variable]
   75 |     bool checkedContainer[maxN];
      |          ^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 400 ms 43264 KB Output is correct
2 Correct 16 ms 27644 KB Output is correct
3 Correct 15 ms 27724 KB Output is correct
4 Correct 22 ms 27644 KB Output is correct
5 Correct 16 ms 27572 KB Output is correct
6 Correct 67 ms 32980 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 27644 KB Output is correct
2 Correct 16 ms 27572 KB Output is correct
3 Correct 18 ms 27716 KB Output is correct
4 Correct 19 ms 27740 KB Output is correct
5 Correct 23 ms 28160 KB Output is correct
6 Correct 381 ms 47316 KB Output is correct
7 Correct 1088 ms 84752 KB Output is correct
8 Correct 28 ms 29708 KB Output is correct
9 Correct 46 ms 30356 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 27644 KB Output is correct
2 Correct 15 ms 27724 KB Output is correct
3 Correct 18 ms 27716 KB Output is correct
4 Correct 19 ms 27740 KB Output is correct
5 Correct 23 ms 28160 KB Output is correct
6 Correct 16 ms 27716 KB Output is correct
7 Correct 20 ms 27728 KB Output is correct
8 Correct 23 ms 27824 KB Output is correct
9 Correct 26 ms 27984 KB Output is correct
10 Correct 40 ms 28320 KB Output is correct
11 Correct 27 ms 28044 KB Output is correct
12 Correct 17 ms 27668 KB Output is correct
13 Correct 17 ms 27684 KB Output is correct
14 Correct 34 ms 28444 KB Output is correct
15 Correct 20 ms 27808 KB Output is correct
16 Correct 21 ms 27824 KB Output is correct
17 Correct 15 ms 27600 KB Output is correct
18 Correct 16 ms 27776 KB Output is correct
19 Correct 18 ms 27728 KB Output is correct
20 Correct 23 ms 27792 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 27716 KB Output is correct
2 Correct 20 ms 27728 KB Output is correct
3 Correct 23 ms 27824 KB Output is correct
4 Correct 26 ms 27984 KB Output is correct
5 Correct 40 ms 28320 KB Output is correct
6 Correct 27 ms 28044 KB Output is correct
7 Correct 17 ms 27668 KB Output is correct
8 Correct 17 ms 27684 KB Output is correct
9 Correct 34 ms 28444 KB Output is correct
10 Correct 20 ms 27808 KB Output is correct
11 Correct 21 ms 27824 KB Output is correct
12 Correct 15 ms 27600 KB Output is correct
13 Correct 16 ms 27776 KB Output is correct
14 Correct 18 ms 27728 KB Output is correct
15 Correct 23 ms 27792 KB Output is correct
16 Correct 16 ms 27644 KB Output is correct
17 Correct 15 ms 27724 KB Output is correct
18 Correct 18 ms 27716 KB Output is correct
19 Correct 19 ms 27740 KB Output is correct
20 Correct 23 ms 28160 KB Output is correct
21 Correct 16 ms 27572 KB Output is correct
22 Correct 28 ms 29708 KB Output is correct
23 Correct 46 ms 30356 KB Output is correct
24 Correct 67 ms 32980 KB Output is correct
25 Correct 136 ms 29688 KB Output is correct
26 Correct 1830 ms 49572 KB Output is correct
27 Correct 410 ms 36404 KB Output is correct
28 Correct 190 ms 39420 KB Output is correct
29 Correct 221 ms 34480 KB Output is correct
30 Correct 1427 ms 38156 KB Output is correct

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 27716 KB Output is correct
2 Correct 20 ms 27728 KB Output is correct
3 Correct 23 ms 27824 KB Output is correct
4 Correct 26 ms 27984 KB Output is correct
5 Correct 40 ms 28320 KB Output is correct
6 Correct 27 ms 28044 KB Output is correct
7 Correct 17 ms 27668 KB Output is correct
8 Correct 17 ms 27684 KB Output is correct
9 Correct 34 ms 28444 KB Output is correct
10 Correct 20 ms 27808 KB Output is correct
11 Correct 21 ms 27824 KB Output is correct
12 Correct 15 ms 27600 KB Output is correct
13 Correct 16 ms 27776 KB Output is correct
14 Correct 18 ms 27728 KB Output is correct
15 Correct 23 ms 27792 KB Output is correct
16 Correct 136 ms 29688 KB Output is correct
17 Correct 1830 ms 49572 KB Output is correct
18 Correct 410 ms 36404 KB Output is correct
19 Correct 190 ms 39420 KB Output is correct
20 Correct 221 ms 34480 KB Output is correct
21 Correct 1427 ms 38156 KB Output is correct
22 Correct 400 ms 43264 KB Output is correct
23 Correct 16 ms 27644 KB Output is correct
24 Correct 15 ms 27724 KB Output is correct
25 Correct 22 ms 27644 KB Output is correct
26 Correct 18 ms 27716 KB Output is correct
27 Correct 19 ms 27740 KB Output is correct
28 Correct 23 ms 28160 KB Output is correct
29 Correct 16 ms 27572 KB Output is correct
30 Correct 381 ms 47316 KB Output is correct
31 Correct 1088 ms 84752 KB Output is correct
32 Correct 28 ms 29708 KB Output is correct
33 Correct 46 ms 30356 KB Output is correct
34 Correct 67 ms 32980 KB Output is correct
35 Correct 2243 ms 31468 KB Output is correct
36 Execution timed out 3028 ms 53192 KB Time limit exceeded
37 Halted 0 ms 0 KB -