Submission #761968

#	Time	Username	Problem	Language	Result	Execution time	Memory
761968		sysia	Exhibition (JOI19_ho_t2)	C++17	10 / 100	1085 ms	340 KiB

joi2019_ho_t2

//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;

void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << "'" << x << "'";}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

#define int long long
typedef pair<int, int> T;
const int oo = 1e18, oo2 = 1e9+7, K = 30;
const int mod = 998244353;

void solve(){
    int n, m; cin >> n >> m;
    vector<T>a(n);
    for (int i = 0; i<n; i++){
        cin >> a[i].second >> a[i].first;
    }
    sort(a.begin(), a.end());
    vector<int>b(m);
    for (auto &x: b) cin >> x;

    //n > m
    while ((int)b.size() < n) b.emplace_back(-oo);
    sort(b.begin(), b.end());
    //m > n
    reverse(b.begin(), b.end());
    while ((int)b.size() > n) b.pop_back();
    reverse(b.begin(), b.end());
    debug(b);
    assert((int)b.size() == n);
    vector<int>p(n);
    iota(p.begin(), p.end(), 0);
    debug(a);
    int ans = 0;
    do {
        int k = 0;
        vector<int>tab;
        for (auto i: p){
            //kty obraz z i-ta ramka
            if (b[i] >= a[k].second){
                tab.emplace_back(b[i]);
            }
            k++;
        }
        if (is_sorted(tab.begin(), tab.end())){
            ans = max(ans, (int)tab.size());
        }
    } while (next_permutation(p.begin(), p.end()));
    cout << ans << "\n";
}

int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    //cin >> t;
    while (t--) solve();

    return 0;
}

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