Submission #6908

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
6908	2014-07-10 02:06:00	cki86201	막대기 (KOI13_game)	C++98	100 / 100	120 ms	8196 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<algorithm>
#include<map>
using namespace std;
typedef long long ll;
#define X first
#define Y second
typedef pair<int,int> Pi;
ll ans;
Pi stick[100010];
int n, L;
map <int, ll> M;
inline int get(Pi &a){return abs(a.X - a.Y) + L;}
int main(){
  scanf("%d%d",&n,&L);
  int i;
  for(i=0;i<n;i++)scanf("%d%d",&stick[i].X,&stick[i].Y);
  sort(stick, stick+n);
  ll now = 0;
  for(i=0;i<n;i++){
    if(i == 0 || stick[i].X != stick[i-1].X){
      ans = max(ans, now);
      now = 0;
    }
    ll tmp = now + get(stick[i]), mp = M[stick[i].Y];
    now = max(now, mp + get(stick[i]));
    ans = max(ans, M[stick[i].Y] = max(mp, tmp));
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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