# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
154162 | youssefbou62 | Teams (IOI15_teams) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
#define all(v) v.begin(),v.end()
#define allarr(a) a , a + n
#define ll long long
#define ull unsigned long long
#define pb push_back
#define fastio ios_base::sync_with_stdio(false) ; cin.tie(NULL); cout.tie(NULL)
typedef pair<int, int> pi;
typedef pair<ll,ll> pll;
typedef pair<int,pi> trp ;
typedef vector<pi> vpi;
typedef vector<pll> vpll ;
// int ab (int x ) { return (x>0?x:-x);
ll delivery(int N , int K , int L,int positions[]){
ll l = L;
int cur = 0 ,s=0;
int k = K ;
for(int i = 0 ; i< N ; i++ ){
s += min(abs(positions[i]-cur),L-abs(positions[i]-cur));
// cout << s << endl;
cur = positions[i] ;
k--;
if( k == 0 ){
s += min(cur,L-cur);
k = K ;
cur = 0 ;
}
}
if( k )s += min(cur,L-cur);
return s;
}
// int main(){
// int p[]={1,2,5};
// cout << delivery(3,2,8,p);
// }