# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
75193 | tmwilliamlin168 | Meetings (IOI18_meetings) | C++14 | 1049 ms | 234332 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 "meetings.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mxN=1e5;
int n, q, b[mxN], c[mxN+1], st[1<<18];
ll c1[5000][5000], c2[5000][5000];
vector<int> a;
void bld(int i=1, int l2=0, int r2=n-1) {
if(l2==r2)
st[i]=c[l2+1]-l2-1;
else {
int m2=(l2+r2)/2;
bld(2*i, l2, m2);
bld(2*i+1, m2+1, r2);
st[i]=max(st[2*i], st[2*i+1]);
}
}
ll qry(int l1, int r1, int i=1, int l2=0, int r2=n-1) {
l1=max(l2, l1);
r1=min(r2, r1);
if(l1>r1)
return 0;
if(l1<=l2&&r2<=r1)
return st[i];
int m2=(l2+r2)/2;
# | 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... |