# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
201033 | HellAngel | Just Long Neckties (JOI20_ho_t1) | C++14 | 193 ms | 7544 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;
const int maxn = 200007;
int n, b[maxn], IT[4 * maxn], ans[maxn];
pair<int, int> a[maxn];
void Update(int id, int l, int r, int pos, int val)
{
if(l == r)
{
IT[id] = val;
return;
}
int mid = l + r >> 1;
if(pos <= mid) Update(id * 2, l, mid, pos, val);
else Update(id * 2 + 1, mid + 1, r, pos, val);
IT[id] = max(IT[id * 2], IT[id * 2 + 1]);
}
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
if(fopen("test.inp", "r")) freopen("test.inp", "r", stdin);
cin >> n;
for(int i = 1; i <= n + 1; i++)
{
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |