제출 #1171204

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1171204		qrn	Monthly railway pass (LMIO18_menesinis_bilietas)	C++20	0 / 100	302 ms	47540 KiB

menesinis_bilietas

#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;

#define SPEED                     \
    ios_base::sync_with_stdio(0); \
    cin.tie(NULL);                \
    cout.tie(NULL);

#define pb push_back
#define ins insert
#define fi first
#define se second

#define endl "\n"
#define ALL(x) x.begin(), x.end()
#define sz(x) x.size()
#define intt long long

const intt mod = 1e9 + 7;
const intt base = 31;
const intt inf = 1e9;
const intt mxN = 2e5 + 5;
const intt L = 21;

vector<vector<intt>> graph;
set<intt> st[mxN];
vector<intt> roots(mxN), color(mxN), xalq(mxN);

vector<intt> comp;
void dfs(intt node) {
    color[node] = 1;
    comp.pb(node);
    for(auto u : graph[node]) {
        if(!color[u]) {
            dfs(u);
        }
    }
}

void solve() {
    intt n, m;
    cin >> n >> m;
    graph.assign(n + 1, vector<intt>{});

    vector<pair<intt,intt>> buses;
    for(intt i = 0; i < m; i++) {
        char c;
        intt a, b;
        cin >> a >> b >> c;
        if(c == 'T') {
            graph[a].pb(b);
            graph[b].pb(a);
        } else {
            buses.pb({a, b});
        }
    }

    vector<intt> r;
    intt cnt = 0;
    for(intt i = 1; i <= n; i++) {
        if(!color[i]) {
            dfs(i);
            intt represent = *min_element(ALL(comp));
            for(auto u : comp) roots[u] = represent;
            r.pb(represent);
            xalq[represent] = comp.size();
            cnt++;
            comp.clear();
        }
    }
    // cout << cnt << endl;

    for(intt i = 0; i < buses.size(); i++) {
        intt a = roots[buses[i].fi], b = roots[buses[i].se];
        // cout << buses[i].fi << " " << buses[i].se << ": " << a << " " << b << endl; 
        st[a].insert(b);
        st[b].insert(a);
    }

    intt ans = 0;
    for(auto root : r) {
        if(st[root].size() >= cnt-1) {
            ans += xalq[root];
        }
    }
    cout << ans << endl;
}

signed main() {
    SPEED;
    intt tst = 1;
    // cin >> tst;
    while (tst--) {
        solve();
    }
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 6
• Subtask 3: 0 / 30
• Subtask 4: 0 / 35
• Subtask 5: 0 / 19