제출 #1019737

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1019737		modwwe	Bitaro, who Leaps through Time (JOI19_timeleap)	C++17	4 / 100	3056 ms	10504 KiB

timeleap

#include <bits/stdc++.h>
#define int long long
using namespace std;

const int Nmax=300010;
int N, Q, L[Nmax], R[Nmax];

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>N>>Q;
    for(int i=1; i<N; i++) cin>>L[i]>>R[i];
    while(Q--) {
        int op; cin>>op;
        if(op==1) {
            int k, l, r; cin>>k>>l>>r;
            L[k]=l, R[k]=r;
        }
        else {
            int s, x, e, y, ans=0;
            cin>>s>>x>>e>>y;
            if(s<e) {
                for(int i=s; i<e; i++) {
                    if(x<=L[i]) x=L[i]+1;
                    else if(x<R[i]) x++;
                    else ans+=x-(R[i]-1), x=R[i];
                }
                ans+=max(0ll, x-y);
            }
            else {
                for(int i=s-1; i>=e; i--) {
                    if(x<=L[i]) x=L[i]+1;
                    else if(x<R[i]) x++;
                    else ans+=x-(R[i]-1), x=R[i];
                }
                ans+=max(0ll, x-y);
            }
            cout<<ans<<"\n";
        }
    }
    return 0;
}

• Subtask 1: 4 / 4
• Subtask 2: 0 / 30
• Subtask 3: 0 / 66