# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
707484 | MinhAnhnd | Bigger segments (IZhO19_segments) | C++14 | 207 ms | 41428 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.
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define Nmax 500001
long long N,Q,A[Nmax],S[Nmax] ={};
bool ss(tuple<long long,long long,long long> a,tuple<long long,long long,long long> b){
return get<0>(a) < get<0>(b);
}
bool operator<(pair<long long,long long> a , pair<long long,long long> b){
if(a.first == b.first) return a.second<b.second;
return a.first<b.first;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
set<pair<long long,long long>> then;
set<pair<long long,long long>> now;
set<pair<long long,long long>> past;
long long then_val = -1;
long long now_val = 0;
now.insert(make_pair(0,0));
cin>>N;
for (long long i = 1;i<=N;i++){
cin>>A[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... |