Submission #8020

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
8020	2014-08-27 06:05:09	jhs7jhs	막대기 (KOI13_game)	C++98	100 / 100	60 ms	5108 KiB

game

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
pair<int,int> a[100000];
vector<int> r;
int n,l;
long long rmax[100000]={0},dp[100000][2]={0},ans=0;
int main()
{
  int i,p;
  long long t;
  scanf("%d%d",&n,&l);
  for(i=0;i<n;i++){
    scanf("%d%d",&a[i].first,&a[i].second);
    r.push_back(a[i].second);
  }
  sort(r.begin(),r.end());
  sort(a,a+n);
  for(i=0;i<n;i++){
    if(i==0 || a[i].first!=a[i-1].first) t=0;
    dp[i][1] = t + (long long)(l + abs(a[i].first-a[i].second));
    p = lower_bound(r.begin(),r.end(),a[i].second) - r.begin();
    dp[i][0] = rmax[p] + (long long)(l + abs(a[i].first-a[i].second));
    if(rmax[p] < dp[i][1]) rmax[p] = dp[i][1];
    if(t<dp[i][0]) t=dp[i][0];
    if(ans < dp[i][0]) ans = dp[i][0];
    if(ans < dp[i][1]) ans = dp[i][1];
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 11 / 11
• Subtask 2: 13 / 13
• Subtask 3: 16 / 16
• Subtask 4: 22 / 22
• Subtask 5: 38 / 38