# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
172391 | vex | K blocks (IZhO14_blocks) | C++14 | 536 ms | 43916 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 maxn 100005
#define INF (int)(1e9 + 77)
using namespace std;
int n,k;
int a[maxn];
int dp[maxn][102];
int lv[maxn];
int queries[maxn];
int ans[maxn];
int minn[maxn][22];
int niz[maxn];
stack<int>mss;
int p[maxn];
int par(int v)
{
if(v==p[v])return v;
return p[v] = par(p[v]);
}
void build(int ind)
{
for(int i=0;i<=n;i++)
{
p[i] = -1;
niz[i] = dp[i][ind];
}
# | 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... |