| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 118291 | 2019-06-18T15:12:26 Z | JustasZ | Boxes with souvenirs (IOI15_boxes) | C++14 | 2 ms | 384 KB |
#include "boxes.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) (int)a.size()
#define x first
#define y second
#define debug(...) cout << "[" << #__VA_ARGS__ << ": " << __VA_ARGS__ << "]\n"
#define rd() abs((int)rng())
using namespace std;
using namespace __gnu_pbds;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
typedef pair<int, int>pii;
const int maxn = 1e5 + 100;
const int mod = 1e9 + 7;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll delivery(int n, int k, int l, int pos[])
{
if(k == 1)
{
ll ans = 0;
for(int i = 0; i < n; i++)
ans += 2 * min(pos[i], l - pos[i]);
return ans;
}
}
Compilation message
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 2 ms | 256 KB | Output is correct |
| 2 | Correct | 2 ms | 384 KB | Output is correct |
| 3 | Correct | 2 ms | 256 KB | Output is correct |
| 4 | Correct | 2 ms | 384 KB | Output is correct |
| 5 | Correct | 2 ms | 384 KB | Output is correct |
| 6 | Correct | 2 ms | 384 KB | Output is correct |
| 7 | Correct | 2 ms | 384 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 2 ms | 384 KB | Output isn't correct |
| 2 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Incorrect | 2 ms | 384 KB | Output isn't correct |
| 2 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 2 ms | 256 KB | Output is correct |
| 2 | Correct | 2 ms | 384 KB | Output is correct |
| 3 | Correct | 2 ms | 256 KB | Output is correct |
| 4 | Correct | 2 ms | 384 KB | Output is correct |
| 5 | Correct | 2 ms | 384 KB | Output is correct |
| 6 | Correct | 2 ms | 384 KB | Output is correct |
| 7 | Correct | 2 ms | 384 KB | Output is correct |
| 8 | Incorrect | 2 ms | 384 KB | Output isn't correct |
| 9 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 2 ms | 256 KB | Output is correct |
| 2 | Correct | 2 ms | 384 KB | Output is correct |
| 3 | Correct | 2 ms | 256 KB | Output is correct |
| 4 | Correct | 2 ms | 384 KB | Output is correct |
| 5 | Correct | 2 ms | 384 KB | Output is correct |
| 6 | Correct | 2 ms | 384 KB | Output is correct |
| 7 | Correct | 2 ms | 384 KB | Output is correct |
| 8 | Incorrect | 2 ms | 384 KB | Output isn't correct |
| 9 | Halted | 0 ms | 0 KB | - |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 2 ms | 256 KB | Output is correct |
| 2 | Correct | 2 ms | 384 KB | Output is correct |
| 3 | Correct | 2 ms | 256 KB | Output is correct |
| 4 | Correct | 2 ms | 384 KB | Output is correct |
| 5 | Correct | 2 ms | 384 KB | Output is correct |
| 6 | Correct | 2 ms | 384 KB | Output is correct |
| 7 | Correct | 2 ms | 384 KB | Output is correct |
| 8 | Incorrect | 2 ms | 384 KB | Output isn't correct |
| 9 | Halted | 0 ms | 0 KB | - |