oj.uz

Submission #934670

# Submission time Handle Problem Language Result Execution time Memory
934670 2024-02-27T18:56:35 Z viktorchares Bridges (APIO19_bridges) C++17
13 / 100
 3000 ms 10344 KB 
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define endl "\n"
#define YES cout<<"YES\n"
#define NO cout<<"NO\n"
#define pb push_back
#define mp make_pair
#define fi first
#define se second
bool z=0;
const int MAXN=2e5;

bool vis[MAXN+5];
vector <int> bridge; //int weight [number of bridge];
vector <pair<int,int>> adj[MAXN +1]; //first to, second number of bridge, [from]
int n=0,cnt=0;

void explora(int v,int w){
    int siz=adj[v].size();
    for(int i=0;i<siz;i++){
        if(vis[adj[v][i].fi]==0 && bridge[adj[v][i].se]>=w){
            cnt++;
            vis[adj[v][i].fi]=1;
            explora(adj[v][i].fi,w);
         }   
    }
    return;
}


int main(){
    //ios_base::sync_with_stdio(0); std::cin.tie(0); std::cout.tie(0);
    int t=0,i=0,q=0,v=0,m=0,u=0,d=0,w=0,b=0;cin>>n>>m;
    bridge.resize(m+1);
    for(i=1;i<=m;i++){
        cin>>u>>v>>d;
        bridge[i]=d;
        adj[u].pb(mp(v,i));
        adj[v].pb(mp(u,i));
    }
    //bridge first weight [number of bridge];
    //adj first to, second number of bridge, [from]
    cin>>q;
    for(i=0;i<q;i++){
        cin>>t;
        if(t==1){//weight changes
            cin>>b>>w;
            bridge[b]=w;
        }else if(t==2){
            cin>>u>>w;
            fill(vis,vis+n+1,false);
            vis[u]=1;
            cnt=1;
            explora(u,w);
            std::cout<<cnt<<"\n";
        }
        
    }


    return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 38 ms 5184 KB Output is correct
4 Correct 18 ms 4956 KB Output is correct
5 Correct 14 ms 5152 KB Output is correct
6 Correct 16 ms 4952 KB Output is correct
7 Correct 14 ms 5108 KB Output is correct
8 Correct 20 ms 4952 KB Output is correct
9 Correct 13 ms 4956 KB Output is correct
10 Correct 13 ms 5144 KB Output is correct
11 Correct 13 ms 4952 KB Output is correct
12 Correct 13 ms 4956 KB Output is correct
13 Correct 15 ms 5212 KB Output is correct
14 Correct 14 ms 5212 KB Output is correct
15 Correct 15 ms 5308 KB Output is correct
16 Correct 12 ms 5212 KB Output is correct
17 Correct 12 ms 5148 KB Output is correct

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 190 ms 8532 KB Output is correct
2 Correct 196 ms 9360 KB Output is correct
3 Correct 190 ms 9344 KB Output is correct
4 Correct 342 ms 9300 KB Output is correct
5 Correct 296 ms 9296 KB Output is correct
6 Execution timed out 3030 ms 9556 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 722 ms 6884 KB Output is correct
2 Correct 1694 ms 5712 KB Output is correct
3 Execution timed out 3050 ms 8284 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

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

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 190 ms 8532 KB Output is correct
2 Correct 196 ms 9360 KB Output is correct
3 Correct 190 ms 9344 KB Output is correct
4 Correct 342 ms 9300 KB Output is correct
5 Correct 296 ms 9296 KB Output is correct
6 Execution timed out 3030 ms 9556 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 38 ms 5184 KB Output is correct
4 Correct 18 ms 4956 KB Output is correct
5 Correct 14 ms 5152 KB Output is correct
6 Correct 16 ms 4952 KB Output is correct
7 Correct 14 ms 5108 KB Output is correct
8 Correct 20 ms 4952 KB Output is correct
9 Correct 13 ms 4956 KB Output is correct
10 Correct 13 ms 5144 KB Output is correct
11 Correct 13 ms 4952 KB Output is correct
12 Correct 13 ms 4956 KB Output is correct
13 Correct 15 ms 5212 KB Output is correct
14 Correct 14 ms 5212 KB Output is correct
15 Correct 15 ms 5308 KB Output is correct
16 Correct 12 ms 5212 KB Output is correct
17 Correct 12 ms 5148 KB Output is correct
18 Correct 190 ms 8532 KB Output is correct
19 Correct 196 ms 9360 KB Output is correct
20 Correct 190 ms 9344 KB Output is correct
21 Correct 342 ms 9300 KB Output is correct
22 Correct 296 ms 9296 KB Output is correct
23 Execution timed out 3030 ms 9556 KB Time limit exceeded
24 Halted 0 ms 0 KB -