oj.uz

Submission #926537

# Submission time Handle Problem Language Result Execution time Memory
926537 2024-02-13T08:35:54 Z Aiperiii Bridges (APIO19_bridges) C++14
13 / 100
 3000 ms 10468 KB 
#include <bits/stdc++.h>
#define int long long
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define pb push_back
using namespace std;
signed main(){
    ios_base::sync_with_stdio();
    cin.tie(0);cout.tie(0);
    int n,m;
    cin>>n>>m;
    vector <int> u(m+1),v(m+1),w(m+1);
    
    for(int i=1;i<=m;i++){
        cin>>u[i]>>v[i]>>w[i];
    }
    int qu;cin>>qu;
    while(qu--){
        int type,ver,x;
        cin>>type>>ver>>x;
        if(type==1)w[ver]=x;
        else{
            vector <pair <int,int> > g[n+1];
            for(int i=1;i<=m;i++){
                g[u[i]].pb({v[i],w[i]});
                g[v[i]].pb({u[i],w[i]});
            }
            vector <int> vis(n+1);
            vis[ver]=1;
            int cnt=1;
            queue <int> q;q.push(ver);
            while(!q.empty()){
                int v=q.front();
                q.pop();
                for(auto to : g[v]){
                    if(!vis[to.ff] && to.ss>=x){
                        vis[to.ff]=1;
                        cnt++;
                        q.push(to.ff);
                    }
                }
            }
            cout<<cnt<<"\n";
        }
    }
}
/*
 
 3 4
 1 2 5
 2 3 2
 3 1 4
 2 3 8
 5
 2 1 5
 1 4 1
 2 2 5
 1 1 1
 2 3 2
 */

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 255 ms 792 KB Output is correct
4 Correct 6 ms 344 KB Output is correct
5 Correct 22 ms 348 KB Output is correct
6 Correct 22 ms 348 KB Output is correct
7 Correct 28 ms 348 KB Output is correct
8 Correct 30 ms 348 KB Output is correct
9 Correct 28 ms 344 KB Output is correct
10 Correct 29 ms 348 KB Output is correct
11 Correct 30 ms 448 KB Output is correct
12 Correct 29 ms 348 KB Output is correct
13 Correct 43 ms 348 KB Output is correct
14 Correct 44 ms 348 KB Output is correct
15 Correct 43 ms 348 KB Output is correct
16 Correct 28 ms 444 KB Output is correct
17 Correct 30 ms 348 KB Output is correct

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3017 ms 5460 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 3081 ms 4092 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 3063 ms 10468 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 3017 ms 5460 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 255 ms 792 KB Output is correct
4 Correct 6 ms 344 KB Output is correct
5 Correct 22 ms 348 KB Output is correct
6 Correct 22 ms 348 KB Output is correct
7 Correct 28 ms 348 KB Output is correct
8 Correct 30 ms 348 KB Output is correct
9 Correct 28 ms 344 KB Output is correct
10 Correct 29 ms 348 KB Output is correct
11 Correct 30 ms 448 KB Output is correct
12 Correct 29 ms 348 KB Output is correct
13 Correct 43 ms 348 KB Output is correct
14 Correct 44 ms 348 KB Output is correct
15 Correct 43 ms 348 KB Output is correct
16 Correct 28 ms 444 KB Output is correct
17 Correct 30 ms 348 KB Output is correct
18 Execution timed out 3017 ms 5460 KB Time limit exceeded
19 Halted 0 ms 0 KB -