oj.uz

답안 #128276

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
128276 2019-07-10T15:49:52 Z zeyad49 선물상자 (IOI15_boxes) C++17
0 / 100
 2000 ms 4344 KB 
#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=L;
		int last=min(r,l+K-1);
		for(int k=l;k<=last;k++){
		    ans=min(ans,2*teams[k]+dp(k+1,r));
		}
  		last=max(l,r-K+1);
		for(int k=r;k>=last;k--){
		    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;
		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;
                     ^~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 14 ms 4344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2017 ms 4344 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 14 ms 4344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 14 ms 4344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 14 ms 4344 KB Output isn't correct
3 Halted 0 ms 0 KB -