답안 #128316

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
128316 2019-07-10T16:37:43 Z zeyad49 선물상자 (IOI15_boxes) C++17
10 / 100
1473 ms 4444 KB
#include <bits/stdc++.h>
using namespace std;
const int N=1000;
const long long INF=(long)1e18;
int K,L,n;
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==n?L:INF;
		
		for(int k=l,it=1;k<=r && it<=K;k++,it++){
		    
		    ans=min(ans,2*teams[k]+dp(k+1,r));
		}
		for(int k=r,it=1;k>=l && it<=K;k--,it++){
		    ans=min(ans,2*(L-teams[k])+dp(l,k-1));
		}
		return memo[l][r]=ans;
	}
	long long delivery(int a, int b, int c, int x[]) {
		K=b;
		L=c;
		n=a;
		sort(x,x+a);
		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);
	}

Compilation message

boxes.cpp: In function 'long long int dp(int, int)':
boxes.cpp:23:21: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
   return memo[l][r]=ans;
                     ^~~
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 15 ms 4344 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1400 ms 4344 KB Output is correct
2 Correct 1473 ms 4376 KB Output is correct
3 Correct 1465 ms 4344 KB Output is correct
4 Correct 1417 ms 4444 KB Output is correct
5 Correct 1402 ms 4372 KB Output is correct
6 Correct 1398 ms 4348 KB Output is correct
7 Correct 1426 ms 4368 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 15 ms 4344 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 15 ms 4344 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 15 ms 4344 KB Output isn't correct
3 Halted 0 ms 0 KB -