# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
835727 | Johann | Seats (IOI18_seats) | C++14 | 4072 ms | 76584 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 "seats.h"
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
int H, W;
std::vector<int> R, C;
struct segtree
{
int size;
vpii arr;
const pii NEUTRAL = {1 << 30, -(1 << 30)};
void init(vi &A)
{
size = 1;
while (size < sz(A))
size *= 2;
arr.assign(2 * size, NEUTRAL);
for (int i = 0; i < sz(A); ++i)
arr[i + size] = {A[i], A[i]};
for (int i = size - 1; i > 0; --i)
arr[i] = combine(arr[2 * i], arr[2 * i + 1]);
}
pii combine(const pii &a, const pii &b)
# | 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... |