제출 #409310

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
409310		MOUF_MAHMALAT	다리 (APIO19_bridges)	C++14	13 / 100	42 ms	3020 KiB

bridges

#include<bits/stdc++.h>
#define all(s) s.begin(),s.end()
#define F first
#define S second
using namespace std;
typedef int ll;
ll n,m,x,y,z,q,t,ans;
pair<ll,ll>p[1009],id[1009];
bool b[1009];
vector<vector<pair<ll,ll> > >v;
void dfs(ll d)
{
    b[d]=1,ans++;
    //cout<<d<<" ";
    for(auto z:v[d])
        if(b[z.F]==0&&z.S>=y)
            dfs(z.F);
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>m;
    v.resize(n+1);
    for(ll i=1; i<=m; i++)
    {
        cin>>x>>y>>z;
        ll x1=v[x].size(),y1=v[y].size();
        p[i]= {x,y},id[i]= {x1,y1};
        v[x].push_back({y,z});
        v[y].push_back({x,z});
    }
    cin>>q;
    while(q--)
    {
        cin>>t>>x>>y;
        if(t==1)
        {
            v[ p[x].F ][ id[x].F ].S=y;
            v[ p[x].S ][ id[x].S ].S=y;
        }
        else
        {
            memset(b,0,sizeof b);
            ans=0,dfs(x);
            cout<<ans<<"\n";
        }
    }
    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