제출 #707179

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
707179		Alihan_8	Exhibition (JOI19_ho_t2)	C++17	50 / 100	149 ms	274432 KiB

joi2019_ho_t2

#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';
}

컴파일 시 표준 에러 (stderr) 메시지

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);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 40 / 40
• Subtask 3: 0 / 50