# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
72475 | BBBSNG (#118) | Easy Data Structure Problem (FXCUP3_easy) | C++17 | 4 ms | 2916 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;
struct lr{
int l, r;
lr() {}
lr(int l, int r) : l(l), r(r) {}
};
vector <lr> V[101010];
int A[101010], I[101010];
int T[303030], L[303030], R[303030];
int Q[55], dp1[55][22], dp2[55][22];
int n, k, sz;
void query()
{
int i, j, l, x, y;
if(k == 1){
printf("%d %d\n", I[Q[1]], I[Q[1]]);
return;
}
sort(Q + 1, Q + k + 1, [&](int &ca, int &cb){
return I[ca] < I[cb];
});
for(i=1; i<=k; i++){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |