# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
313040 | limabeans | Pinball (JOI14_pinball) | C++17 | 308 ms | 25964 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;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const int maxm = 1e5 + 10;
const int maxn = 1e6 + 10;
const ll inf = 1e18;
template<typename T> struct segtree {
T merge(T x, T y) {
return min(x, y);
}
int n;
vector<T> t;
void init(int n) {
n += 10;
this->n = n;
t.assign(n*4, inf);
# | 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... |