oj.uz

Submission #961917

# Submission time Handle Problem Language Result Execution time Memory
961917 2024-04-12T18:31:47 Z Irate Monthly railway pass (LMIO18_menesinis_bilietas) C++17
16 / 100
 166 ms 34244 KB 
#include <bits/stdc++.h>
using namespace std;
const int mxN = 5e5 + 5;
struct DSU{
    vector<int>par;
    int comps;
    DSU(int n){
        par.assign(n + 1, -1);
        comps = n;
    }
    int FindRep(int u){
        if(par[u] < 0)return u;
        return par[u] = FindRep(par[u]);
    }
    void Union(int u, int v){
        u = FindRep(u);
        v = FindRep(v);
        if(u == v)return;
        if(par[u] > par[v])swap(u, v);
        par[u] += par[v];
        par[v] = u;
        comps--;
    }
};

vector<int> G[mxN];
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    int cnt = 0;
    /// A - bus, T - train
    DSU dsu(n);
    for(int i = 0;i < m;++i){
        int u, v;
        char c;
        cin >> u >> v >> c;
        cnt += (c == 'A');
        dsu.Union(u, v);
        G[u].push_back(v);
        G[v].push_back(u);
    }
    if(dsu.comps != 1){
        cout << 0 << '\n';
    }
    else if(cnt == 0){
        cout << n << '\n';
    }
    else{
        int cnt2 = 0;   
        for(int i = 1;i <= n;++i){
            cnt2 += ((int)G[i].size() == n - 1);
        }
        cout << cnt2 << '\n';
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 166 ms 23888 KB Output is correct
2 Correct 3 ms 12120 KB Output is correct
3 Correct 3 ms 12120 KB Output is correct
4 Correct 4 ms 13916 KB Output is correct
5 Correct 3 ms 12124 KB Output is correct
6 Correct 35 ms 14624 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 13916 KB Output is correct
2 Correct 3 ms 12124 KB Output is correct
3 Correct 3 ms 12120 KB Output is correct
4 Correct 3 ms 12208 KB Output is correct
5 Correct 4 ms 12380 KB Output is correct
6 Correct 65 ms 20616 KB Output is correct
7 Correct 108 ms 34244 KB Output is correct
8 Correct 6 ms 12892 KB Output is correct
9 Correct 13 ms 13144 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12120 KB Output is correct
2 Correct 3 ms 12120 KB Output is correct
3 Correct 3 ms 12120 KB Output is correct
4 Correct 3 ms 12208 KB Output is correct
5 Correct 4 ms 12380 KB Output is correct
6 Incorrect 3 ms 12124 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 12124 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 12124 KB Output isn't correct
2 Halted 0 ms 0 KB -