oj.uz

Submission #7930

# Submission time Handle Problem Language Result Execution time Memory
7930 2014-08-25T10:46:56 Z gs14004 허수아비 (JOI14_scarecrows) C++
15 / 100
 4000 ms 12392 KB 
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <set>
using namespace std;

struct pt{int x,y;}pos[200005];
int cmp1(pt a, pt b){return a.x<b.x;}
int cmp2(pt a, pt b){return a.y<b.y;}

struct x{int key, sub, type;};
bool operator<(x a, x b){return a.key == b.key ? (a.type > b.type) : (a.key < b.key);}

int a[200005],n;
x heap[270000];

int lim, tree[270000];

void add(int x){
    while (x <= lim) {
        tree[x]++;
        x += x & -x;
    }
}
int sum(int x){
    int res = 0;
    while (x) {
        res += tree[x];
        x -= x & -x;
    }
    return res;
}

long long f(int s, int e){
    long long res = 0;
    if(e - s < 3){
        for (int i=s; i<=e; i++) {
            int upper=1e9;
            for (int j=i+1; j<=e; j++) {
                if(a[i] < a[j] && a[j] < upper){
                    upper = a[j];
                    res++;
                }
            }
        }
        return res;
    }
    int m = (s+e)/2;
    res = f(s,m) + f(m+1,e);
    
    memset(tree,0,sizeof(tree));
    set<int> s_left, s_right;
    set<int> ::iterator it;
    int lim, piv = 0;
    
    for (int i=m; i>=s; i--) {
        it = s_left.upper_bound(a[i]);
        if(it == s_left.end()) lim = n+1;
        else lim = *it - 1;
        s_left.insert(a[i]);
        heap[piv] = {a[i],lim,0};
        piv++;
    }
    
    for (int i=m+1; i<=e; i++) {
        it = s_right.upper_bound(a[i]);
        if(it == s_right.begin()) lim = -1;
        else lim = *--it;
        heap[piv] = {lim,a[i],1};
        piv++;
        s_right.insert(a[i]);
    }
    
    sort(heap,heap+piv);
    for (int i=0; i<piv; i++) {
        x c = heap[i];
        if(c.type) add(c.sub);
        else res += sum(c.sub) - sum(c.key - 1);
    }
    return res;
}

int main(){
    scanf("%d",&n);
    for (int i=0; i<n; i++) {
        scanf("%d %d",&pos[i].x,&pos[i].y);
    }
    sort(pos,pos+n,cmp2);
    for (int i=0; i<n; i++) {
        pos[i].y = i+1;
    }
    sort(pos,pos+n,cmp1);
    for (int i=0; i<n; i++) {
        a[i] = pos[i].y;
    }
    for(lim = 1; lim <= n+1; lim <<= 1);
    long long r = f(0,n-1);
    printf("%lld",r);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 7776 KB Output is correct
2 Correct 12 ms 7776 KB Output is correct
3 Correct 12 ms 7776 KB Output is correct
4 Correct 12 ms 7776 KB Output is correct
5 Correct 12 ms 7776 KB Output is correct
6 Correct 12 ms 7776 KB Output is correct
7 Correct 12 ms 7776 KB Output is correct
8 Correct 12 ms 7776 KB Output is correct
9 Correct 12 ms 7776 KB Output is correct
10 Correct 8 ms 7776 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 160 ms 7908 KB Output is correct
2 Correct 168 ms 7908 KB Output is correct
3 Correct 164 ms 7908 KB Output is correct
4 Correct 156 ms 7908 KB Output is correct
5 Correct 164 ms 7908 KB Output is correct
6 Correct 168 ms 7908 KB Output is correct
7 Correct 168 ms 7908 KB Output is correct
8 Correct 160 ms 7908 KB Output is correct
9 Correct 168 ms 7908 KB Output is correct
10 Correct 168 ms 7908 KB Output is correct
11 Correct 164 ms 7908 KB Output is correct
12 Correct 164 ms 7908 KB Output is correct

Subtask #3
0.0 / 85.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4000 ms 12392 KB Program timed out
2 Halted 0 ms 0 KB -