# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
298503 | dakara2006 | 막대기 (KOI13_game) | C++98 | 5 ms | 896 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
pair <int,int> a[10005];
int main()
{
static int n,m,bmax[10005],tmax[10005],k;
scanf("%d %d",&n,&m);
for(int i=0;i<n;i++)
{
scanf("%d %d",&a[i].second,&a[i].first);
}
sort(a,a+n);
for(int i=0;i<n;i++)
{
int p=bmax[a[i].first];
bmax[a[i].first] = max(bmax[a[i].first],tmax[a[i].second]+m+abs(a[i].first-a[i].second));
tmax[a[i].second] = max(tmax[a[i].second],p+m+abs(a[i].first-a[i].second));
k=max(k,max(bmax[a[i].first],tmax[a[i].second]));
}
printf("%d",k);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |