# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
213582 | tmwilliamlin168 | Sweeping (JOI20_sweeping) | C++14 | 9104 ms | 2097152 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;
#define ar array
const int mxM=5e5, mxQ=1e6;
int n, m, q, no;
vector<ar<int, 3>> v;
void pr(ar<int, 2> &a, int l, int t) {
if(a[t^1]<=l&&a[t]<n-l)
a[t]=n-l;
}
struct rmq {
int n;
vector<int> st;
vector<int> rank;
int mn(int a, int b) {
if(b==-1)
return a;
return rank[a]<rank[b]?a:b;
}
void bld(vector<int> a, vector<int> rk) {
rank=rk;
n=a.size();
st=vector<int>(2*n);
for(int i=0; i<n; ++i)
st[i+n]=a[i];
for(int i=n-1; i; --i)
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... |