# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1114203 | SalihSahin | Sličnost (COI23_slicnost) | C++14 | 1 ms | 336 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 int long long
using namespace std;
const int inf = 1e15 + 10;
const int N = 2048 + 10;
pair<int, int> merge(pair<int, int> a, pair<int, int> b){
if(a.first == b.first) return {a.first, a.second + b.second};
else if(a.first > b.first) return a;
else return b;
}
struct SEGT{
vector<pair<int, int> > tree;
vector<int> lazy;
void init(int n){
tree.assign(4*n, {0, 1});
lazy.assign(4*n, 0);
}
void build(int ind, int l, int r){
if(l == r){
tree[ind] = {0, 1};
}
else{
int m = (l + r)/2;
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... |