제출 #128284

#제출 시각아이디문제언어결과실행 시간메모리
128284zeyad49선물상자 (IOI15_boxes)C++17
0 / 100
2055 ms4348 KiB
#include <bits/stdc++.h> using namespace std; const int N=1000; const long long INF=(long)1e18; int K,L; int memo[N][N]; int teams[N]; long long dist[N][N]; long long dp(int l,int r) { if(l>r) return 0; if(memo[l][r]!=-1) return memo[l][r]; long long ans=K>=r-l+1?L:INF; int last; last=min(r,l+K-1); for(int k=l;k<=last;k++){ ans=min(ans,teams[k]+dp(k+1,r)+min(teams[k],L-teams[k])); } last=max(l,r-K+1); for(int k=r;k>=last;k--){ ans=min(ans,L-teams[k]+dp(l,k-1)+min(teams[k],L-teams[k])); } return memo[l][r]=ans; } long long delivery(int a, int b, int c, int x[]) { K=b; L=c; for(int i=0;i<a;i++){ teams[i]=x[i]; for(int j=0;j<a;j++) memo[i][j]=-1; } return dp(0,a-1); }

컴파일 시 표준 에러 (stderr) 메시지

boxes.cpp: In function 'long long int dp(int, int)':
boxes.cpp:24:21: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
   return memo[l][r]=ans;
                     ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...