# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1049940 | vjudge1 | Art Exhibition (JOI18_art) | C++17 | 184 ms | 28244 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.
#ifdef ONLINE_JUDGE
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif
#include <bits/stdc++.h>
#define ll long long int
#define speed ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define TxtIO freopen("lol.in","r",stdin); freopen("lol.txt","w",stdout);
#define forn(i,n) for(int i=0;i<n;i++)
#define pb push_back
using namespace std;
struct segtree{
vector <ll> tree;
ll size;
void init(ll n){
size=1;
while(size<n) size*=2;
tree.assign(2*size-1,-1e18);
}
void build(vector <pair<ll,ll>> &a,ll x,ll lx,ll rx){
if(rx-lx==1){
if(lx<a.size()) tree[x]=a[lx].second-a[lx].first;
return;
}
else{
ll m=(lx+rx)/2;
build(a,x*2+1,lx,m);
build(a,x*2+2,m,rx);
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... |