oj.uz

Submission #54684

# Submission time Handle Problem Language Result Execution time Memory
54684 2018-07-04T14:10:48 Z gs18081 Pinball (JOI14_pinball) C++11
100 / 100
 389 ms 61936 KB 
#include <bits/stdc++.h>
#define MAX 9999999999999999LL

using namespace std;

typedef long long int ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
struct thing{
    int A,B,C,D;
};
ll ans=MAX;
int N,M;
/*
set<pl> lmap;
set<pl> rmap;
*/
ll ltree[1200000];
ll rtree[1200000];
 vector<pair<int,pi> > vect;
thing things[110000];
void init(ll *tree,int l,int r,int idx){
    tree[idx]=MAX;
    if(l==r) return ;
    int m=(l+r)>>1;
    init(tree,l,m,idx*2);
    init(tree,m+1,r,idx*2+1);
}
ll range(ll *tree,int l,int r,int idx,int s,int e){
    if(r<s||e<l) return MAX;
    if(s<=l&&r<=e) return tree[idx];
    int m=(l+r)>>1;
    return min(range(tree,l,m,idx*2,s,e),range(tree,m+1,r,idx*2+1,s,e));
}
ll update(ll *tree,int l,int r,int idx,int pos,ll val){
    if(r<pos||pos<l) return tree[idx];
    if(l==r){
        return tree[idx]=min(tree[idx],val);
    }
    int m=(l+r)>>1;
    return tree[idx]=min(update(tree,l,m,idx*2,pos,val),update(tree,m+1,r,idx*2+1,pos,val));
}
int main(){
    scanf("%d %d",&M,&N);
    for(int i=0;i<M;i++){
        scanf("%d %d %d %d",&things[i].A,&things[i].C,&things[i].B,&things[i].D);
        vect.push_back(make_pair(things[i].A,pi(i,1)));
        vect.push_back(make_pair(things[i].B,pi(i,2)));
        vect.push_back(make_pair(things[i].C,pi(i,3)));
    }
    vect.push_back(make_pair(N,pi(0,0)));
    vect.push_back(make_pair(1,pi(0,0)));
    int x=1;
    sort(vect.begin(),vect.end());
    for(int i=0;i<vect.size();){
        int j;
        for(j=i;j<vect.size()&&vect[i].first==vect[j].first;j++){
            if(vect[j].second.second==0){
                
            }
            else if(vect[j].second.second==1){
                things[vect[j].second.first].A=x;
            }
            else if(vect[j].second.second==2){
                things[vect[j].second.first].B=x;
            }
            else{
                things[vect[j].second.first].C=x;
            }
        }
        x++;
        i=j;
    }
    x--;
    init(ltree,1,x,1);
    init(rtree,1,x,1);
    update(ltree,1,x,1,1,0);
    update(rtree,1,x,1,x,0);
    for(int i=0;i<M;i++){
        ans=min(ans,range(ltree,1,x,1,things[i].A,x)+range(rtree,1,x,1,1,things[i].C)+things[i].D);
        ll val;
        val=range(ltree,1,x,1,things[i].A,x)+things[i].D;
        update(ltree,1,x,1,things[i].B,val);
        val=range(rtree,1,x,1,1,things[i].C)+things[i].D;
        update(rtree,1,x,1,things[i].B,val);
        //printf("%d %d %d %d %d\n",things[i].A,things[i].B,things[i].C,things[i].D,x);
    }
    /*
    rmap.insert(pl(x-1,0));
    lmap.insert(pl(1,0));
    set<pl>::iterator lit;
    set<pl>::iterator rit;
    set<pl>::iterator temp;
    set<pl>::iterator ttemp;
    for(int i=0;i<M;i++){
        int l=things[i].A;
        int r=things[i].C;
        int m=things[i].B;
        lit=lmap.lower_bound(pl(l,-1));
        rit=rmap.upper_bound(pl(r,-1));
        if(lit!=lmap.end()&&rit!=rmap.begin()){
            --rit;
            ans=min((*lit).second+(*rit).second+things[i].D,ans);
            rit++;
        }
        if(lit!=lmap.end()){
            ll tval=(*lit).second+things[i].D;
            temp=lmap.lower_bound(pl(m,0));
            if(temp==lmap.end()||(*temp).second>tval){
                lmap.insert(pl(m,tval));
                temp=lmap.lower_bound(pl(m,0));
                temp--;
                while(temp!=lmap.begin()&&temp->second>=tval){
                    ttemp=temp--;
                    temp++;
                    lmap.erase(temp);
                    temp=ttemp;
                }
            }
            
        }
        if(rit!=rmap.begin()){
            --rit;
            ll tval=(*rit).second+things[i].D;
            temp=rmap.upper_bound(pl(m,0));
            if(temp==rmap.begin()){
                
            }
        }
    }
     */
    if(ans==MAX) printf("-1\n");
    else printf("%lld\n",ans);
    return 0;
}

Compilation message

pinball.cpp: In function 'int main()':
pinball.cpp:55:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<vect.size();){
                 ~^~~~~~~~~~~~
pinball.cpp:57:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(j=i;j<vect.size()&&vect[i].first==vect[j].first;j++){
                 ~^~~~~~~~~~~~
pinball.cpp:44:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&M,&N);
     ~~~~~^~~~~~~~~~~~~~~
pinball.cpp:46:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d %d",&things[i].A,&things[i].C,&things[i].B,&things[i].D);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 3 ms 572 KB Output is correct
5 Correct 3 ms 576 KB Output is correct
6 Correct 2 ms 580 KB Output is correct
7 Correct 2 ms 692 KB Output is correct
8 Correct 2 ms 696 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 3 ms 572 KB Output is correct
5 Correct 3 ms 576 KB Output is correct
6 Correct 2 ms 580 KB Output is correct
7 Correct 2 ms 692 KB Output is correct
8 Correct 2 ms 696 KB Output is correct
9 Correct 2 ms 700 KB Output is correct
10 Correct 2 ms 840 KB Output is correct
11 Correct 3 ms 840 KB Output is correct
12 Correct 2 ms 840 KB Output is correct
13 Correct 3 ms 840 KB Output is correct
14 Correct 3 ms 888 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 3 ms 572 KB Output is correct
5 Correct 3 ms 576 KB Output is correct
6 Correct 2 ms 580 KB Output is correct
7 Correct 2 ms 692 KB Output is correct
8 Correct 2 ms 696 KB Output is correct
9 Correct 2 ms 700 KB Output is correct
10 Correct 2 ms 840 KB Output is correct
11 Correct 3 ms 840 KB Output is correct
12 Correct 2 ms 840 KB Output is correct
13 Correct 3 ms 840 KB Output is correct
14 Correct 3 ms 888 KB Output is correct
15 Correct 2 ms 888 KB Output is correct
16 Correct 3 ms 888 KB Output is correct
17 Correct 4 ms 1000 KB Output is correct
18 Correct 4 ms 1040 KB Output is correct
19 Correct 4 ms 1212 KB Output is correct
20 Correct 4 ms 1212 KB Output is correct
21 Correct 3 ms 1212 KB Output is correct
22 Correct 6 ms 1308 KB Output is correct
23 Correct 5 ms 1368 KB Output is correct
24 Correct 4 ms 1404 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 3 ms 572 KB Output is correct
5 Correct 3 ms 576 KB Output is correct
6 Correct 2 ms 580 KB Output is correct
7 Correct 2 ms 692 KB Output is correct
8 Correct 2 ms 696 KB Output is correct
9 Correct 2 ms 700 KB Output is correct
10 Correct 2 ms 840 KB Output is correct
11 Correct 3 ms 840 KB Output is correct
12 Correct 2 ms 840 KB Output is correct
13 Correct 3 ms 840 KB Output is correct
14 Correct 3 ms 888 KB Output is correct
15 Correct 2 ms 888 KB Output is correct
16 Correct 3 ms 888 KB Output is correct
17 Correct 4 ms 1000 KB Output is correct
18 Correct 4 ms 1040 KB Output is correct
19 Correct 4 ms 1212 KB Output is correct
20 Correct 4 ms 1212 KB Output is correct
21 Correct 3 ms 1212 KB Output is correct
22 Correct 6 ms 1308 KB Output is correct
23 Correct 5 ms 1368 KB Output is correct
24 Correct 4 ms 1404 KB Output is correct
25 Correct 22 ms 3104 KB Output is correct
26 Correct 58 ms 5816 KB Output is correct
27 Correct 178 ms 12660 KB Output is correct
28 Correct 196 ms 15988 KB Output is correct
29 Correct 157 ms 17352 KB Output is correct
30 Correct 283 ms 21840 KB Output is correct
31 Correct 389 ms 31808 KB Output is correct
32 Correct 271 ms 31808 KB Output is correct
33 Correct 43 ms 31808 KB Output is correct
34 Correct 142 ms 35656 KB Output is correct
35 Correct 291 ms 50360 KB Output is correct
36 Correct 320 ms 54192 KB Output is correct
37 Correct 300 ms 58060 KB Output is correct
38 Correct 295 ms 61936 KB Output is correct