# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1095121 | vjudge1 | Bridges (APIO19_bridges) | C++17 | 695 ms | 3532 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
#warning That's not the baby, that's my baby
#define debug(x) #x << " = " << x << '\n'
using ll = long long;
const int INF = 1e9;
const int NMAX = 5e4;
int a[NMAX + 1];
int main() {
// std::ios_base::sync_with_stdio(false);
// std::cin.tie(0);
// std::cout.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
#endif
int n, m;
std::cin >> n >> m;
for (int i = 1; i < n; i++) {
int u, v, w;
std::cin >> u >> v >> w;
a[u] = w;
}
int q;
std::cin >> q;
while (q--) {
int type;
std::cin >> type;
if (type == 1) {
int u, w;
std::cin >> u >> w;
a[u] = w;
} else {
int u, w;
std::cin >> u >> w;
int l = u, r = u;
while (a[r] >= w) {
r++;
}
while (a[l - 1] >= w) {
l--;
}
std::cout << r - l + 1 << '\n';
}
}
return 0;
}
Compilation message (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... |