oj.uz

Submission #16236

# Submission time Handle Problem Language Result Execution time Memory
16236 2015-08-18T11:10:33 Z eaststar 막대기 (KOI13_game) C++14
100 / 100
 93 ms 4208 KB 
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
struct data{
    int t,d;
    bool operator<(const data&r)const{
        if(t==r.t)return d<r.d;
        return t<r.t;
    }
}a[100010];
int tt[100010],td[100010],tn,dn;
long long Dt[100010],Dd[100010],t,d,s,ans;
int bsearch(int s,int e,int p,int t){
    if(s==e)return s;
    int m=(s+e)/2;
    if(t&&p<=tt[m])return bsearch(s,m,p,t);
    else if(!t&&p<=td[m])return bsearch(s,m,p,t);
    else return bsearch(m+1,e,p,t);
}
int main(){
    int i,n,l,x,y;
    scanf("%d%d",&n,&l);
    for(i=0;i<n;++i){
        scanf("%d%d",&a[i].t,&a[i].d);
        tt[tn++]=a[i].t;
        td[dn++]=a[i].d;
    }
    sort(a,a+n);
    sort(tt,tt+tn);
    sort(td,td+tn);
    for(i=0;i<n;++i){
        x=bsearch(0,tn,a[i].t,1);
        y=bsearch(0,dn,a[i].d,0);
        s=(long long)l+abs(a[i].t-a[i].d);
        t=max(Dt[x],Dd[y]+s);
        d=max(Dd[y],Dt[x]+s);
        Dt[x]=t;
        Dd[y]=d;
    }
    for(i=0;i<tn;++i)ans=max(ans,Dt[i]);
    for(i=0;i<dn;++i)ans=max(ans,Dd[i]);
    printf("%lld",ans);
    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 4208 KB Output is correct
2 Correct 0 ms 4208 KB Output is correct
3 Correct 0 ms 4208 KB Output is correct
4 Correct 0 ms 4208 KB Output is correct
5 Correct 0 ms 4208 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 4208 KB Output is correct
2 Correct 32 ms 4208 KB Output is correct
3 Correct 71 ms 4208 KB Output is correct
4 Correct 64 ms 4208 KB Output is correct
5 Correct 72 ms 4208 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 4208 KB Output is correct
2 Correct 0 ms 4208 KB Output is correct
3 Correct 0 ms 4208 KB Output is correct
4 Correct 0 ms 4208 KB Output is correct
5 Correct 0 ms 4208 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 4208 KB Output is correct
2 Correct 0 ms 4208 KB Output is correct
3 Correct 0 ms 4208 KB Output is correct
4 Correct 0 ms 4208 KB Output is correct
5 Correct 0 ms 4208 KB Output is correct
6 Correct 0 ms 4208 KB Output is correct
7 Correct 0 ms 4208 KB Output is correct

Subtask #5
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 4208 KB Output is correct
2 Correct 8 ms 4208 KB Output is correct
3 Correct 46 ms 4208 KB Output is correct
4 Correct 87 ms 4208 KB Output is correct
5 Correct 83 ms 4208 KB Output is correct
6 Correct 92 ms 4208 KB Output is correct
7 Correct 93 ms 4208 KB Output is correct
8 Correct 81 ms 4208 KB Output is correct
9 Correct 8 ms 4208 KB Output is correct
10 Correct 7 ms 4208 KB Output is correct
11 Correct 91 ms 4208 KB Output is correct
12 Correct 83 ms 4208 KB Output is correct