#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int MAXN = (int)1e3 + 3;
const ll infint = (int)1e9 + 3;
const int MOD = (int)1e9 + 7;
const ll inf = (ll)1e18 + 3;
int n, q, l[MAXN], r[MAXN];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin >> n >> q;
for (int i = 1; i <= n - 1; i++)
{
cin >> l[i] >> r[i];
r[i]--;
}
for (int i = 0; i < q; i++)
{
int type;
cin >> type;
if(type == 1)
{
int id, x, y;
cin >> id >> x >> y;
l[id] = x, r[id] = y - 1;
}
else
{
int A, tx, B, ty;
cin >> A >> tx >> B >> ty;
ll ans = 0;
if(A < B)
{
while(A ^ B)
{
if(tx > r[A])
ans += tx - r[A], tx = r[A];
if(tx < l[A])
tx = l[A];
tx++, A++;
}
if(tx > ty)
ans += tx - ty;
}
else
{
while(A ^ B)
{
if(tx > r[A - 1])
ans += tx - r[A - 1], tx = r[A - 1];
if(tx < l[A - 1])
tx = l[A - 1];
tx++, A--;
}
if(tx > ty)
ans += tx - ty;
}
cout << ans << "\n";
}
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
248 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
376 KB |
Output is correct |
| 8 |
Correct |
2 ms |
376 KB |
Output is correct |
| 9 |
Correct |
2 ms |
376 KB |
Output is correct |
| 10 |
Correct |
2 ms |
376 KB |
Output is correct |
| 11 |
Correct |
4 ms |
504 KB |
Output is correct |
| 12 |
Correct |
3 ms |
376 KB |
Output is correct |
| 13 |
Correct |
3 ms |
376 KB |
Output is correct |
| 14 |
Correct |
3 ms |
376 KB |
Output is correct |
| 15 |
Correct |
3 ms |
376 KB |
Output is correct |
| 16 |
Correct |
3 ms |
376 KB |
Output is correct |
| 17 |
Correct |
3 ms |
376 KB |
Output is correct |
| 18 |
Correct |
3 ms |
376 KB |
Output is correct |
| 19 |
Correct |
4 ms |
376 KB |
Output is correct |
| 20 |
Correct |
3 ms |
440 KB |
Output is correct |
| 21 |
Correct |
3 ms |
376 KB |
Output is correct |
| 22 |
Correct |
3 ms |
376 KB |
Output is correct |
| 23 |
Correct |
3 ms |
376 KB |
Output is correct |
| 24 |
Correct |
3 ms |
376 KB |
Output is correct |
| 25 |
Correct |
3 ms |
376 KB |
Output is correct |
| 26 |
Correct |
3 ms |
376 KB |
Output is correct |
| 27 |
Correct |
3 ms |
376 KB |
Output is correct |
| 28 |
Correct |
3 ms |
376 KB |
Output is correct |
| 29 |
Correct |
3 ms |
376 KB |
Output is correct |
| 30 |
Correct |
3 ms |
376 KB |
Output is correct |
| 31 |
Correct |
3 ms |
376 KB |
Output is correct |
| 32 |
Correct |
3 ms |
380 KB |
Output is correct |
| 33 |
Correct |
3 ms |
376 KB |
Output is correct |
| 34 |
Correct |
3 ms |
504 KB |
Output is correct |
| 35 |
Correct |
3 ms |
376 KB |
Output is correct |
| 36 |
Correct |
3 ms |
376 KB |
Output is correct |
| 37 |
Correct |
3 ms |
380 KB |
Output is correct |
| 38 |
Correct |
3 ms |
376 KB |
Output is correct |
| 39 |
Correct |
4 ms |
376 KB |
Output is correct |
| 40 |
Correct |
3 ms |
376 KB |
Output is correct |
| 41 |
Correct |
2 ms |
376 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
3 ms |
688 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
248 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| 6 |
Correct |
2 ms |
376 KB |
Output is correct |
| 7 |
Correct |
2 ms |
376 KB |
Output is correct |
| 8 |
Correct |
2 ms |
376 KB |
Output is correct |
| 9 |
Correct |
2 ms |
376 KB |
Output is correct |
| 10 |
Correct |
2 ms |
376 KB |
Output is correct |
| 11 |
Correct |
4 ms |
504 KB |
Output is correct |
| 12 |
Correct |
3 ms |
376 KB |
Output is correct |
| 13 |
Correct |
3 ms |
376 KB |
Output is correct |
| 14 |
Correct |
3 ms |
376 KB |
Output is correct |
| 15 |
Correct |
3 ms |
376 KB |
Output is correct |
| 16 |
Correct |
3 ms |
376 KB |
Output is correct |
| 17 |
Correct |
3 ms |
376 KB |
Output is correct |
| 18 |
Correct |
3 ms |
376 KB |
Output is correct |
| 19 |
Correct |
4 ms |
376 KB |
Output is correct |
| 20 |
Correct |
3 ms |
440 KB |
Output is correct |
| 21 |
Correct |
3 ms |
376 KB |
Output is correct |
| 22 |
Correct |
3 ms |
376 KB |
Output is correct |
| 23 |
Correct |
3 ms |
376 KB |
Output is correct |
| 24 |
Correct |
3 ms |
376 KB |
Output is correct |
| 25 |
Correct |
3 ms |
376 KB |
Output is correct |
| 26 |
Correct |
3 ms |
376 KB |
Output is correct |
| 27 |
Correct |
3 ms |
376 KB |
Output is correct |
| 28 |
Correct |
3 ms |
376 KB |
Output is correct |
| 29 |
Correct |
3 ms |
376 KB |
Output is correct |
| 30 |
Correct |
3 ms |
376 KB |
Output is correct |
| 31 |
Correct |
3 ms |
376 KB |
Output is correct |
| 32 |
Correct |
3 ms |
380 KB |
Output is correct |
| 33 |
Correct |
3 ms |
376 KB |
Output is correct |
| 34 |
Correct |
3 ms |
504 KB |
Output is correct |
| 35 |
Correct |
3 ms |
376 KB |
Output is correct |
| 36 |
Correct |
3 ms |
376 KB |
Output is correct |
| 37 |
Correct |
3 ms |
380 KB |
Output is correct |
| 38 |
Correct |
3 ms |
376 KB |
Output is correct |
| 39 |
Correct |
4 ms |
376 KB |
Output is correct |
| 40 |
Correct |
3 ms |
376 KB |
Output is correct |
| 41 |
Correct |
2 ms |
376 KB |
Output is correct |
| 42 |
Runtime error |
3 ms |
688 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 43 |
Halted |
0 ms |
0 KB |
- |
