제출 #934095

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
934095		vjudge1	다리 (APIO19_bridges)	C++17	0 / 100	3064 ms	16176 KiB

bridges

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define pb push_back
#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;

vector <int> bridge; //int weight [number of bridge];
vector <pair<int,int*>> adj[MAXN +1]; //first to, second.first weight pointer, [from]
int n;

set <int> explora(int v,int w,set <int>& vis){
    for(auto &i:adj[v]){
        if(vis.find(i.first)==vis.end()){
         if(*i.second<w){
            vis.insert(i.first);
            explora(i.first,w,vis);
         }   
        }
    }
    return vis;
}


int main(){
    //ios_base::sync_with_stdio(0); std::cin.tie(0); std::cout.tie(0);
    int t=0,i=0,k=0,q=0,v=0,m=0,u=0,d=0,w=0,b=0;cin>>n>>m;
    bridge.reserve(m);
    for(i=1;i<=m;i++){
        cin>>u>>v>>d;
        bridge[i]=d;
        adj[u].pb(mp(v,&bridge[i]));
        adj[v].pb(mp(u,&bridge[i]));
    }
    //bridge first weight [number of bridge];
    //adj first to, second weight [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;
            set <int> vis;
            vis=explora(u,w,vis);
            t=vis.size();
            cout<<t<<"\n";
        }
        
    }


    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

bridges.cpp: In function 'int main()':
bridges.cpp:34:17: warning: unused variable 'k' [-Wunused-variable]
   34 |     int t=0,i=0,k=0,q=0,v=0,m=0,u=0,d=0,w=0,b=0;cin>>n>>m;
      |                 ^

• Subtask 1: 0 / 13
• Subtask 2: 0 / 16
• Subtask 3: 0 / 17
• Subtask 4: 0 / 14
• Subtask 5: 0 / 13
• Subtask 6: 0 / 27