oj.uz

Submission #886476

# Submission time Handle Problem Language Result Execution time Memory
886476 2023-12-12T08:15:56 Z vjudge1 Gym Badges (NOI22_gymbadges) C++17
0 / 100
 375 ms 22272 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define endl "\n"
#define all(aa) aa.begin(), aa.end()

int n, dp[500][500];
vector<int> a, b, x;

int f(int ind, int cur){
    if(ind==n) return 0;
    if(dp[ind][cur]!=-1) return dp[ind][cur];


    if(cur<=b[x[ind]]) return dp[ind][cur]=max(f(ind+1, cur+a[x[ind]])+1, f(ind+1, cur));
    return dp[ind][cur]=f(ind+1, cur);
}

int main(){
    cin>>n;

    x.resize(n); a.resize(n); b.resize(n);
    for(auto &e:a) cin>>e;
    for(auto &e:b) cin>>e;

    iota(all(x), 0);
    sort(all(x), [&](int l, int r){
        return (b[l]-a[r]<min({b[l], b[r], b[r]-a[l]}));
    });

    memset(dp, -1, sizeof(dp));
    cout<<f(0, 0);
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 2392 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 375 ms 22272 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 2392 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 2392 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -