oj.uz

답안 #258789

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
258789 2020-08-06T14:46:08 Z Fidisk Exhibition (JOI19_ho_t2) C++14
100 / 100
 89 ms 5752 KB 
#include <bits/stdc++.h>
using namespace std;

#define oo 1e9
#define fi first
#define se second
#define sp(iiii) setprecision(iiii)
#define IO ios_base::sync_with_stdio(false); cin.tie(0)
#define ms(aaaa,xxxx) memset(aaaa,xxxx,sizeof(aaaa))
#define cntbit(xxxx) __builtin_popcount(xxxx)
#define getbit(xxxx,aaaa) ((xxxx>>(aaaa-1))&1)
#define _cos(xxxx) cos(xxxx*acos(-1)/180)
#define _sin(xxxx) sin(xxxx*acos(-1)/180)
#define _tan(xxxx) tan(xxxx*acos(-1)/180)
#define PE cout<<fixed

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pair<int,int>,int> piii;
typedef pair<long long,long long> pll;
typedef pair<pair<long long,long long>,long long> plll;

const ld pi=acos(-1);

ll n,m,i,b[500009],res;
pll a[500009];

bool comp(pll x,pll y){
    return (x.se!=y.se)?(x.se<y.se):x.fi<y.fi;
}

int main(){
    IO;
    cin>>n>>m;
    for (i=1;i<=n;i++) {
        cin>>a[i].fi>>a[i].se;
    }
    for (i=1;i<=m;i++) {
        cin>>b[i];
    }
    sort(a+1,a+n+1,comp);
    sort(b+1,b+m+1);
    while ((n>0)&&(m>0)) {
        //cout<<n<<' '<<m<<' '<<a[n].fi<<' '<<a[n].se<<' '<<b[m]<<'\n';
        if ((a[n].fi<=b[m])) {
            res++;
            n--;
            m--;
        }
        else {
            n--;
        }
    }
    cout<<res;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 2 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 2 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 64 ms 5624 KB Output is correct
39 Correct 61 ms 5752 KB Output is correct
40 Correct 56 ms 5624 KB Output is correct
41 Correct 67 ms 5576 KB Output is correct
42 Correct 63 ms 5624 KB Output is correct
43 Correct 59 ms 5624 KB Output is correct
44 Correct 60 ms 5624 KB Output is correct
45 Correct 89 ms 5496 KB Output is correct
46 Correct 61 ms 5496 KB Output is correct
47 Correct 56 ms 4984 KB Output is correct
48 Correct 53 ms 4984 KB Output is correct
49 Correct 48 ms 4472 KB Output is correct
50 Correct 54 ms 4472 KB Output is correct
51 Correct 62 ms 5624 KB Output is correct
52 Correct 59 ms 5624 KB Output is correct
53 Correct 60 ms 5496 KB Output is correct
54 Correct 55 ms 5624 KB Output is correct
55 Correct 62 ms 5624 KB Output is correct
56 Correct 39 ms 3832 KB Output is correct
57 Correct 22 ms 2048 KB Output is correct
58 Correct 36 ms 3832 KB Output is correct
59 Correct 41 ms 3832 KB Output is correct
60 Correct 21 ms 2048 KB Output is correct
61 Correct 34 ms 3320 KB Output is correct
62 Correct 63 ms 5648 KB Output is correct
63 Correct 61 ms 5624 KB Output is correct
64 Correct 63 ms 5616 KB Output is correct
65 Correct 66 ms 5624 KB Output is correct
66 Correct 65 ms 5624 KB Output is correct
67 Correct 61 ms 5624 KB Output is correct
68 Correct 65 ms 5752 KB Output is correct
69 Correct 60 ms 5624 KB Output is correct
70 Correct 60 ms 5624 KB Output is correct
71 Correct 62 ms 5752 KB Output is correct
72 Correct 62 ms 5624 KB Output is correct
73 Correct 58 ms 5624 KB Output is correct