# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
247446 | sckmd | Art Exhibition (JOI18_art) | C++14 | 901 ms | 58404 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;
typedef long long ll;
struct st{
ll a,b;
};
#define MAXN 500005
const ll INF = 1e18;
st all[MAXN];
map <ll,int> mp;
int hsh = 0;
bool cmp(st x,st y)
{
return x.a < y.a;
}
ll tree[4*MAXN];
ll lazy[4*MAXN];
void push(int node,int left,int right)
{
if(lazy[node]!=0)
{
tree[node] += lazy[node];
if(left != right)
{
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... |