oj.uz

Submission #247022

# Submission time Handle Problem Language Result Execution time Memory
247022 2020-07-10T19:21:44 Z dolphingarlic Monthly railway pass (LMIO18_menesinis_bilietas) C++14
16 / 100
 657 ms 67040 KB 
#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

vector<pair<int, int>> bus;
int cmp[500001], cmp_cnt;
set<int> graph[500001];

int find(int A) {
    while (A != cmp[A]) cmp[A] = cmp[cmp[A]], A = cmp[A];
    return A;
}

void onion(int A, int B) {
    if (find(A) == find(B)) return;
    cmp[find(A)] = cmp[find(B)];
    cmp_cnt--;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    iota(cmp + 1, cmp + n + 1, 1);
    cmp_cnt = n;
    while (m--) {
        int u, v;
        char t;
        cin >> u >> v >> t;
        if (t == 'A') bus.push_back({u, v});
        else onion(u, v);
    }
    for (pair<int, int> i : bus) {
        graph[find(i.first)].insert(find(i.second));
        graph[find(i.second)].insert(find(i.first));
    }

    int ans = 0;
    FOR(i, 1, n + 1) if (graph[find(i)].size() == cmp_cnt - 1) ans++;
    cout << ans;
    return 0;
}

Compilation message

menesinis_bilietas.cpp: In function 'int main()':
menesinis_bilietas.cpp:41:48: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     FOR(i, 1, n + 1) if (graph[find(i)].size() == cmp_cnt - 1) ans++;
                          ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 172 ms 25324 KB Output is correct
2 Correct 20 ms 23808 KB Output is correct
3 Correct 20 ms 23808 KB Output is correct
4 Correct 21 ms 25728 KB Output is correct
5 Correct 20 ms 23864 KB Output is correct
6 Correct 53 ms 24064 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 25728 KB Output is correct
2 Correct 17 ms 23808 KB Output is correct
3 Correct 19 ms 23936 KB Output is correct
4 Correct 21 ms 24576 KB Output is correct
5 Correct 20 ms 23864 KB Output is correct
6 Correct 559 ms 57852 KB Output is correct
7 Correct 657 ms 67040 KB Output is correct
8 Correct 32 ms 25600 KB Output is correct
9 Correct 46 ms 27000 KB Output is correct

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 23808 KB Output is correct
2 Correct 19 ms 23808 KB Output is correct
3 Correct 21 ms 23936 KB Output is correct
4 Correct 26 ms 23936 KB Output is correct
5 Incorrect 21 ms 24192 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 23808 KB Output is correct
2 Correct 19 ms 23808 KB Output is correct
3 Correct 21 ms 23936 KB Output is correct
4 Correct 26 ms 23936 KB Output is correct
5 Incorrect 21 ms 24192 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 23808 KB Output is correct
2 Correct 19 ms 23808 KB Output is correct
3 Correct 21 ms 23936 KB Output is correct
4 Correct 26 ms 23936 KB Output is correct
5 Incorrect 21 ms 24192 KB Output isn't correct
6 Halted 0 ms 0 KB -