Submission #30634

#	Time	Username	Problem	Language	Result	Execution time	Memory
30634		waleed_jubeh	선물상자 (IOI15_boxes)	C++14	0 / 100	2 ms	376 KiB

boxes

#include "boxes.h"
#include<algorithm>
#include<map>
using namespace std; 
long long delivery(int N, int K, int L, int p[]) {
	map<int,bool>visited;
	int diameter=L/2;
	long long int cost=0;
	long long int remain=0;
	for(int i=0;i<N;i++)
	{
		if(!visited[p[i]]){
		if(p[i]>diameter){
			if(abs(p[i]-cost)>L-p[i])
			
				cost+=L-p[i]+cost;
			else
				cost+=p[i]-cost;
			

		}else{
		cost+=p[i]-cost;
		}
		visited[p[i]]++;
		}
		if(i==N-1)
			if(L-p[i]<p[i])
				cost+=L-p[i];
			else
					cost+=p[i];

	}
	

		
	

    return cost;
}

Compilation message (stderr)

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:24:16: warning: use of an operand of type 'bool' in 'operator++' is deprecated [-Wdeprecated]
   visited[p[i]]++;
                ^~
boxes.cpp:26:5: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
   if(i==N-1)
     ^
boxes.cpp:9:16: warning: unused variable 'remain' [-Wunused-variable]
  long long int remain=0;
                ^~~~~~
boxes.cpp:5:31: warning: unused parameter 'K' [-Wunused-parameter]
 long long delivery(int N, int K, int L, int p[]) {
                               ^

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30