# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1143321 | SmuggingSpun | Bridges (APIO19_bridges) | C++20 | 45 ms | 328 KiB |
#include<bits/stdc++.h>
#define taskname "B"
using namespace std;
int n, m, q;
namespace sub1{
void solve(){
vector<int>u(m + 1), v(m + 1), w(m + 1);
vector<vector<int>>g(n + 1);
for(int i = 1; i <= m; i++){
cin >> u[i] >> v[i] >> w[i];
g[u[i]].emplace_back(i);
g[v[i]].emplace_back(i);
}
cin >> q;
for(int _ = 0; _ < q; _++){
int _t, a, b;
cin >> _t >> a >> b;
if(_t == 1){
w[a] = b;
}
else{
vector<bool>vis(n + 1, false);
vis[a] = true;
queue<int>Q;
Q.push(a);
int ans = 1;
while(!Q.empty()){
int i = Q.front();
Q.pop();
for(int& index : g[i]){
int j = u[index] ^ v[index] ^ i;
if(w[index] >= b && !vis[j]){
ans++;
vis[j] = true;
Q.push(j);
}
}
}
cout << ans << "\n";
}
}
}
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if(fopen(taskname".inp", "r")){
freopen(taskname".inp", "r", stdin);
}
cin >> n >> m;
if(n <= 1000 && m <= 1000){
sub1::solve();
}
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |