답안 #759438

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
759438	2023-06-16T09:57:48 Z	bachhoangxuan	Exhibition (JOI19_ho_t2)	C++17	100 / 100	43 ms	5580 KB

joi2019_ho_t2

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define fi first
#define se second
const int inf=1e18;
const int mod=1e9+7;
const int maxn=200005;
const int bl=650;
const int maxs=650;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

void solve(){
    int n,m;cin >> n >> m;
    vector<pii> p(n);
    vector<int> s(m);
    for(int i=0;i<n;i++) cin >> p[i].se >> p[i].fi;
    for(int i=0;i<m;i++) cin >> s[i];
    sort(p.begin(),p.end(),greater<pii>());
    sort(s.begin(),s.end(),greater<int>());
    int cur=0;
    for(auto &[val,x]:p){
        if(cur<m && x<=s[cur]) cur++;
    }
    cout << cur << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
10.0 / 10.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	324 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	332 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	336 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	380 KB	Output is correct
31	Correct	1 ms	332 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	1 ms	336 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	36 ms	5448 KB	Output is correct
39	Correct	41 ms	5468 KB	Output is correct
40	Correct	32 ms	5480 KB	Output is correct
41	Correct	38 ms	5484 KB	Output is correct
42	Correct	36 ms	5488 KB	Output is correct
43	Correct	37 ms	5564 KB	Output is correct
44	Correct	36 ms	5468 KB	Output is correct
45	Correct	37 ms	5540 KB	Output is correct
46	Correct	39 ms	5580 KB	Output is correct
47	Correct	32 ms	5044 KB	Output is correct
48	Correct	35 ms	4988 KB	Output is correct
49	Correct	30 ms	4376 KB	Output is correct
50	Correct	29 ms	4488 KB	Output is correct
51	Correct	36 ms	5484 KB	Output is correct
52	Correct	39 ms	5576 KB	Output is correct
53	Correct	39 ms	5480 KB	Output is correct
54	Correct	32 ms	5580 KB	Output is correct
55	Correct	41 ms	5476 KB	Output is correct
56	Correct	22 ms	3784 KB	Output is correct
57	Correct	15 ms	2000 KB	Output is correct
58	Correct	22 ms	3796 KB	Output is correct
59	Correct	22 ms	3816 KB	Output is correct
60	Correct	15 ms	2004 KB	Output is correct
61	Correct	23 ms	3188 KB	Output is correct
62	Correct	37 ms	5476 KB	Output is correct
63	Correct	36 ms	5452 KB	Output is correct
64	Correct	37 ms	5572 KB	Output is correct
65	Correct	37 ms	5568 KB	Output is correct
66	Correct	37 ms	5444 KB	Output is correct
67	Correct	36 ms	5480 KB	Output is correct
68	Correct	36 ms	5476 KB	Output is correct
69	Correct	40 ms	5476 KB	Output is correct
70	Correct	39 ms	5572 KB	Output is correct
71	Correct	36 ms	5476 KB	Output is correct
72	Correct	43 ms	5464 KB	Output is correct
73	Correct	36 ms	5476 KB	Output is correct

답안 #759438

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 40.0 / 40.0

Subtask #3 50.0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
40.0 / 40.0

Subtask #3
50.0 / 50.0