# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
624691 | moonrabbit2 | Seats (IOI18_seats) | C++17 | 1452 ms | 109504 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>
#define fi first
#define se second
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using tii=tuple<int,int,int>;
const int N=1e6+5;
int h,w,r[N],c[N],D[N];
vector<vector<int>> a;
int S[2*N];
pii pos[N],T[2*N];
pii mrg(pii A,pii B,int d){
A.fi+=d; B.fi+=d;
if(A.fi<B.fi) return A;
if(A.fi>B.fi) return B;
return pii(A.fi,A.se+B.se);
}
void init(int nd,int l,int r){
S[nd]=0;
if(l==r){
T[nd]=pii(D[l],1);
return;
}
int m=(l+r)>>1,ln=nd+1,rn=nd+2*(m-l+1);
init(ln,l,m); init(rn,m+1,r);
T[nd]=mrg(T[ln],T[rn],0);
}
void add(int nd,int l,int r,int s,int e,int v){
# | 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... |