# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
499941 | blue | Bitaro, who Leaps through Time (JOI19_timeleap) | C++17 | 3063 ms | 9956 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>
using namespace std;
using ll = long long;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N, Q;
cin >> N >> Q;
ll L[N+1], R[N+1];
for(int i = 1; i <= N-1; i++) cin >> L[i] >> R[i];
for(int j = 1; j <= Q; j++)
{
int T;
cin >> T;
if(T == 1)
{
ll P, S, E;
cin >> P >> S >> E;
L[P] = S;
R[P] = E;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |