oj.uz

답안 #674984

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
674984 2022-12-26T18:26:31 Z urosk 치료 계획 (JOI20_treatment) C++14
39 / 100
 2248 ms 524288 KB 
#define here cerr<<"===========================================\n"
#define dbg(x) cerr<<#x<<": "<<x<<endl;
#include "bits/stdc++.h"
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
#define ld double
#define ll long long
#define llinf 100000000000000000LL // 10^17
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) (ll)(a.size())
#define all(a) a.begin(),a.end()
#define ceri(a,l,r) {cerr<<#a<<": ";for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
#define cer(a) {cerr<<#a<<": ";for(ll x_ : a) cerr<<x_<< " ";cerr<<endl;}

#define daj_mi_malo_vremena ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);

using namespace std;
//using namespace __gnu_pbds;
/*
ll add(ll x,ll y){
    x+=y;
    if(x<0){
        x%=mod;
        x+=mod;
    }else{
        if(x>=mod) x%=mod;
    }
    return x;
}
ll mul(ll a,ll b){
	ll ans = (a*b)%mod;
	if(ans<0) ans+=mod;
	return ans;
}
typedef tree<int,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<int,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_multiset;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rnd(ll l,ll r){
    return uniform_int_distribution<ll>(l,r)(rng);
}
*/
#define maxn 100005
#define maxx 3000005
ll n,m;
struct tupl{
    ll t,l,r,c;
} a[maxn];
ll tsz = 1,tsz2 = 1;
ll ls[maxx],rs[maxx];
ll ls2[maxx],rs2[maxx];
set<pair<int,int> > t[maxx],t2[maxn];
void upd(ll v,ll tl,ll tr,ll i,pll p,bool f){
    if(f) t[v].insert(p);
    else t[v].erase(p);
    if(tl==tr) return;
    ll mid = (tl+tr)/2;
    if(i<=mid){
        if(!ls[v]) ls[v] = ++tsz;
        upd(ls[v],tl,mid,i,p,f);
    }else{
        if(!rs[v]) rs[v] = ++tsz;
        upd(rs[v],mid+1,tr,i,p,f);
    }
}
void upd2(ll v,ll tl,ll tr,ll i,pll p,bool f){
    if(f) t2[v].insert(p);
    else t2[v].erase(p);
    if(tl==tr) return;
    ll mid = (tl+tr)/2;
    if(i<=mid){
        if(!ls2[v]) ls2[v] = ++tsz2;
        upd2(ls2[v],tl,mid,i,p,f);
    }else{
        if(!rs2[v]) rs2[v] = ++tsz2;
        upd2(rs2[v],mid+1,tr,i,p,f);
    }
}
set<ll> s;
void get(ll v,ll tl,ll tr,ll l,ll r,ll x){
    if(l>r) return;
    if(tl==l&&tr==r){
        auto it = t[v].begin();
        while(it!=t[v].end()&&(*it).fi<=x){
            s.insert((*it).sc);
            it++;
        }
        return;
    }
    ll mid = (tl+tr)/2;
    if(ls[v]) get(ls[v],tl,mid,l,min(mid,r),x);
    if(rs[v]) get(rs[v],mid+1,tr,max(mid+1,l),r,x);
}
void get2(ll v,ll tl,ll tr,ll l,ll r,ll x){
    if(l>r) return;
    if(tl==l&&tr==r){
        auto it = t2[v].begin();
        while(it!=t2[v].end()&&(*it).fi<=x){
            s.insert((*it).sc);
            it++;
        }
        return;
    }
    ll mid = (tl+tr)/2;
    if(ls2[v]) get2(ls2[v],tl,mid,l,min(mid,r),x);
    if(rs2[v]) get2(rs2[v],mid+1,tr,max(mid+1,l),r,x);
}
ll d[maxn];
void tc(){
    cin >> m >> n;
    for(ll i = 1;i<=n;i++) cin >> a[i].t >> a[i].l >> a[i].r >> a[i].c;
    for(ll i = 1;i<=n;i++) a[i].l--;
    ll mxt = 0;
    for(ll i = 1;i<=n;i++) mxt = max(mxt,a[i].t);
    for(ll i = 1;i<=n;i++){
        upd(1,1,mxt,a[i].t,{a[i].l+a[i].t,i},1);
        upd2(1,1,mxt,a[i].t,{a[i].l-a[i].t,i},1);
    }
    for(ll i = 1;i<=n;i++) d[i] = llinf;
    priority_queue<pll> pq;
    for(ll i = 1;i<=n;i++){
        if(a[i].l==0){
            d[i] = a[i].c;
            pq.push({-d[i],i});
            upd(1,1,mxt,a[i].t,{a[i].l+a[i].t,i},0);
            upd2(1,1,mxt,a[i].t,{a[i].l-a[i].t,i},0);
        }
    }
    while(sz(pq)){
        pll p = pq.top();
        ll i = p.sc;
        pq.pop();
        if(-p.fi!=d[i]) continue;
        s.clear();
        get(1,1,mxt,a[i].t,mxt,a[i].r+a[i].t);
        get2(1,1,mxt,1,a[i].t,a[i].r-a[i].t);
        for(ll j : s){
            if(j==i) continue;
            d[j] = d[i] + a[j].c;
            upd(1,1,mxt,a[j].t,{a[j].l+a[j].t,j},0);
            upd2(1,1,mxt,a[j].t,{a[j].l-a[j].t,j},0);
            pq.push({-d[j],j});
        }
    }
    ll ans = llinf;
    for(ll i = 1;i<=n;i++) if(a[i].r==m) ans = min(ans,d[i]);
    if(ans==llinf) ans = -1;
    cout<<ans<<endl;
}
int main(){
	daj_mi_malo_vremena
    int t; t = 1;
    while(t--){
        tc();
    }
	return 0;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 175 ms 159224 KB Output is correct
2 Correct 165 ms 159308 KB Output is correct
3 Correct 182 ms 160444 KB Output is correct
4 Correct 204 ms 160592 KB Output is correct
5 Correct 235 ms 161432 KB Output is correct
6 Correct 173 ms 159436 KB Output is correct
7 Correct 154 ms 159320 KB Output is correct
8 Correct 138 ms 159236 KB Output is correct
9 Correct 153 ms 159328 KB Output is correct
10 Correct 119 ms 159200 KB Output is correct
11 Correct 287 ms 164892 KB Output is correct
12 Correct 264 ms 162580 KB Output is correct
13 Correct 216 ms 161480 KB Output is correct
14 Correct 233 ms 161556 KB Output is correct
15 Correct 229 ms 159260 KB Output is correct
16 Correct 204 ms 159308 KB Output is correct
17 Correct 211 ms 159324 KB Output is correct
18 Correct 307 ms 163920 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 145868 KB Output is correct
2 Correct 64 ms 145948 KB Output is correct
3 Correct 68 ms 145912 KB Output is correct
4 Correct 67 ms 145976 KB Output is correct
5 Correct 62 ms 145944 KB Output is correct
6 Correct 63 ms 145940 KB Output is correct
7 Correct 66 ms 145936 KB Output is correct
8 Correct 72 ms 145964 KB Output is correct
9 Correct 62 ms 145984 KB Output is correct
10 Correct 66 ms 145996 KB Output is correct
11 Correct 63 ms 145992 KB Output is correct
12 Correct 69 ms 146000 KB Output is correct
13 Correct 64 ms 145888 KB Output is correct
14 Correct 64 ms 146008 KB Output is correct
15 Correct 74 ms 145860 KB Output is correct
16 Correct 66 ms 145868 KB Output is correct
17 Correct 67 ms 145960 KB Output is correct
18 Correct 64 ms 145928 KB Output is correct
19 Correct 65 ms 145856 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 145868 KB Output is correct
2 Correct 64 ms 145948 KB Output is correct
3 Correct 68 ms 145912 KB Output is correct
4 Correct 67 ms 145976 KB Output is correct
5 Correct 62 ms 145944 KB Output is correct
6 Correct 63 ms 145940 KB Output is correct
7 Correct 66 ms 145936 KB Output is correct
8 Correct 72 ms 145964 KB Output is correct
9 Correct 62 ms 145984 KB Output is correct
10 Correct 66 ms 145996 KB Output is correct
11 Correct 63 ms 145992 KB Output is correct
12 Correct 69 ms 146000 KB Output is correct
13 Correct 64 ms 145888 KB Output is correct
14 Correct 64 ms 146008 KB Output is correct
15 Correct 74 ms 145860 KB Output is correct
16 Correct 66 ms 145868 KB Output is correct
17 Correct 67 ms 145960 KB Output is correct
18 Correct 64 ms 145928 KB Output is correct
19 Correct 65 ms 145856 KB Output is correct
20 Correct 113 ms 152300 KB Output is correct
21 Correct 104 ms 152136 KB Output is correct
22 Correct 132 ms 161108 KB Output is correct
23 Correct 119 ms 161124 KB Output is correct
24 Correct 145 ms 163752 KB Output is correct
25 Correct 131 ms 163192 KB Output is correct
26 Correct 124 ms 162480 KB Output is correct
27 Correct 123 ms 161696 KB Output is correct
28 Correct 149 ms 163676 KB Output is correct
29 Correct 130 ms 163104 KB Output is correct
30 Correct 122 ms 162380 KB Output is correct
31 Correct 108 ms 161536 KB Output is correct
32 Correct 148 ms 163720 KB Output is correct
33 Correct 133 ms 157616 KB Output is correct
34 Correct 112 ms 152656 KB Output is correct
35 Correct 149 ms 163928 KB Output is correct
36 Correct 134 ms 157656 KB Output is correct
37 Correct 106 ms 152888 KB Output is correct

Subtask #4
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 175 ms 159224 KB Output is correct
2 Correct 165 ms 159308 KB Output is correct
3 Correct 182 ms 160444 KB Output is correct
4 Correct 204 ms 160592 KB Output is correct
5 Correct 235 ms 161432 KB Output is correct
6 Correct 173 ms 159436 KB Output is correct
7 Correct 154 ms 159320 KB Output is correct
8 Correct 138 ms 159236 KB Output is correct
9 Correct 153 ms 159328 KB Output is correct
10 Correct 119 ms 159200 KB Output is correct
11 Correct 287 ms 164892 KB Output is correct
12 Correct 264 ms 162580 KB Output is correct
13 Correct 216 ms 161480 KB Output is correct
14 Correct 233 ms 161556 KB Output is correct
15 Correct 229 ms 159260 KB Output is correct
16 Correct 204 ms 159308 KB Output is correct
17 Correct 211 ms 159324 KB Output is correct
18 Correct 307 ms 163920 KB Output is correct
19 Correct 62 ms 145868 KB Output is correct
20 Correct 64 ms 145948 KB Output is correct
21 Correct 68 ms 145912 KB Output is correct
22 Correct 67 ms 145976 KB Output is correct
23 Correct 62 ms 145944 KB Output is correct
24 Correct 63 ms 145940 KB Output is correct
25 Correct 66 ms 145936 KB Output is correct
26 Correct 72 ms 145964 KB Output is correct
27 Correct 62 ms 145984 KB Output is correct
28 Correct 66 ms 145996 KB Output is correct
29 Correct 63 ms 145992 KB Output is correct
30 Correct 69 ms 146000 KB Output is correct
31 Correct 64 ms 145888 KB Output is correct
32 Correct 64 ms 146008 KB Output is correct
33 Correct 74 ms 145860 KB Output is correct
34 Correct 66 ms 145868 KB Output is correct
35 Correct 67 ms 145960 KB Output is correct
36 Correct 64 ms 145928 KB Output is correct
37 Correct 65 ms 145856 KB Output is correct
38 Correct 113 ms 152300 KB Output is correct
39 Correct 104 ms 152136 KB Output is correct
40 Correct 132 ms 161108 KB Output is correct
41 Correct 119 ms 161124 KB Output is correct
42 Correct 145 ms 163752 KB Output is correct
43 Correct 131 ms 163192 KB Output is correct
44 Correct 124 ms 162480 KB Output is correct
45 Correct 123 ms 161696 KB Output is correct
46 Correct 149 ms 163676 KB Output is correct
47 Correct 130 ms 163104 KB Output is correct
48 Correct 122 ms 162380 KB Output is correct
49 Correct 108 ms 161536 KB Output is correct
50 Correct 148 ms 163720 KB Output is correct
51 Correct 133 ms 157616 KB Output is correct
52 Correct 112 ms 152656 KB Output is correct
53 Correct 149 ms 163928 KB Output is correct
54 Correct 134 ms 157656 KB Output is correct
55 Correct 106 ms 152888 KB Output is correct
56 Correct 2005 ms 311056 KB Output is correct
57 Runtime error 2248 ms 524288 KB Execution killed with signal 11
58 Halted 0 ms 0 KB -