oj.uz

답안 #725494

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
725494 2023-04-17T14:18:24 Z vjudge1 학교 설립 (IZhO13_school) C++17
15 / 100
 2000 ms 28348 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);

int dp(int i, int n, int M, int S, int m, int s) {
  if (S == s && m == M) return 0;
  if (i > n) return -inf;

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

  return 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;
  }

  cout << dp(0, n, m, s, 0, 0);

  return 0;
}

Subtask #1
15.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 3 ms 2648 KB Output is correct
4 Execution timed out 2076 ms 2644 KB Time limit exceeded
5 Execution timed out 2075 ms 2644 KB Time limit exceeded
6 Execution timed out 2079 ms 2644 KB Time limit exceeded
7 Execution timed out 2082 ms 3028 KB Time limit exceeded
8 Execution timed out 2076 ms 3028 KB Time limit exceeded
9 Execution timed out 2069 ms 3076 KB Time limit exceeded
10 Execution timed out 2076 ms 3028 KB Time limit exceeded
11 Execution timed out 2080 ms 3028 KB Time limit exceeded
12 Execution timed out 2067 ms 3028 KB Time limit exceeded
13 Execution timed out 2070 ms 5844 KB Time limit exceeded
14 Execution timed out 2069 ms 9548 KB Time limit exceeded
15 Execution timed out 2048 ms 16304 KB Time limit exceeded
16 Execution timed out 2058 ms 17868 KB Time limit exceeded
17 Execution timed out 2040 ms 21196 KB Time limit exceeded
18 Execution timed out 2029 ms 23136 KB Time limit exceeded
19 Execution timed out 2040 ms 24812 KB Time limit exceeded
20 Execution timed out 2025 ms 28348 KB Time limit exceeded