oj.uz

Submission #7916

# Submission time Handle Problem Language Result Execution time Memory
7916 2014-08-25T07:48:40 Z gs14004 허수아비 (JOI14_scarecrows) C++
15 / 100
 4000 ms 2648 KB 
#include <cstdio>
#include <algorithm>
struct abi{int x,y;}a[200005];
int n;
long long res;
int cmp(abi p, abi q){return p.x<q.x;}

int main(){
    scanf("%d",&n);
    for (int i=0; i<n; i++) {
        scanf("%d %d",&a[i].x,&a[i].y);
    }
    std::sort(a,a+n,cmp);
    int lower,upper;
    for (int i=0; i<n; i++) {
        lower=a[i].y;
        upper=1987654321;
        for (int j=i+1; j<n; j++) {
            if(upper>a[j].y && a[j].y>lower){
                upper=a[j].y;
                res++;
            }
        }
    }
    printf("%lld",res);
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 2648 KB Output is correct
2 Correct 52 ms 2648 KB Output is correct
3 Correct 48 ms 2648 KB Output is correct
4 Correct 12 ms 2648 KB Output is correct
5 Correct 52 ms 2648 KB Output is correct
6 Correct 52 ms 2648 KB Output is correct
7 Correct 52 ms 2648 KB Output is correct
8 Correct 20 ms 2648 KB Output is correct
9 Correct 56 ms 2648 KB Output is correct
10 Correct 52 ms 2648 KB Output is correct
11 Correct 52 ms 2648 KB Output is correct
12 Correct 28 ms 2648 KB Output is correct

Subtask #3
0.0 / 85.0

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