# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1059654 | NeroZein | Sličnost (COI23_slicnost) | C++17 | 3089 ms | 5720 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;
#ifdef Nero
#include "Deb.h"
#else
#define debug(...)
#endif
const int N = 1e5 + 5;
int n, k;
int ind[N];
int lazy[N * 2];
pair<int, int> seg[N * 2];
pair<int, long long> combine(pair<int, long long> x, pair<int, long long> y) {
if (x.first < y.first) swap(x, y);
if (x.first == y.first) {
x.second += y.second;
}
return x;
}
void build(int nd, int l, int r) {
if (l == r) {
seg[nd].second = 1;
return;
}
int mid = (l + r) >> 1;
# | 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... |