oj.uz

Submission #406724

# Submission time Handle Problem Language Result Execution time Memory
406724 2021-05-18T03:46:23 Z tengiz05 Bridges (APIO19_bridges) C++17
13 / 100
 3000 ms 7916 KB 
#include <bits/stdc++.h>
int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int n, m, q;
    std::cin >> n >> m;
    std::vector<std::tuple<int, int, int>> edges;
    for (int i = 0; i < m; i++) {
        int u, v, w;
        std::cin >> u >> v >> w;
        u--;
        v--;
        edges.emplace_back(u, v, w);
    }
    std::cin >> q;
    while (q--) {
        int type;
        std::cin >> type;
        if (type == 1) {
            int b, r;
            std::cin >> b >> r;
            b--;
            std::get<2>(edges[b]) = r;
        } else {
            std::vector<std::vector<std::pair<int, int>>> e(n);
            for (auto [u, v, w] : edges) {
                e[u].emplace_back(v, w);
                e[v].emplace_back(u, w);
            }
            int s, W;
            std::cin >> s >> W;
            s--;
            int ans = 0;
            std::vector<bool> vis(n);
            std::function<void(int)> dfs = [&](int u){
                ans++;
                vis[u] = true;
                for (auto [v, w] : e[u]) {
                    if (!vis[v] && w >= W) {
                        dfs(v);
                    }
                }
            };
            dfs(s);
            std::cout << ans << '\n';
        }
    }
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 340 ms 532 KB Output is correct
4 Correct 5 ms 452 KB Output is correct
5 Correct 27 ms 472 KB Output is correct
6 Correct 34 ms 480 KB Output is correct
7 Correct 82 ms 384 KB Output is correct
8 Correct 66 ms 428 KB Output is correct
9 Correct 83 ms 380 KB Output is correct
10 Correct 56 ms 380 KB Output is correct
11 Correct 58 ms 460 KB Output is correct
12 Correct 68 ms 432 KB Output is correct
13 Correct 127 ms 440 KB Output is correct
14 Correct 110 ms 464 KB Output is correct
15 Correct 109 ms 472 KB Output is correct
16 Correct 64 ms 392 KB Output is correct
17 Correct 75 ms 380 KB Output is correct

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3078 ms 3816 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3092 ms 2908 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3090 ms 7916 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3078 ms 3816 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 340 ms 532 KB Output is correct
4 Correct 5 ms 452 KB Output is correct
5 Correct 27 ms 472 KB Output is correct
6 Correct 34 ms 480 KB Output is correct
7 Correct 82 ms 384 KB Output is correct
8 Correct 66 ms 428 KB Output is correct
9 Correct 83 ms 380 KB Output is correct
10 Correct 56 ms 380 KB Output is correct
11 Correct 58 ms 460 KB Output is correct
12 Correct 68 ms 432 KB Output is correct
13 Correct 127 ms 440 KB Output is correct
14 Correct 110 ms 464 KB Output is correct
15 Correct 109 ms 472 KB Output is correct
16 Correct 64 ms 392 KB Output is correct
17 Correct 75 ms 380 KB Output is correct
18 Execution timed out 3078 ms 3816 KB Time limit exceeded
19 Halted 0 ms 0 KB -