oj.uz

Submission #1014777

# Submission time Handle Problem Language Result Execution time Memory
1014777 2024-07-05T14:04:18 Z adrielcp Exhibition (JOI19_ho_t2) C++17
0 / 100
 1 ms 452 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lld double
#define int ll
#define usaco(fname) freopen(#fname ".in","r",stdin);freopen(#fname ".out","w",stdout);
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
// const ll INF = 1e18;
const int INF = 1e9;
const int mod = 1e9+7;
const lld PI = acos(-1.0);
int di[] = {1, -1, 0, 0, 1, 1, -1, -1};
int dj[] = {0, 0, 1, -1, 1, -1, 1, -1};
#define debug(x) cout << #x << ": " << x << endl;
#define add(a, b) a += b, a %= mod
#define mul(a, b) ((a % mod) * (b % mod)) % mod
#define all(x) x.begin(),x.end()

void solve() {
  int n,m;cin>>n>>m;
  vector<int> s(n), v(n), c(m);
  for (int i = 0; i < n; i++) cin >> s[i] >> v[i];
  for (int i = 0; i < m; i++) cin >> c[i];

  vector<int> ord(n); //ord for pics
  iota(all(ord), 0);
  sort(all(ord), [&](int i, int j) { return v[i] < v[j]; });
  sort(all(c));

  // max no. of pictures at frame 1 to i
  vector<int> dp(m);

  for (int idx = 0; idx < n; idx++) {
    int i = ord[idx];
    // debug(i);
    for (int j = m-1; j >= 0; j--) {
      if (s[i] <= c[j]) dp[j] = max(dp[j], (j-1 >= 0 ? dp[j-1] : 0ll) + 1);
      if (j-1 >= 0) dp[j] = max(dp[j], dp[j-1]);
    }
    // cout << dp << endl;
  }

  cout << *max_element(all(dp)) << endl;
}

int32_t main() {
  ios_base::sync_with_stdio(0);cin.tie(0);
  int t=1;
  while(t--) solve();

  return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 452 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 452 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 452 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -