# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
76580 | Xylofo | Seats (IOI18_seats) | C++14 | 3210 ms | 111440 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.
#pragma GCC target("avx,avx2,sse,sse2")
#pragma GCC optimize("Ofast")
#include "seats.h"
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i = a; i < b; ++i)
struct T {
int mn;
int cnt;
static T mrg(T a, T b){
int mn = min(a.mn, b.mn);
int cnt = (a.mn == mn ? a.cnt : 0) + (b.mn == mn ? b.cnt : 0);
return T{mn,cnt};
}
static T small() { return T{2123123, 0}; }
static T def() { return T{0, 1}; }
};
#define cc(x) complex<int>(x.mn, x.cnt)
struct ST {
int n;
vector<T> v;
vector<int> delta;
void init(int m) {
n = 1;
while(n < m) n *= 2;
v.resize(2*n, T::small());
delta.resize(2*n, 0);
rep(i,0,m) v[i+n] = T::def();
# | 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... |