# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
549368 | joshjms | Boxes with souvenirs (IOI15_boxes) | C++14 | 1 ms | 388 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 "boxes.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define fi first
#define se second
#define debug(x) cout << #x << " => " << x << "\n";
const int mod = 1e9 + 7;
int n, k, l, p[1000005], idx;
int le, ri;
ll dp[1000005][2];
ll ans;
ll delivery(int N, int K, int L, int P[]) {
n = N, k = K, l = L;
for(int i = 0; i < n; i++) {
if(P[i]) p[++idx] = P[i];
}
n = idx;
if(n == 0) return 0;
le = 0, ri = 0;
for(; ri <= n; ri++) {
while(ri - le > k && le < ri)
# | 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... |