oj.uz

답안 #13356

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
13356 2015-02-13T13:31:22 Z gs14004 수족관 2 (KOI13_aqua2) C++14
69 / 100
 1000 ms 13468 KB 
#include <cstdio>
#include <utility>
#include <map>
#include <algorithm>
using namespace std;
typedef pair<int,int> pi;

int x[150005], y[150005], hole[150005], n;
map<pi,int> mp;

int h;
long long res;
struct bit{
    int tree[265000], lim;
    void init(int n) {
        for(lim = 1; lim <= n+1; lim <<= 1);
    }
    void add(int x, int v){
        x++;
        while(x <= lim){
            tree[x] += v;
            x += x & -x;
        }
    }
    int sum(int x){
        x++;
        int r = 0;
        while(x){
            r += tree[x];
            x -= x & -x;
        }
        return r;
    }
}bit;

double f(int s, int e){
    if(s >= e) return 0;
    int pos = (int)(min_element(y+s,y+e)-y);
    int ph = h;
    h = y[pos];
    double r = max(f(s,pos),f(pos+1,e));
    if(bit.sum(e-1) == bit.sum(s-1)){
        res += 1ll * (x[e] - x[s]) * (y[pos] - ph);
    }
    else{
        r += 1.0 * (x[e] - x[s]) * (y[pos] - ph) / (bit.sum(e-1) - bit.sum(s-1));
    }
    h = ph;
    return r;
}

int main(){
    scanf("%d",&n);
    n/=2;
    for (int i=0; i<n; i++) {
        scanf("%*d %*d %d %d",&x[i],&y[i]);
        mp[pi(x[i],y[i])] = i;
    }
    bit.init(n);
    int t;
    scanf("%d",&t);
    for (int i=0; i<t; i++) {
        int s,e;
        scanf("%d %d %*d %*d",&s,&e);
        hole[mp[pi(s,e)]] = 1;
        bit.add(mp[pi(s,e)],1);
    }
    printf("%.2lf\n",f(0,n-1));
    printf("%lld",res);
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 4008 KB Output is correct
2 Correct 0 ms 4008 KB Output is correct
3 Correct 0 ms 4008 KB Output is correct
4 Correct 0 ms 4008 KB Output is correct
5 Correct 0 ms 4008 KB Output is correct
6 Correct 0 ms 4008 KB Output is correct
7 Correct 0 ms 4008 KB Output is correct
8 Correct 0 ms 4008 KB Output is correct
9 Correct 0 ms 4008 KB Output is correct
10 Correct 0 ms 4008 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 4008 KB Output is correct
2 Correct 0 ms 4008 KB Output is correct
3 Correct 0 ms 4008 KB Output is correct
4 Correct 0 ms 4008 KB Output is correct
5 Correct 1 ms 4008 KB Output is correct
6 Correct 0 ms 4008 KB Output is correct
7 Correct 0 ms 4008 KB Output is correct
8 Correct 0 ms 4008 KB Output is correct
9 Correct 0 ms 4008 KB Output is correct
10 Correct 0 ms 4008 KB Output is correct

Subtask #3
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 4008 KB Output is correct
2 Correct 0 ms 4008 KB Output is correct
3 Correct 7 ms 4140 KB Output is correct
4 Correct 6 ms 4140 KB Output is correct
5 Correct 0 ms 4140 KB Output is correct
6 Correct 18 ms 4212 KB Output is correct
7 Correct 11 ms 4140 KB Output is correct
8 Correct 11 ms 4140 KB Output is correct
9 Correct 0 ms 4140 KB Output is correct
10 Correct 0 ms 4140 KB Output is correct

Subtask #4
0.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 252 ms 12192 KB Output is correct
2 Correct 185 ms 12192 KB Output is correct
3 Execution timed out 1000 ms 13468 KB Program timed out
4 Halted 0 ms 0 KB -