제출 #279371

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
279371		Nodir_Bobiev	다리 (APIO19_bridges)	C++17	13 / 100	399 ms	24612 KiB

bridges

/*
+----------------------------------------------------------------+
| In the name of Allah, the most Gracious and the most Merciful. |
+----------------------------------------------------------------+
When you are down in your misery
And there is nowhere to run
Remember just remember
You can always run to The One.
When things are down
And you are out of your mind
Remember just remember
Allah is The Kind.
*/
# include <bits/stdc++.h>
# define FILE
using namespace std;

const int N = 5e4 + 100;
int n, m, q, used[N], V[N], U[N], W[N];
vector < vector < int > > gr[N];
vector < vector < int > > queires;

int dfs( int x, int v, int w ){
	used[v] = x;
	int cnt = 1;
	for( auto to: gr[v] ){
		if( W[to[1]] >= w && used[to[0]] != x){
			cnt += dfs(x, to[0], w);
		}
	}return cnt;
}
void Subtask1(){
	for( int i = 1; i <= q; i ++ ){
		if( queires[i-1][0] == 1 ){
			W[queires[i-1][1]] = queires[i-1][2];
		}
		else{
			cout << dfs(i, queires[i-1][1], queires[i-1][2]) << endl;
		}
	}
	exit( 0 );
}

int main(){
    # ifdef FILEs
        freopen( "input.txt", "r", stdin );
        freopen( "output.txt", "w", stdout );
    # endif
    ios_base::sync_with_stdio(false);
    cin >> n >> m;
    for( int i = 1; i <= m; i ++ ){
    	cin >> V[i] >> U[i] >> W[i];
    	gr[V[i]].push_back( {U[i], i} );
    	gr[U[i]].push_back( {V[i], i} );
    }
    cin >> q;
    for(int i = 1; i <= q; i ++ ){
    	int t, a, b; cin >> t >> a >> b;
    	queires.push_back({t,a,b});
    }
    if( n <= 1000 && m <= 1000 && q <= 10000){
    	Subtask1();
    }

}

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