Submission #134544

#TimeUsernameProblemLanguageResultExecution timeMemory
13454420160161simoneBoxes with souvenirs (IOI15_boxes)C++14
10 / 100
2 ms380 KiB
#include "boxes.h"
#include <bits/stdc++.h>
#define M 100000010
using namespace std;
int mi[M];
long long delivery(int N, int K, int L, int p[]) 
{
    if(K==1)
    {
    	long long ans=0;
    	for(int i=0;i<N;i++) ans+=min(abs(L-p[i]),abs(p[i]))*2;
    	return ans;
	}
	if(K==N)
	{
		int flagr=0,flagl=0;
		for(int i=0;i<N;i++)
		{
			if(abs(L-p[i])>abs(p[i])) flagr=1;
			else flagl=1;
			if(flagr==1&&flagl==1) break;
		}
		if(flagr==1&&flagl==1) return L;
		else
		{
			long long ans=0;
			for(int i=0;i<N;i++)
			{
				ans=max(ans,((long long)min(abs(L-p[i]),abs(p[i]))*2));
			}
			return ans;
		} 
	}
}

Compilation message (stderr)

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:34:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
#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...