oj.uz

Submission #216318

# Submission time Handle Problem Language Result Execution time Memory
216318 2020-03-27T05:13:05 Z model_code Treatment Project (JOI20_treatment) C++17
100 / 100
 241 ms 34136 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define SIZE 1024*128
#define INF 1000000001
#define INFL 1000000000000000LL
struct T{
    int x,y,i;
    bool operator<(const T&q)const{
        if(x!=q.x)return x<q.x;
        if(y!=q.y)return y<q.y;
        return i<q.i;        
    }
};
struct segtree{
    vector<pair<int,int>>seg[SIZE*2];
    int sz,cx[SIZE],pt[SIZE*2];
    void init(int n){
        sz=1;
        while(sz<n)sz*=2;
        for(int i=0;i<sz*2;i++)seg[i].clear();
        for(int i=0;i<sz;i++)cx[i]=INF;
        for(int i=0;i<sz*2;i++)pt[i]=0;
    }
    void put(vector<T>q){
        for(int i=0;i<q.size();i++){
            cx[i]=q[i].x;
            seg[i+sz-1].push_back(pair<int,int>(q[i].y,q[i].i));
        }       
    }
    void build(int l,int r,int k){
        if(l==r)return;
        build(l,(l+r-1)/2,k*2+1);
        build((l+r+1)/2,r,k*2+2);
        seg[k].resize(seg[k*2+1].size()+seg[k*2+2].size());
        merge(seg[k*2+1].begin(),seg[k*2+1].end(),seg[k*2+2].begin(),seg[k*2+2].end(),seg[k].begin());
    }
    void query(int x,int y,int l,int r,int k,vector<int>&res){
        if(cx[r]<=x){
            while(pt[k]<seg[k].size()&&seg[k][pt[k]].first<=y){
                res.push_back(seg[k][pt[k]].second);
                pt[k]++;
            }
            return;
        }
        if(x<cx[l])return;
        query(x,y,l,(l+r-1)/2,k*2+1,res);
        query(x,y,(l+r+1)/2,r,k*2+2,res);
    }
};
int main(void){
    int n,m;
    ll ans=INFL;
    scanf("%d%d",&n,&m);
    vector<int>t(m),l(m),r(m);
    vector<ll>c(m),d(m);
    vector<T>p(m);
    vector<bool>pushed(m);
    static segtree seg;
    seg.init(m);
    for(int i=0;i<m;i++){
        scanf("%d%d%d%lld",&t[i],&l[i],&r[i],&c[i]);
        p[i]=(T{l[i]-t[i],l[i]+t[i],i});
    }
    sort(p.begin(),p.end());
    seg.put(p);
    seg.build(0,seg.sz-1,0);
    priority_queue<pair<ll,int>,vector<pair<ll,int> >,greater<pair<ll,int> > >dik;
    for(int i=0;i<m;i++){
        pushed[i]=false;
        d[i]=INFL;
        if(l[i]==1){
            d[i]=c[i];
            dik.push(pair<ll,int>(c[i],i));
            pushed[i]=true;
        }
    }
    while(!dik.empty()){
        int v=dik.top().second;
        ll dis=dik.top().first;
        dik.pop();
        vector<int>lis;
        lis.clear();
        seg.query(r[v]+1-t[v],r[v]+1+t[v],0,seg.sz-1,0,lis);
        for(int i=0;i<lis.size();i++){
            int u=lis[i];
            if(!pushed[u]){
                d[u]=dis+c[u];
                dik.push(pair<ll,int>(d[u],u));
                pushed[u]=true;
            }
        }
    }
    for(int i=0;i<m;i++){
        if(r[i]==n)ans=min(ans,d[i]);
    }
    if(ans==INFL)printf("-1\n");
    else printf("%lld\n",ans);
}

Compilation message

treatment.cpp: In member function 'void segtree::put(std::vector<T>)':
treatment.cpp:26:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=0;i<q.size();i++){
                     ~^~~~~~~~~
treatment.cpp: In member function 'void segtree::query(int, int, int, int, int, std::vector<int>&)':
treatment.cpp:40:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while(pt[k]<seg[k].size()&&seg[k][pt[k]].first<=y){
                   ~~~~~^~~~~~~~~~~~~~
treatment.cpp: In function 'int main()':
treatment.cpp:85:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=0;i<lis.size();i++){
                     ~^~~~~~~~~~~
treatment.cpp:54:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&m);
     ~~~~~^~~~~~~~~~~~~~
treatment.cpp:62:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d%lld",&t[i],&l[i],&r[i],&c[i]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 146 ms 30436 KB Output is correct
2 Correct 133 ms 30156 KB Output is correct
3 Correct 147 ms 31568 KB Output is correct
4 Correct 150 ms 31204 KB Output is correct
5 Correct 150 ms 33480 KB Output is correct
6 Correct 140 ms 30816 KB Output is correct
7 Correct 174 ms 30788 KB Output is correct
8 Correct 109 ms 30028 KB Output is correct
9 Correct 102 ms 29924 KB Output is correct
10 Correct 103 ms 29908 KB Output is correct
11 Correct 173 ms 33372 KB Output is correct
12 Correct 205 ms 33756 KB Output is correct
13 Correct 199 ms 33064 KB Output is correct
14 Correct 207 ms 33120 KB Output is correct
15 Correct 179 ms 30808 KB Output is correct
16 Correct 172 ms 30700 KB Output is correct
17 Correct 163 ms 30808 KB Output is correct
18 Correct 174 ms 33352 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 6528 KB Output is correct
2 Correct 10 ms 6528 KB Output is correct
3 Correct 8 ms 6528 KB Output is correct
4 Correct 10 ms 6528 KB Output is correct
5 Correct 8 ms 6528 KB Output is correct
6 Correct 8 ms 6528 KB Output is correct
7 Correct 9 ms 6528 KB Output is correct
8 Correct 9 ms 6528 KB Output is correct
9 Correct 8 ms 6528 KB Output is correct
10 Correct 8 ms 6528 KB Output is correct
11 Correct 9 ms 6528 KB Output is correct
12 Correct 10 ms 6528 KB Output is correct
13 Correct 9 ms 6528 KB Output is correct
14 Correct 9 ms 6528 KB Output is correct
15 Correct 10 ms 6528 KB Output is correct
16 Correct 8 ms 6528 KB Output is correct
17 Correct 8 ms 6528 KB Output is correct
18 Correct 8 ms 6528 KB Output is correct
19 Correct 8 ms 6528 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 6528 KB Output is correct
2 Correct 10 ms 6528 KB Output is correct
3 Correct 8 ms 6528 KB Output is correct
4 Correct 10 ms 6528 KB Output is correct
5 Correct 8 ms 6528 KB Output is correct
6 Correct 8 ms 6528 KB Output is correct
7 Correct 9 ms 6528 KB Output is correct
8 Correct 9 ms 6528 KB Output is correct
9 Correct 8 ms 6528 KB Output is correct
10 Correct 8 ms 6528 KB Output is correct
11 Correct 9 ms 6528 KB Output is correct
12 Correct 10 ms 6528 KB Output is correct
13 Correct 9 ms 6528 KB Output is correct
14 Correct 9 ms 6528 KB Output is correct
15 Correct 10 ms 6528 KB Output is correct
16 Correct 8 ms 6528 KB Output is correct
17 Correct 8 ms 6528 KB Output is correct
18 Correct 8 ms 6528 KB Output is correct
19 Correct 8 ms 6528 KB Output is correct
20 Correct 14 ms 7680 KB Output is correct
21 Correct 14 ms 7552 KB Output is correct
22 Correct 21 ms 7552 KB Output is correct
23 Correct 14 ms 7552 KB Output is correct
24 Correct 16 ms 7680 KB Output is correct
25 Correct 20 ms 7552 KB Output is correct
26 Correct 15 ms 7552 KB Output is correct
27 Correct 15 ms 7608 KB Output is correct
28 Correct 15 ms 7680 KB Output is correct
29 Correct 16 ms 7552 KB Output is correct
30 Correct 13 ms 7552 KB Output is correct
31 Correct 14 ms 7552 KB Output is correct
32 Correct 20 ms 7788 KB Output is correct
33 Correct 16 ms 7808 KB Output is correct
34 Correct 15 ms 7552 KB Output is correct
35 Correct 15 ms 7808 KB Output is correct
36 Correct 15 ms 7808 KB Output is correct
37 Correct 14 ms 7552 KB Output is correct

Subtask #4
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 146 ms 30436 KB Output is correct
2 Correct 133 ms 30156 KB Output is correct
3 Correct 147 ms 31568 KB Output is correct
4 Correct 150 ms 31204 KB Output is correct
5 Correct 150 ms 33480 KB Output is correct
6 Correct 140 ms 30816 KB Output is correct
7 Correct 174 ms 30788 KB Output is correct
8 Correct 109 ms 30028 KB Output is correct
9 Correct 102 ms 29924 KB Output is correct
10 Correct 103 ms 29908 KB Output is correct
11 Correct 173 ms 33372 KB Output is correct
12 Correct 205 ms 33756 KB Output is correct
13 Correct 199 ms 33064 KB Output is correct
14 Correct 207 ms 33120 KB Output is correct
15 Correct 179 ms 30808 KB Output is correct
16 Correct 172 ms 30700 KB Output is correct
17 Correct 163 ms 30808 KB Output is correct
18 Correct 174 ms 33352 KB Output is correct
19 Correct 8 ms 6528 KB Output is correct
20 Correct 10 ms 6528 KB Output is correct
21 Correct 8 ms 6528 KB Output is correct
22 Correct 10 ms 6528 KB Output is correct
23 Correct 8 ms 6528 KB Output is correct
24 Correct 8 ms 6528 KB Output is correct
25 Correct 9 ms 6528 KB Output is correct
26 Correct 9 ms 6528 KB Output is correct
27 Correct 8 ms 6528 KB Output is correct
28 Correct 8 ms 6528 KB Output is correct
29 Correct 9 ms 6528 KB Output is correct
30 Correct 10 ms 6528 KB Output is correct
31 Correct 9 ms 6528 KB Output is correct
32 Correct 9 ms 6528 KB Output is correct
33 Correct 10 ms 6528 KB Output is correct
34 Correct 8 ms 6528 KB Output is correct
35 Correct 8 ms 6528 KB Output is correct
36 Correct 8 ms 6528 KB Output is correct
37 Correct 8 ms 6528 KB Output is correct
38 Correct 14 ms 7680 KB Output is correct
39 Correct 14 ms 7552 KB Output is correct
40 Correct 21 ms 7552 KB Output is correct
41 Correct 14 ms 7552 KB Output is correct
42 Correct 16 ms 7680 KB Output is correct
43 Correct 20 ms 7552 KB Output is correct
44 Correct 15 ms 7552 KB Output is correct
45 Correct 15 ms 7608 KB Output is correct
46 Correct 15 ms 7680 KB Output is correct
47 Correct 16 ms 7552 KB Output is correct
48 Correct 13 ms 7552 KB Output is correct
49 Correct 14 ms 7552 KB Output is correct
50 Correct 20 ms 7788 KB Output is correct
51 Correct 16 ms 7808 KB Output is correct
52 Correct 15 ms 7552 KB Output is correct
53 Correct 15 ms 7808 KB Output is correct
54 Correct 15 ms 7808 KB Output is correct
55 Correct 14 ms 7552 KB Output is correct
56 Correct 169 ms 31568 KB Output is correct
57 Correct 158 ms 31712 KB Output is correct
58 Correct 144 ms 30416 KB Output is correct
59 Correct 151 ms 30432 KB Output is correct
60 Correct 203 ms 30904 KB Output is correct
61 Correct 145 ms 30432 KB Output is correct
62 Correct 153 ms 31540 KB Output is correct
63 Correct 151 ms 30796 KB Output is correct
64 Correct 144 ms 31084 KB Output is correct
65 Correct 145 ms 30432 KB Output is correct
66 Correct 169 ms 29924 KB Output is correct
67 Correct 241 ms 30156 KB Output is correct
68 Correct 222 ms 30044 KB Output is correct
69 Correct 183 ms 30100 KB Output is correct
70 Correct 223 ms 30216 KB Output is correct
71 Correct 224 ms 30288 KB Output is correct
72 Correct 179 ms 30156 KB Output is correct
73 Correct 216 ms 30176 KB Output is correct
74 Correct 129 ms 29924 KB Output is correct
75 Correct 119 ms 29924 KB Output is correct
76 Correct 189 ms 33636 KB Output is correct
77 Correct 210 ms 33612 KB Output is correct
78 Correct 200 ms 33096 KB Output is correct
79 Correct 222 ms 30052 KB Output is correct
80 Correct 166 ms 30816 KB Output is correct
81 Correct 124 ms 29912 KB Output is correct
82 Correct 176 ms 30796 KB Output is correct
83 Correct 179 ms 30536 KB Output is correct
84 Correct 220 ms 30088 KB Output is correct
85 Correct 186 ms 30408 KB Output is correct
86 Correct 167 ms 30416 KB Output is correct
87 Correct 184 ms 30160 KB Output is correct
88 Correct 169 ms 30496 KB Output is correct
89 Correct 176 ms 30432 KB Output is correct
90 Correct 227 ms 33356 KB Output is correct
91 Correct 226 ms 31968 KB Output is correct
92 Correct 178 ms 30028 KB Output is correct
93 Correct 239 ms 30200 KB Output is correct
94 Correct 180 ms 30432 KB Output is correct
95 Correct 229 ms 30052 KB Output is correct
96 Correct 236 ms 33736 KB Output is correct
97 Correct 223 ms 33552 KB Output is correct
98 Correct 226 ms 33608 KB Output is correct
99 Correct 224 ms 33508 KB Output is correct
100 Correct 187 ms 33612 KB Output is correct
101 Correct 211 ms 33632 KB Output is correct
102 Correct 194 ms 34136 KB Output is correct
103 Correct 190 ms 30536 KB Output is correct