# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
935694 | zhasyn | Boxes with souvenirs (IOI15_boxes) | C++14 | 3 ms | 440 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>
#define pb push_back
#define pf push_front
using namespace std;
#define F first
#define S second
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
#define pii pair <int, int>
#define pll pair <ll, ll>
typedef long double ld;
const ll N = 3 * 1e5 + 10, M = 5000 + 10, inf = 1e18;
const ll mod = 998244353;
ll um(ll a, ll b){
return (1LL * a * b) % mod;
}
ll subr(ll a, ll b){
return ((1LL * a - b) % mod + mod) % mod;
}
ll ans;
ll delivery(int n, int k, int l, int pos[]){
// ((n + k - 1) / k) * l
ll ans = ((n + k - 1) / k) * l, j = 0, cnt = 0, plus = 0, local = 0;
while(j <= n){
ll cnt2 = 0, plus2 = 0, local2 = 0;
for(ll i = n - 1; i >= j; i--){
cnt2++;
if(cnt2 == k){
cnt2 = plus2 = 0;
local2 += (l - pos[i]) * 2;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |