Submission #51621

#TimeUsernameProblemLanguageResultExecution timeMemory
51621Diuven단층 (JOI16_ho_t5)C++11
34 / 100
2054 ms3012 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
const int MX=200010, inf=2e9;

int n, q;

struct {
    int x, d, l;
} L[MX];

void track(pii &p, int idx){
    ll x,y; tie(x,y)=p;
    if(L[idx].d==1){
        // y=x-L[idx].x
        if(y>=x-L[idx].x)
            y-=L[idx].l, x-=L[idx].l;
    }
    else{
        // y=-(x-L[idx].x)
        if(y>=L[idx].x-(x-1))
            y-=L[idx].l, x+=L[idx].l;
    }
    p=pii(x,y);
}

int main(){
    ios::sync_with_stdio(0); cin.tie(0);
    cin>>n>>q;
    for(int i=1; i<=q; i++){
        int x, d, l;
        cin>>x>>d>>l;
        L[i]={x,d,l};
    }
    for(int x=1; x<=n; x++){
        pii coord=pii(x,0);
        //cout<<x<<' '<<0<<'\n';
        for(int i=q; i>=1; i--){
            track(coord, i);
            //cout<<coord.first<<' '<<coord.second<<'\n';
        }
        cout<<-coord.second<<'\n';
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...