| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1350243 | jump | Boxes with souvenirs (IOI15_boxes) | C++20 | 0 ms | 0 KiB |
#include "boxes.h"
#include <bits/stdc++.h>
int total(std::vector<std::pair<int,int>>& v,int K){
std::reverse(v.begin(),v.end());
int sum=0;
for(int i=0;i<v.size();i++){
int c=i+1;
while(v[i].second%K!=0){
if(c==v.size())break;
int add = K-(v[i].second%K);
if(v[c].second>add)v[c].second-=add,v[i].second+=add;
else v[i].second+=v[c].second,v[c].second=0,c+=1;
}
sum+=2*v[i].first*((v[i].second+K-1)/K);
}
return sum;
}
long long delivery(int N, int K, int L, int p[]) {
std::vector<int> pv;
std::map<int,int> mp;
std::map<int,int> mp2;
for(int i=0;i<N;i++){
if(p[i]<L/2){
pv.push_back(p[i]);
if(mp.find(p[i])==mp.end())mp[p[i]]=1;
else mp[p[i]]+=1;
}
else{
pv.push_back(p[i]);
if(mp2.find(L-p[i])==mp2.end())mp2[L-p[i]]=1;
else mp2[L-p[i]]+=1;
}
}
std::vector<std::pair<int,int>> vp1;
for(auto p:mp1){
vp1.push_back(p);
}
std::vector<std::pair<int,int>> vp2;
for(auto p:mp2){
vp2.push_back(p);
}
}
