oj.uz

Submission #690498

# Submission time Handle Problem Language Result Execution time Memory
690498 2023-01-30T08:46:45 Z hoangphat120805 Bridges (APIO19_bridges) C++14
13 / 100
 50 ms 8036 KB 
#include <bits/stdc++.h>

using namespace std;
#define reu(i, a, b) for(int i = a, _b = b; i <= _b; ++i)
#define red(i, a, b) for(int i = a, _b = b; i >= _b; --i)
#define ii pair<int,int>
#define fi first
#define se second
#define pb push_back


typedef long long ll;
const int N = 5e4 + 5;

int n, m, q;
int b[N];
vector <ii> adj[N];
int visit[1005];
int bfs(int s, int w){
    memset(visit, 0, sizeof visit);
    int cnt = 1;
    visit[s] = 1;
    queue <int> q;
    q.push(s);
    while(q.size()){
        int u = q.front(); q.pop();

        for(ii x: adj[u]){
            int v = x.fi, id = x.se;
            if (b[id] >= w && visit[v] == 0){
                cnt++;
                visit[v] = 1;
                q.push(v);
            }
        }
    }
    return cnt;
}

void sub1()
{
    cin >> q;
    while(q--){
        int type;
        cin >> type;
        if (type == 1){
            int x, y;
            cin >> x >> y;
            b[x] = y;
        } else {
            int s, w;
            cin >> s >> w;
            cout << bfs(s, w) << '\n';
        }
    }
}
int32_t main()
{
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//    freopen("TAITRONG.inp", "r", stdin);
//    freopen("TAITRONG.out", "w", stdout);
    cin >> n >> m;
    reu(i, 1, m){
        int u, v, d;
        cin >> u >> v >> b[i];
        adj[u].push_back({v, i});
        adj[v].push_back({u, i});
    }
    sub1();
    return 0;
}

Compilation message

bridges.cpp: In function 'int32_t main()':
bridges.cpp:64:19: warning: unused variable 'd' [-Wunused-variable]
   64 |         int u, v, d;
      |                   ^

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1504 KB Output is correct
3 Correct 50 ms 1644 KB Output is correct
4 Correct 8 ms 1620 KB Output is correct
5 Correct 8 ms 1656 KB Output is correct
6 Correct 6 ms 1620 KB Output is correct
7 Correct 6 ms 1492 KB Output is correct
8 Correct 7 ms 1620 KB Output is correct
9 Correct 10 ms 1548 KB Output is correct
10 Correct 6 ms 1620 KB Output is correct
11 Correct 5 ms 1620 KB Output is correct
12 Correct 9 ms 1620 KB Output is correct
13 Correct 9 ms 1628 KB Output is correct
14 Correct 7 ms 1672 KB Output is correct
15 Correct 14 ms 1676 KB Output is correct
16 Correct 7 ms 1520 KB Output is correct
17 Correct 8 ms 1512 KB Output is correct

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 36 ms 7612 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 16 ms 6704 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 26 ms 8036 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 36 ms 7612 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1504 KB Output is correct
3 Correct 50 ms 1644 KB Output is correct
4 Correct 8 ms 1620 KB Output is correct
5 Correct 8 ms 1656 KB Output is correct
6 Correct 6 ms 1620 KB Output is correct
7 Correct 6 ms 1492 KB Output is correct
8 Correct 7 ms 1620 KB Output is correct
9 Correct 10 ms 1548 KB Output is correct
10 Correct 6 ms 1620 KB Output is correct
11 Correct 5 ms 1620 KB Output is correct
12 Correct 9 ms 1620 KB Output is correct
13 Correct 9 ms 1628 KB Output is correct
14 Correct 7 ms 1672 KB Output is correct
15 Correct 14 ms 1676 KB Output is correct
16 Correct 7 ms 1520 KB Output is correct
17 Correct 8 ms 1512 KB Output is correct
18 Runtime error 36 ms 7612 KB Execution killed with signal 11
19 Halted 0 ms 0 KB -