Submission #7416

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
7416	2014-08-05 04:54:54	gs13068	막대기 (KOI13_game)	C++98	100 / 100	164 ms	8856 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<cstdio>
#include<algorithm>
#include<map>
std::map<int,long long> u,d;
std::pair<int,int> a[100000];
int main()
{
  long long r=0;
  long long uv,dv;
  int i,n,m;
  scanf("%d%d",&n,&m);
  for(i=0;i<n;i++)scanf("%d%d",&a[i].first,&a[i].second);
  std::sort(a,a+n);
  for(i=0;i<n;i++)
  {
    if(u.find(a[i].first)==u.end())uv=0;
    else uv=u[a[i].first];
    if(d.find(a[i].second)==d.end())dv=0;
    else dv=d[a[i].second];
    uv+=std::abs(a[i].first-a[i].second)+m;
    dv+=std::abs(a[i].first-a[i].second)+m;
    if(u.find(a[i].first)==u.end()||u[a[i].first]<dv)u[a[i].first]=dv;
    if(d.find(a[i].second)==d.end()||d[a[i].second]<uv)d[a[i].second]=uv;
    r=std::max(r,std::max(uv,dv));
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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