# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1005594 | vjudge1 | Street Lamps (APIO19_street_lamps) | C++17 | 2123 ms | 143888 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>
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define plx pair<ll,int>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vl vector<ll>
using namespace std;
const int mxn=3e5+5;
int a[mxn],b[mxn],ans[mxn],n;
bool vis[mxn]{0};
vector<pii>qr[mxn];
multiset<int>ms,ms2;
vector<int>bit[mxn];
vector<int>bval[mxn];
vector<int>val[mxn];
void build(){
for(int i=1;i<=n;i++){
if(val[i].empty())continue;
sort(val[i].begin(),val[i].end());
for(auto it : val[i]){
for(int j=i;j<=n;j+=j&-j){
bval[j].pb(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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |