oj.uz

Submission #29712

# Submission time Handle Problem Language Result Execution time Memory
29712 2017-07-20T11:27:40 Z TAMREF 막대기 (KOI13_game) C++11
100 / 100
 96 ms 5928 KB 
#include <bits/stdc++.h>
using namespace std;
const int mx=100005;
typedef long long ll;
typedef pair<int,int> pii;
int coo[2][mx], comp[2][mx];
pii uaa[mx];
int L, N;
ll dp[2][mx],z,w,e;
int main(){
    scanf("%d%d",&N,&L);
    for(int i=0;i<N;i++){
        scanf("%d %d",&coo[0][i],&coo[1][i]);
        comp[0][i]=coo[0][i], comp[1][i]=coo[1][i];
    }
    sort(comp[0],comp[0]+N);
    sort(comp[1],comp[1]+N);
    int u=unique(comp[0],comp[0]+N)-comp[0], v=unique(comp[1],comp[1]+N)-comp[1];
    for(int i=0;i<N;i++){
        coo[0][i]=lower_bound(comp[0],comp[0]+u,coo[0][i])-comp[0];
        coo[1][i]=lower_bound(comp[1],comp[1]+v,coo[1][i])-comp[1];
        uaa[i]=pii(coo[0][i],coo[1][i]);
    }
    sort(uaa,uaa+N);
    for(int i=0;i<N;i++){
        e=llabs((ll)comp[0][uaa[i].first]-comp[1][uaa[i].second])+L;
        z=dp[0][uaa[i].first], w=dp[1][uaa[i].second];
        dp[0][uaa[i].first]=max(z,w+e);
        dp[1][uaa[i].second]=max(w,z+e);
    }
    printf("%lld\n",max(*max_element(dp[0],dp[0]+N),*max_element(dp[1],dp[1]+N)));
}

Compilation message

game.cpp: In function 'int main()':
game.cpp:11:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&N,&L);
                        ^
game.cpp:13:45: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d",&coo[0][i],&coo[1][i]);
                                             ^

Subtask #1
11.0 / 11.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 5928 KB Output is correct
2 Correct 36 ms 5928 KB Output is correct
3 Correct 63 ms 5928 KB Output is correct
4 Correct 63 ms 5928 KB Output is correct
5 Correct 76 ms 5928 KB Output is correct

Subtask #3
16.0 / 16.0

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

Subtask #4
22.0 / 22.0

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

Subtask #5
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5928 KB Output is correct
2 Correct 3 ms 5928 KB Output is correct
3 Correct 36 ms 5928 KB Output is correct
4 Correct 96 ms 5928 KB Output is correct
5 Correct 83 ms 5928 KB Output is correct
6 Correct 76 ms 5928 KB Output is correct
7 Correct 93 ms 5928 KB Output is correct
8 Correct 66 ms 5928 KB Output is correct
9 Correct 6 ms 5928 KB Output is correct
10 Correct 6 ms 5928 KB Output is correct
11 Correct 83 ms 5928 KB Output is correct
12 Correct 79 ms 5928 KB Output is correct