Submission #678462

#	Time	Username	Problem	Language	Result	Execution time	Memory
678462		hello_there_123	Boxes with souvenirs (IOI15_boxes)	C++17	0 / 100	0 ms	212 KiB

boxes

#include <bits/stdc++.h>
//#include "boxes.h"
using namespace std;
#define ll long long 
ll delivery(int n, int k, int l, int p[]) 
{
	ll pre[k+3],pre2[k+3];
	memset(pre,0,sizeof(pre));
	memset(pre2,0,sizeof(pre2));
	deque<ll>left,right;
	for(int i=0;i<n;i++){
		if(p[i]<=l/2) left.push_front(p[i]);
		else{
			right.push_back(l-p[i]);
		}
	}
	for(int i=0;i<left.size();i++){
		pre[(left.size()-i-1)%k]+=left[i];
	}
	for(int i=0;i<right.size();i++){
		pre2[(right.size()-i-1)%k]+=right[i];
	}
	int ans = 1e9;
	for(int i=0;i<(n+k-1)/k;i++){
		int cur = i*l;
		cur+=2*(pre[(left.size()-1)%k]+pre2[(right.size()-1)%k]);
		ans = min(ans,cur);
		for(int j=0;j<k;j++){
			if(left.empty() && right.empty()) break;
			if(left.empty()){
				pre2[(right.size()-1)%k]-=right.front();
				right.pop_front();
			}
			else if(right.empty()){
				pre[(left.size()-1)%k]-=left.front();
				left.pop_front();
			}
			else{
				if(left.front()>right.front()){
					pre[(left.size()-1)%k]-=left.front();
					left.pop_front();
				}
				else{
					pre2[(right.size()-1)%k]-=right.front();
					right.pop_front();				
				}
				
			}
			
		}
		
	}
    return ans;
}

Compilation message (stderr)

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:17:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |  for(int i=0;i<left.size();i++){
      |              ~^~~~~~~~~~~~
boxes.cpp:20:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |  for(int i=0;i<right.size();i++){
      |              ~^~~~~~~~~~~~~
boxes.cpp:26:58: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   26 |   cur+=2*(pre[(left.size()-1)%k]+pre2[(right.size()-1)%k]);
      |                                                          ^

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