oj.uz

답안 #367344

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
367344 2021-02-16T22:57:18 Z piddddgy Exhibition (JOI19_ho_t2) C++11
50 / 100
 1000 ms 3056 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
// #define cerr if(false) cerr
#define watch(x) cerr << (#x) << " is " << (x) << endl;
#define endl '\n'
#define ld long double
#define int long long
#define pii pair<int, int>
#define fi first
#define se second
#define sz(a) (int)(a).size()
#define all(x) (x).begin(), (x).end()
    

auto seed = chrono::high_resolution_clock::now().time_since_epoch().count();
mt19937 mt(seed);

const int maxn = 100500;
    
int n, m;
pii a[maxn];
int c[maxn];
    
int ans = 0;

// take the x biggest frames
void go(int upto) {
    priority_queue<int> pq;
    for(int i = 1; i <= upto; i++) {
        pq.push(-c[i]);
    }

    int loc = 0;
    int lst = -1e18;
    for(int i = 1; i <= n; i++) {
        if(pq.empty()) break;

        int x = -pq.top();

        if(a[i].se <= x) {
            loc++;
            pq.pop();
        }
    }

    ans = max(ans, loc);
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    
    cin >> n >> m;
    
    // .fi = value, .se = size
    for(int i = 1; i <= n; i++) {
        cin >> a[i].se >> a[i].fi;
    }
    
    for(int i = 1; i <= m; i++) cin >> c[i];

    sort(a+1, a+n+1);

    sort(c+1, c+m+1);
    reverse(c+1, c+m+1);

    for(int i = 1; i <= m; i++) go(i);

    cout << ans << endl;
}
    
/*
    
sort by value then by size
you will always take the biggest frames


    
Did you read the bounds?
Did you make typos?
Are there edge cases (N=1?)
Are array sizes proper?
Integer overflow?
DS reset properly between test cases?
Is using long longs causing TLE?
Are you using floating points?
*/

Compilation message

joi2019_ho_t2.cpp: In function 'void go(long long int)':
joi2019_ho_t2.cpp:37:9: warning: unused variable 'lst' [-Wunused-variable]
   37 |     int lst = -1e18;
      |         ^~~

Subtask #1
10.0 / 10.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 380 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 0 ms 364 KB Output is correct
17 Correct 0 ms 364 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 0 ms 364 KB Output is correct
20 Correct 26 ms 364 KB Output is correct
21 Correct 23 ms 364 KB Output is correct
22 Correct 11 ms 364 KB Output is correct
23 Correct 11 ms 364 KB Output is correct
24 Correct 25 ms 364 KB Output is correct
25 Correct 21 ms 364 KB Output is correct
26 Correct 26 ms 364 KB Output is correct
27 Correct 11 ms 364 KB Output is correct
28 Correct 12 ms 384 KB Output is correct
29 Correct 12 ms 376 KB Output is correct
30 Correct 25 ms 364 KB Output is correct
31 Correct 18 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 10 ms 364 KB Output is correct
34 Correct 3 ms 364 KB Output is correct
35 Correct 11 ms 364 KB Output is correct
36 Correct 24 ms 364 KB Output is correct
37 Correct 24 ms 364 KB Output is correct
38 Execution timed out 1085 ms 3056 KB Time limit exceeded
39 Halted 0 ms 0 KB -