| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 770543 | parsadox2 | LIS (INOI20_lis) | C++11 | 1917 ms | 163516 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>
#define pb push_back
#define F first
#define S second
#define debug(x) cout << #x << "= " << x << ", "
#define ll long long
#define fast ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define SZ(x) (int) x.size()
#define wall cout << endl;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxn = 1e6 + 10;
int q , ar[maxn] , val[maxn] , ans , fbi[maxn];
vector <pair<int , int>> query;
set <int> st[maxn];
struct nod{
pair<int , int> mn;
int lzy;
} tree[maxn << 2];
void Build(int node = 1 , int nl = 0 , int nr = q)
{
tree[node].lzy = 0;
if(nl + 1 == nr)
{
tree[node].mn.F = ar[nl]; tree[node].mn.S = -nl;
return;
}
int mid = (nl + nr) >> 1 , lc = node << 1 , rc = lc | 1;
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||