# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
810616 | qwerasdfzxcl | Sličnost (COI23_slicnost) | C++17 | 793 ms | 46616 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;
typedef long long ll;
struct Node{
int mx;
ll cnt;
Node(){}
Node(int _mx, ll _cnt): mx(_mx), cnt(_cnt) {}
Node operator + (const Node &N) const{
if (mx > N.mx) return *this;
if (mx < N.mx) return N;
return Node(mx, cnt + N.cnt);
}
};
struct Seg1{
Node tree[800800];
int lazy[800800];
void init(int i, int l, int r){
tree[i] = Node(0, r-l+1);
lazy[i] = 0;
if (l==r) return;
int m = (l+r)>>1;
init(i<<1, l, m); init(i<<1|1, m+1, 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... |