oj.uz

Submission #13351

# Submission time Handle Problem Language Result Execution time Memory
13351 2015-02-13T12:37:17 Z gs14004 수족관 1 (KOI13_aqua1) C++14
0 / 100
 0 ms 1244 KB 
#include <cstdio>
#include <utility>
#include <map>
#include <algorithm>
using namespace std;
typedef pair<int,int> pi;

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

int h;

int f(int s, int e){
    if(s >= e) return 0;
    int pos = (int)(min_element(y+s,y+e)-y);
    int ret = 0;
    if(hole[pos] == 0) ret += (x[e] - x[s]) * (y[pos] - h);
    int ph = h;
    h = y[pos];
    ret += f(s,pos) + f(pos+1,e);
    h = ph;
    return ret;
}

int main(){
    scanf("%d",&n);
    n/=2;
    for (int i=0; i<n; i++) {
        int p,q;
        scanf("%d %d %d %d",&p,&q,&x[i],&y[i]);
        mp[pi(x[i],y[i])] = i;
    }
    int t;
    scanf("%d",&t);
    for (int i=0; i<t; i++) {
        int s,e,x,y;
        scanf("%d %d %d %d",&s,&e,&x,&y);
        hole[mp[pi(s,e)]] = 1;
    }
    printf("%d",f(0,n-1));
}

Subtask #1
0.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1244 KB Output is correct
2 Incorrect 0 ms 1244 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1244 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1244 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 36.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1244 KB Output isn't correct
2 Halted 0 ms 0 KB -