Submission #1443359
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define MP make_pair
typedef long long ll;
const int inf=0x3f3f3f3f;
const int maxn=400+5;
int l[maxn],r[maxn];
int len[maxn];
int n;
int dp[maxn][maxn];
bool judge(pair<int ,int > a,pair<int ,int > b)
{return min(a.second,b.second)>=max(a.first,b.first);}
int myabs(int x){return x<0?-x:x;}
int main()
{
scanf("%d",&n);
int maxpos=0;
for(int i=1;i<=n;i++)
{
scanf("%d%d",&l[i],&r[i]);
len[i]=r[i]-l[i]+1;
maxpos=max(maxpos,r[i]);
}
memset(dp,inf,sizeof(dp));
int ans=inf;
dp[1][l[1]]=0;
for(int i=1;i<=maxpos;i++) dp[1][i]=myabs(l[1]-i);
/*for(int i=1;i<=maxpos;i++)
{
printf("dp[%d][%d]=%d\n",1,i,dp[1][i]);
}puts("");*/
for(int i=2;i<=n;i++)
for(int x=1;x<=maxpos;x++)
for(int y=1;y<=maxpos;y++)
if(judge(MP(y,y+len[i-1]-1),MP(x,x+len[i]-1)))
dp[i][x]=min(dp[i][x],dp[i-1][y]+myabs(l[i]-x));
/* for(int i=1;i<=n;i++)
{
for(int j=1;j<=maxpos;j++)
printf("dp[%d][%d]=%d\n",i,j,dp[i][j]);
puts("");
}*/
for(int i=1;i<=maxpos;i++) ans=min(ans,dp[n][i]);
printf("%d\n",ans);
return 0;
}
Submission Info
Submission Time
2017-07-22 16:33:33+0900
Task
E - NarrowRectangles
User
owarisunezeko
Language
C++14 (GCC 5.4.1)
Score
300
Code Size
1264 Byte
Status
RE
Exec Time
167 ms
Memory
896 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:16:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
./Main.cpp:20:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&l[i],&r[i]);
^
Judge Result
Set Name
Sample
Subtask
All
Score / Max Score
0 / 0
300 / 300
0 / 700
Status
Set Name
Test Cases
Sample
0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 0_004.txt
Subtask
0_000, 0_001, 0_004, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt
All
0_000.txt, 0_001.txt, 0_002.txt, 0_003.txt, 0_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 2_018.txt, 2_019.txt, 2_020.txt, 2_021.txt, 2_022.txt, 2_023.txt, 2_024.txt, 2_025.txt, 2_026.txt, 2_027.txt, 2_028.txt, 2_029.txt, 2_030.txt, 2_031.txt, 2_032.txt, 2_033.txt, 2_034.txt, 2_035.txt, 2_036.txt
Case Name
Status
Exec Time
Memory
0_000.txt
AC
1 ms
896 KB
0_001.txt
AC
1 ms
896 KB
0_002.txt
RE
97 ms
896 KB
0_003.txt
RE
97 ms
896 KB
0_004.txt
AC
1 ms
896 KB
1_005.txt
AC
81 ms
896 KB
1_006.txt
AC
82 ms
896 KB
1_007.txt
AC
167 ms
896 KB
1_008.txt
AC
114 ms
896 KB
1_009.txt
AC
113 ms
896 KB
1_010.txt
AC
115 ms
896 KB
1_011.txt
AC
115 ms
896 KB
1_012.txt
AC
114 ms
896 KB
1_013.txt
AC
116 ms
896 KB
1_014.txt
AC
117 ms
896 KB
1_015.txt
AC
114 ms
896 KB
1_016.txt
AC
116 ms
896 KB
1_017.txt
AC
118 ms
896 KB
2_018.txt
RE
95 ms
256 KB
2_019.txt
RE
95 ms
256 KB
2_020.txt
RE
96 ms
256 KB
2_021.txt
RE
97 ms
256 KB
2_022.txt
RE
97 ms
256 KB
2_023.txt
RE
97 ms
256 KB
2_024.txt
RE
96 ms
256 KB
2_025.txt
RE
96 ms
256 KB
2_026.txt
RE
96 ms
256 KB
2_027.txt
RE
96 ms
256 KB
2_028.txt
RE
96 ms
256 KB
2_029.txt
RE
96 ms
256 KB
2_030.txt
RE
96 ms
256 KB
2_031.txt
RE
97 ms
256 KB
2_032.txt
RE
96 ms
256 KB
2_033.txt
RE
102 ms
256 KB
2_034.txt
RE
100 ms
256 KB
2_035.txt
RE
97 ms
256 KB
2_036.txt
RE
99 ms
256 KB