oj.uz

답안 #725538

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
725538 2023-04-17T15:10:42 Z vjudge1 학교 설립 (IZhO13_school) C++17
0 / 100
 145 ms 262144 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ld long double
#define ll long long
#define S second
#define F first

using namespace __gnu_pbds;
using namespace std;

typedef tree<long long, null_type, less_equal<long long>,
    rb_tree_tag, tree_order_statistics_node_update> Tree;

const ll INF = 9223372036854775807LL;
const ll inf = 2147483647;
const ll MAXN = 300010;
const ll MOD = 1e9 + 7;
const ld PI = acos(-1);
const ll NROOT = 320;

ll binpow(ll a, ll b) {
  ll res = 1;
  for (;b; b /= 2, a *= a, a %= MOD)
    if (b & 1) res *= a, res %= MOD;
  return res % MOD;
}

ll gcd(ll a, ll b) {return b ? gcd(b, a % b) : a;}
ll lcm(ll a, ll b) {return a * b / gcd(a, b);}
ll invmod(ll a) {return binpow(a, MOD - 2);}

vector<pair<int, int>> v(MAXN);
vector<vector<int>> memo(10000, vector<int> (10000, -1));

int dp(int i, int M, int S, int m) {
  if (i == M + S) return 0;

  if (memo[i][m] != -1) return memo[i][m];

  int ans = 0;
  if (M > m) ans = max(ans, dp(i + 1, M, S, m + 1) + v[i].F);
  if (S > i - m) ans = max(ans, dp(i + 1, M, S, m) + v[i].S);

  return memo[i][m] = ans;
}

int32_t main () {
  ios_base::sync_with_stdio(false); 
  cin.tie(nullptr);

  int n, m, s; cin >> n >> m >> s;

  for (int i = 1; i <= n; i ++) {
    cin >> v[i].F >> v[i].S;
  }
  sort(v.rbegin(), v.rend());
  int ans = dp(0, m, s, 0);
  for (int i = 0; i < n; i ++) 
    swap(v[i].F, v[i].S);

  for (int i = 0; i <= 1000; i ++) {
    for (auto &x : memo[i])
      x = -1;
  }

  sort(v.rbegin(), v.rend());
  ans = max(ans, dp(0, s, m, 0));

  cout << ans << "\n";
  
  return 0;
}

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 121 ms 262144 KB Execution killed with signal 9
2 Runtime error 104 ms 262144 KB Execution killed with signal 9
3 Runtime error 106 ms 262144 KB Execution killed with signal 9
4 Runtime error 115 ms 262144 KB Execution killed with signal 9
5 Runtime error 113 ms 262144 KB Execution killed with signal 9
6 Runtime error 115 ms 262144 KB Execution killed with signal 9
7 Runtime error 121 ms 262144 KB Execution killed with signal 9
8 Runtime error 114 ms 262144 KB Execution killed with signal 9
9 Runtime error 107 ms 262144 KB Execution killed with signal 9
10 Runtime error 105 ms 262144 KB Execution killed with signal 9
11 Runtime error 104 ms 262144 KB Execution killed with signal 9
12 Runtime error 145 ms 262144 KB Execution killed with signal 9
13 Runtime error 104 ms 262144 KB Execution killed with signal 9
14 Runtime error 111 ms 262144 KB Execution killed with signal 9
15 Runtime error 103 ms 262144 KB Execution killed with signal 9
16 Runtime error 132 ms 262144 KB Execution killed with signal 9
17 Runtime error 108 ms 262144 KB Execution killed with signal 9
18 Runtime error 102 ms 262144 KB Execution killed with signal 9
19 Runtime error 107 ms 262144 KB Execution killed with signal 9
20 Runtime error 110 ms 262144 KB Execution killed with signal 9