# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
889265 | dimashhh | Long Mansion (JOI17_long_mansion) | C++17 | 527 ms | 262144 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;
const int N = 5e5 + 12, MOD = 998244353;
typedef long long ll;
int n,q,c[N],b[N];
vector<array<int,3>> res(N);
vector<int> a[N];
int used[N],timer = 0;
unordered_map<int,int> is[N];
vector<pair<int,int>> all;
multiset<pair<int,pair<int,int>>> cur;
vector<int> L[N],R[N];
void go(int l,int r){
if(l >= r) return;
int mid = (l + r) >> 1;
go(l,mid);
go(mid + 1,r);
timer++;
int it = mid;
for(int j:a[it]){
used[j] = timer;
}
for(int i = mid + 1;i <= r;i++){
for(int j:a[i]){
used[j] = timer;
}
while(it >= l && used[c[it - 1]] == timer){
it--;
for(int j:a[it]){
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... |