# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
635831 | S2speed | LIS (INOI20_lis) | C++17 | 624 ms | 74344 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;
#pragma GCC optimize ("Ofast")
#define all(x) x.begin() , x.end()
#define sze(x) (ll)(x.size())
typedef long long ll;
const ll maxn = 1e6 + 17 , maxa = 1.5e3 , inf = 2e16;
struct segtree {
ll sz = 1;
vector<ll> val;
void build(ll x , ll lx , ll rx){
if(rx - lx == 1){
val[x] = 1;
return;
}
ll m = (rx + lx) >> 1 , ln = (x << 1) + 1 , rn = ln + 1;
build(ln , lx , m); build(rn , m , rx);
val[x] = val[ln] + val[rn];
return;
}
void build(){
build(0 , 0 , sz);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |