Submission #444475

#TimeUsernameProblemLanguageResultExecution timeMemory
444475KhizriBoxes with souvenirs (IOI15_boxes)C++17
10 / 100
1 ms300 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; #define ll long long #define pb push_back #define F first #define S second #define INF 1e18 #define all(v) (v).begin(),(v).end() #define rall(v) (v).rbegin(),(v).rend() #define pii pair<int,int> #define pll pair<ll,ll> #define OK cout<<"Ok"<<endl; #define MOD (ll)(1e9+7) #define endl "\n" long long delivery(int n, int k, int l, int arr[]) { ll ans=0; if(k==1){ for(int i=0;i<n;i++){ ans+=min(arr[i],l-arr[i])*2; } } return ans; if(k==n){ for(int i=0;i<n;i++){ } } }
#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...