Submission #44785659


Source Code Expand

#include<cstdio>
#include<cmath>
using namespace std;
#define Ed for(int i=h[x];~i;i=ne[i])
#define Ls(i,l,r) for(int i=l;i<r;++i)
#define Rs(i,l,r) for(int i=l;i>r;--i)
#define Le(i,l,r) for(int i=l;i<=r;++i)
#define Re(i,l,r) for(int i=l;i>=r;--i)
#define L(i,l) for(int i=0;i<l;++i)
#define E(i,l) for(int i=1;i<=l;++i)
#define W(t) while(t--)
#define Wh while

const int N=10010,M=29;
int n,x[N],y[N];
double f[N][M];
double dis(int a,int b,int c,int d){
    return sqrt(1.0*(c-a)*(c-a)+1.0*(d-b)*(d-b));
}
int main(){
    #ifndef ONLINE_JUDGE
    freopen("1.in","r",stdin);
    #endif
    scanf("%d",&n);
    E(i, n)scanf("%d%d",x+i,y+i);
    Le(i, 2, n){
        int lim=i-1<M?i-1:M;
        L(j, lim){
            f[i][j]=1e10;
            L(k, j+1){
                int lst=i-k-1;
                f[i][j]=min(f[i][j],f[lst][j-k]+dis(x[lst],y[lst],x[i],y[i]));
            }
        }
    }
    double ans=f[n][0],p=1;
    int lim=n-2<M?n-2:M;
    E(i, lim){
        ans=min(ans,p+f[n][i]);
        p*=2;
    }
    printf("%.8f",ans);
    return 0;
}

Submission Info

Submission Time
Task F - Shortcuts
User WUSICHENG
Language C++ 20 (gcc 12.2)
Score 500
Code Size 1100 Byte
Status AC
Exec Time 11 ms
Memory 4360 KiB

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:24:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   24 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
Main.cpp:25:17: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   25 |     E(i, n)scanf("%d%d",x+i,y+i);
      |            ~~~~~^~~~~~~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 69
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All killer_01.txt, killer_02.txt, sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt, test_45.txt, test_46.txt, test_47.txt, test_48.txt, test_49.txt, test_50.txt, test_51.txt, test_52.txt, test_53.txt, test_54.txt, test_55.txt, test_56.txt, test_57.txt, test_58.txt, test_59.txt, test_60.txt, test_61.txt, test_62.txt, test_63.txt, test_64.txt
Case Name Status Exec Time Memory
killer_01.txt AC 2 ms 2320 KiB
killer_02.txt AC 7 ms 3560 KiB
sample_01.txt AC 0 ms 1952 KiB
sample_02.txt AC 0 ms 1976 KiB
sample_03.txt AC 0 ms 2000 KiB
test_01.txt AC 0 ms 2004 KiB
test_02.txt AC 0 ms 1952 KiB
test_03.txt AC 2 ms 2348 KiB
test_04.txt AC 1 ms 2116 KiB
test_05.txt AC 0 ms 1992 KiB
test_06.txt AC 10 ms 4240 KiB
test_07.txt AC 11 ms 4232 KiB
test_08.txt AC 8 ms 3628 KiB
test_09.txt AC 6 ms 3256 KiB
test_10.txt AC 1 ms 2048 KiB
test_11.txt AC 11 ms 4328 KiB
test_12.txt AC 10 ms 4360 KiB
test_13.txt AC 11 ms 4332 KiB
test_14.txt AC 11 ms 4220 KiB
test_15.txt AC 10 ms 4228 KiB
test_16.txt AC 10 ms 4308 KiB
test_17.txt AC 11 ms 4328 KiB
test_18.txt AC 10 ms 4224 KiB
test_19.txt AC 1 ms 2000 KiB
test_20.txt AC 5 ms 3052 KiB
test_21.txt AC 4 ms 2876 KiB
test_22.txt AC 3 ms 2344 KiB
test_23.txt AC 4 ms 2800 KiB
test_24.txt AC 5 ms 2932 KiB
test_25.txt AC 8 ms 3748 KiB
test_26.txt AC 3 ms 2648 KiB
test_27.txt AC 6 ms 3256 KiB
test_28.txt AC 11 ms 4288 KiB
test_29.txt AC 8 ms 3736 KiB
test_30.txt AC 10 ms 3988 KiB
test_31.txt AC 6 ms 3036 KiB
test_32.txt AC 6 ms 3196 KiB
test_33.txt AC 1 ms 2160 KiB
test_34.txt AC 2 ms 2240 KiB
test_35.txt AC 7 ms 3564 KiB
test_36.txt AC 7 ms 3352 KiB
test_37.txt AC 5 ms 3004 KiB
test_38.txt AC 4 ms 2836 KiB
test_39.txt AC 11 ms 4228 KiB
test_40.txt AC 11 ms 4228 KiB
test_41.txt AC 11 ms 4232 KiB
test_42.txt AC 11 ms 4300 KiB
test_43.txt AC 11 ms 4232 KiB
test_44.txt AC 11 ms 4296 KiB
test_45.txt AC 11 ms 4228 KiB
test_46.txt AC 11 ms 4304 KiB
test_47.txt AC 11 ms 4336 KiB
test_48.txt AC 11 ms 4288 KiB
test_49.txt AC 11 ms 4232 KiB
test_50.txt AC 11 ms 4300 KiB
test_51.txt AC 11 ms 4340 KiB
test_52.txt AC 11 ms 4296 KiB
test_53.txt AC 11 ms 4336 KiB
test_54.txt AC 11 ms 4332 KiB
test_55.txt AC 11 ms 4224 KiB
test_56.txt AC 11 ms 4320 KiB
test_57.txt AC 11 ms 4236 KiB
test_58.txt AC 11 ms 4228 KiB
test_59.txt AC 11 ms 4332 KiB
test_60.txt AC 11 ms 4232 KiB
test_61.txt AC 11 ms 4232 KiB
test_62.txt AC 11 ms 4340 KiB
test_63.txt AC 11 ms 4300 KiB
test_64.txt AC 11 ms 4224 KiB