oj.uz

답안 #876284

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
876284 2023-11-21T13:42:39 Z vjudge1 치료 계획 (JOI20_treatment) C++17
0 / 100
 147 ms 43252 KB 
#include<bits/stdc++.h>
#define pb push_back
#define pli pair<ll,ll>
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
using ll=long long;
const ll maxn=2e5;
const ll inf=1e18;
const ll mod=1e9+7;
ll n,m,t[maxn],l[maxn],r[maxn],c[maxn],d[maxn];
priority_queue<pli,vector<pli>,greater<pli>>pq;
struct node
{
    ll fi,se;
    node ()
    {
        fi=inf,se=0;
    }
    node operator+(const node&o)
    {
        node ans;
        if(fi<o.fi) ans.se=se;
        else ans.se=o.se;
        ans.fi=min(fi,o.fi);
        return ans;
    }
};
struct segtree
{
    node st[4*maxn];
    void update(ll pos,ll v,ll id=1,ll l=1,ll r=m)
    {
        if(l==r)
        {
            st[id].fi=v;
            st[id].se=l;
            return;
        }
        ll mid=l+r>>1;
        if(pos<=mid) update(pos,v,id*2,l,mid);
        else update(pos,v,id*2+1,mid+1,r);
        st[id]=st[id*2]+st[id*2+1];
    }
    node get(ll i,ll j,ll id=1,ll l=1,ll r=m)
    {
        if(j<l||r<i) return node();
        if(i<=l&&r<=j) return st[id];
        ll mid=l+r>>1;
        return get(i,j,id*2,l,mid)+get(i,j,id*2+1,mid+1,r);
    }
}seg[2];
pli b[maxn];
ll pos[maxn],vv[maxn];
void solve()
{
    cin >> n >> m;
    for(int i=1;i<=m;i++)
    {
        cin >> t[i] >> l[i] >> r[i] >> c[i];
        b[i]={t[i],i};
    }
    sort(b+1,b+m+1);
    for(int i=1;i<=m;i++)
    {
        ll id=b[i].se;
        seg[0].update(i,l[id]+t[id]);
        seg[1].update(i,l[id]-t[id]);
        pos[id]=i;
        vv[i]=id;
    }
    for(int i=1;i<=m;i++)
    {
        d[i]=inf;
        if(l[i]==1)
        {
            d[i]=c[i];
            pq.push({d[i],i});
        }
    }
    while(!pq.empty())
    {
        ll u=pq.top().se;
        ll W=pq.top().fi;
        pq.pop();
        if(W>d[u]) continue;
        if(r[u]==n) {cout << W;return;}
        while(seg[0].get(pos[u]+1,n).fi<=r[u]+t[u]+1)
        {
            ll v=vv[seg[0].get(pos[u]+1,n).se];
            d[v]=d[u]+c[v];
            pq.push({d[v],v});
            seg[0].update(pos[v],inf);
            seg[1].update(pos[v],inf);
        }
        while(seg[1].get(1,pos[u]-1).fi<=r[u]-t[u]+1)
        {
            ll v=vv[seg[1].get(1,pos[u]-1).se];
            d[v]=d[u]+c[v];
            pq.push({d[v],v});
            seg[0].update(pos[v],inf);
            seg[1].update(pos[v],inf);
        }
    }
    cout << -1;
}
int main()
{
    fastio
    //freopen(TASKNAME".INP","r",stdin);
    //freopen(TASKNAME".OUT","w",stdout);
    solve();
}

Compilation message

treatment.cpp: In member function 'void segtree::update(ll, ll, ll, ll, ll)':
treatment.cpp:41:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   41 |         ll mid=l+r>>1;
      |                ~^~
treatment.cpp: In member function 'node segtree::get(ll, ll, ll, ll, ll)':
treatment.cpp:50:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   50 |         ll mid=l+r>>1;
      |                ~^~

Subtask #1
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 147 ms 42580 KB Output is correct
2 Correct 90 ms 42788 KB Output is correct
3 Incorrect 138 ms 43252 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 39260 KB Output is correct
2 Incorrect 6 ms 39372 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 39260 KB Output is correct
2 Incorrect 6 ms 39372 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 147 ms 42580 KB Output is correct
2 Correct 90 ms 42788 KB Output is correct
3 Incorrect 138 ms 43252 KB Output isn't correct
4 Halted 0 ms 0 KB -