# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
835603 | MetalPower | Sličnost (COI23_slicnost) | C++14 | 142 ms | 11932 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;
#define pii pair<int, int>
#define fi first
#define se second
#define ll long long
const int MX = 1e5 + 10;
const int INF = 1e9 + 7;
int N, K, Q, p[MX], q[MX], pos[MX];
pii merge(pii a, pii b){
if(a.fi > b.fi) return a;
if(b.fi > a.fi) return b;
return make_pair(a.fi, a.se + b.se);
}
struct node{
int l, r, lz; pii val;
node *lc, *rc;
node(int l = 0, int r = -1) : l(l), r(r), lz(0), lc(NULL), rc(NULL) {
val.fi = 0;
val.se = r - l + 1;
}
void prop(){
if(l != r){
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |