제출 #974680

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
974680		Abito	다리 (APIO19_bridges)	C++17	13 / 100	3058 ms	12532 KiB

bridges

#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define ep insert
#define endl '\n'
#define elif else if
#define pow pwr
#define sqrt sqrtt
#define int long long
#define ll long long
typedef unsigned long long ull;
using namespace std;
const int N=1e5+5;
int n,m,q,w[N],W;
vector<pair<int,int>> adj[N];
bool vis[N];
void dfs(int x){
    vis[x]=1;
    for (auto u:adj[x]){
        if (vis[u.F] || w[u.S]<W) continue;
        dfs(u.F);
    }return;
}
int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    cin>>n>>m;
    for (int i=1;i<=m;i++){
        int x,y;
        cin>>x>>y>>w[i];
        adj[x].pb({y,i});
        adj[y].pb({x,i});
    }
    cin>>q;
    while (q--){
        int t,x,y;
        cin>>t>>x>>y;
        if (t==1) w[x]=y;
        else{
            W=y;
            dfs(x);
            int ans=0;
            for (int i=1;i<=n;i++) ans+=vis[i],vis[i]=0;
            cout<<ans<<endl;
        }
    }
    return 0;
}

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