이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
mt19937 gnd(time(NULL));
void solve(){
int n, m;
cin >> n >> m;
int ans = 0;
vector<int> v(n-1);
for(int i = 0; i < n-1; i++){
int a, b;
cin >> a >> b;
cin >> v[i];
ans+=v[i];
}
int q;
cin >> q;
while(q--){
int r, p;
cin >> r >> p;
ans-=v[r-1];
v[r-1]=p;
ans+=p;
cout << ans << endl;
}
}
signed main(){
int t = 1;
// cin >> t;
while(t--) solve();
}
| # | 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... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |