oj.uz

답안 #674991

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
674991 2022-12-26T18:29:34 Z urosk 치료 계획 (JOI20_treatment) C++14
39 / 100
 1875 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 500005
ll n,m;
struct tupl{
    ll t,l,r,c;
} a[maxn];
ll tsz = 1,tsz2 = 1;
int ls[maxx],rs[maxx];
int 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 132 ms 41724 KB Output is correct
2 Correct 118 ms 41792 KB Output is correct
3 Correct 137 ms 42872 KB Output is correct
4 Correct 138 ms 42952 KB Output is correct
5 Correct 127 ms 43992 KB Output is correct
6 Correct 111 ms 41992 KB Output is correct
7 Correct 105 ms 41804 KB Output is correct
8 Correct 88 ms 41788 KB Output is correct
9 Correct 79 ms 41816 KB Output is correct
10 Correct 69 ms 41820 KB Output is correct
11 Correct 222 ms 47384 KB Output is correct
12 Correct 209 ms 45152 KB Output is correct
13 Correct 189 ms 44032 KB Output is correct
14 Correct 178 ms 43900 KB Output is correct
15 Correct 164 ms 41880 KB Output is correct
16 Correct 164 ms 41856 KB Output is correct
17 Correct 153 ms 41804 KB Output is correct
18 Correct 222 ms 46364 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 28500 KB Output is correct
2 Correct 14 ms 28600 KB Output is correct
3 Correct 14 ms 28500 KB Output is correct
4 Correct 16 ms 28500 KB Output is correct
5 Correct 14 ms 28500 KB Output is correct
6 Correct 15 ms 28480 KB Output is correct
7 Correct 15 ms 28604 KB Output is correct
8 Correct 13 ms 28512 KB Output is correct
9 Correct 14 ms 28500 KB Output is correct
10 Correct 13 ms 28500 KB Output is correct
11 Correct 13 ms 28476 KB Output is correct
12 Correct 14 ms 28492 KB Output is correct
13 Correct 13 ms 28500 KB Output is correct
14 Correct 18 ms 28544 KB Output is correct
15 Correct 14 ms 28500 KB Output is correct
16 Correct 13 ms 28500 KB Output is correct
17 Correct 14 ms 28524 KB Output is correct
18 Correct 15 ms 28464 KB Output is correct
19 Correct 14 ms 28544 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 28500 KB Output is correct
2 Correct 14 ms 28600 KB Output is correct
3 Correct 14 ms 28500 KB Output is correct
4 Correct 16 ms 28500 KB Output is correct
5 Correct 14 ms 28500 KB Output is correct
6 Correct 15 ms 28480 KB Output is correct
7 Correct 15 ms 28604 KB Output is correct
8 Correct 13 ms 28512 KB Output is correct
9 Correct 14 ms 28500 KB Output is correct
10 Correct 13 ms 28500 KB Output is correct
11 Correct 13 ms 28476 KB Output is correct
12 Correct 14 ms 28492 KB Output is correct
13 Correct 13 ms 28500 KB Output is correct
14 Correct 18 ms 28544 KB Output is correct
15 Correct 14 ms 28500 KB Output is correct
16 Correct 13 ms 28500 KB Output is correct
17 Correct 14 ms 28524 KB Output is correct
18 Correct 15 ms 28464 KB Output is correct
19 Correct 14 ms 28544 KB Output is correct
20 Correct 47 ms 34680 KB Output is correct
21 Correct 49 ms 34612 KB Output is correct
22 Correct 74 ms 43340 KB Output is correct
23 Correct 69 ms 43384 KB Output is correct
24 Correct 94 ms 44908 KB Output is correct
25 Correct 77 ms 44376 KB Output is correct
26 Correct 74 ms 44068 KB Output is correct
27 Correct 74 ms 43596 KB Output is correct
28 Correct 84 ms 44712 KB Output is correct
29 Correct 73 ms 44480 KB Output is correct
30 Correct 53 ms 43980 KB Output is correct
31 Correct 59 ms 43492 KB Output is correct
32 Correct 91 ms 44752 KB Output is correct
33 Correct 76 ms 39348 KB Output is correct
34 Correct 54 ms 35152 KB Output is correct
35 Correct 92 ms 44940 KB Output is correct
36 Correct 82 ms 39372 KB Output is correct
37 Correct 53 ms 35140 KB Output is correct

Subtask #4
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 132 ms 41724 KB Output is correct
2 Correct 118 ms 41792 KB Output is correct
3 Correct 137 ms 42872 KB Output is correct
4 Correct 138 ms 42952 KB Output is correct
5 Correct 127 ms 43992 KB Output is correct
6 Correct 111 ms 41992 KB Output is correct
7 Correct 105 ms 41804 KB Output is correct
8 Correct 88 ms 41788 KB Output is correct
9 Correct 79 ms 41816 KB Output is correct
10 Correct 69 ms 41820 KB Output is correct
11 Correct 222 ms 47384 KB Output is correct
12 Correct 209 ms 45152 KB Output is correct
13 Correct 189 ms 44032 KB Output is correct
14 Correct 178 ms 43900 KB Output is correct
15 Correct 164 ms 41880 KB Output is correct
16 Correct 164 ms 41856 KB Output is correct
17 Correct 153 ms 41804 KB Output is correct
18 Correct 222 ms 46364 KB Output is correct
19 Correct 14 ms 28500 KB Output is correct
20 Correct 14 ms 28600 KB Output is correct
21 Correct 14 ms 28500 KB Output is correct
22 Correct 16 ms 28500 KB Output is correct
23 Correct 14 ms 28500 KB Output is correct
24 Correct 15 ms 28480 KB Output is correct
25 Correct 15 ms 28604 KB Output is correct
26 Correct 13 ms 28512 KB Output is correct
27 Correct 14 ms 28500 KB Output is correct
28 Correct 13 ms 28500 KB Output is correct
29 Correct 13 ms 28476 KB Output is correct
30 Correct 14 ms 28492 KB Output is correct
31 Correct 13 ms 28500 KB Output is correct
32 Correct 18 ms 28544 KB Output is correct
33 Correct 14 ms 28500 KB Output is correct
34 Correct 13 ms 28500 KB Output is correct
35 Correct 14 ms 28524 KB Output is correct
36 Correct 15 ms 28464 KB Output is correct
37 Correct 14 ms 28544 KB Output is correct
38 Correct 47 ms 34680 KB Output is correct
39 Correct 49 ms 34612 KB Output is correct
40 Correct 74 ms 43340 KB Output is correct
41 Correct 69 ms 43384 KB Output is correct
42 Correct 94 ms 44908 KB Output is correct
43 Correct 77 ms 44376 KB Output is correct
44 Correct 74 ms 44068 KB Output is correct
45 Correct 74 ms 43596 KB Output is correct
46 Correct 84 ms 44712 KB Output is correct
47 Correct 73 ms 44480 KB Output is correct
48 Correct 53 ms 43980 KB Output is correct
49 Correct 59 ms 43492 KB Output is correct
50 Correct 91 ms 44752 KB Output is correct
51 Correct 76 ms 39348 KB Output is correct
52 Correct 54 ms 35152 KB Output is correct
53 Correct 92 ms 44940 KB Output is correct
54 Correct 82 ms 39372 KB Output is correct
55 Correct 53 ms 35140 KB Output is correct
56 Correct 1875 ms 192036 KB Output is correct
57 Runtime error 1836 ms 524288 KB Execution killed with signal 11
58 Halted 0 ms 0 KB -