# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
51540 | moonrabbit2 | 허수아비 (JOI14_scarecrows) | C++17 | 2832 ms | 98140 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>
#define N 200005
#define INF 1000000005
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
struct fenwick
{
vector<int>tree;
fenwick(int sz){tree.resize(sz+5);}
void add(int k){
for(;k<=tree.size();k+=k&-k)
tree[k]++;
}
int sum(int k){
int res=0;
for(;k;k-=k&-k)
res+=tree[k];
return res;
}
};
ll ans;
int n;P a[N];
void dnc(int s,int e)
{
if(e==s)
return;
int m=(s+e)/2;
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... |