답안 #707179

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
707179 2023-03-08T14:52:59 Z Alihan_8 Exhibition (JOI19_ho_t2) C++17
50 / 100
149 ms 274432 KB
#include <bits/stdc++.h>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, m; cin >> n >> m;
    vector <pair<int,int>> p(n);
    for ( auto &[r, l]: p ) cin >> l >> r;
    vector <int> C(m);
    for ( auto &i: C ) cin >> i;
    sort(all(C)); sort(all(p));
    for ( auto &[l, r]: p ) swap(l, r);
    vector <vector<int>> dp(n+1, vector <int> (m+1));
    for ( int i = 1; i <= n; i++ ){
        auto [l, r] = p[i-1];
        for ( int j = 1; j <= m; j++ ){
            int &res = dp[i][j];
            res = dp[i-1][j];
            if ( C[j-1] >= l ) res = max(res, dp[i-1][j-1]+1);
        }
    }
    cout << dp[n][m];

    cout << '\n';
}

Compilation message

joi2019_ho_t2.cpp: In function 'void IO(std::string)':
joi2019_ho_t2.cpp:11:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:11:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 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 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 316 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 316 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 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 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 316 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 316 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 5 ms 8148 KB Output is correct
21 Correct 5 ms 8148 KB Output is correct
22 Correct 5 ms 8148 KB Output is correct
23 Correct 5 ms 8148 KB Output is correct
24 Correct 5 ms 8148 KB Output is correct
25 Correct 5 ms 8052 KB Output is correct
26 Correct 5 ms 8148 KB Output is correct
27 Correct 5 ms 8148 KB Output is correct
28 Correct 5 ms 8172 KB Output is correct
29 Correct 5 ms 8148 KB Output is correct
30 Correct 5 ms 8144 KB Output is correct
31 Correct 6 ms 8140 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 324 KB Output is correct
34 Correct 3 ms 2644 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 6 ms 8148 KB Output is correct
37 Correct 6 ms 8148 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 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 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 316 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 316 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 5 ms 8148 KB Output is correct
21 Correct 5 ms 8148 KB Output is correct
22 Correct 5 ms 8148 KB Output is correct
23 Correct 5 ms 8148 KB Output is correct
24 Correct 5 ms 8148 KB Output is correct
25 Correct 5 ms 8052 KB Output is correct
26 Correct 5 ms 8148 KB Output is correct
27 Correct 5 ms 8148 KB Output is correct
28 Correct 5 ms 8172 KB Output is correct
29 Correct 5 ms 8148 KB Output is correct
30 Correct 5 ms 8144 KB Output is correct
31 Correct 6 ms 8140 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 324 KB Output is correct
34 Correct 3 ms 2644 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 6 ms 8148 KB Output is correct
37 Correct 6 ms 8148 KB Output is correct
38 Runtime error 149 ms 274432 KB Execution killed with signal 9
39 Halted 0 ms 0 KB -