oj.uz

Submission #332733

# Submission time Handle Problem Language Result Execution time Memory
332733 2020-12-03T05:11:59 Z limabeans Exhibition (JOI19_ho_t2) C++17
50 / 100
 199 ms 274436 KB 
#include <bits/stdc++.h>
using namespace std;

template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl





using ll = long long;





const int inf = 2e9;




void print(vector<int> a, int n) {
    for (int i=0; i<n; i++) {
	cout<<a[i]<<" ";
    }
    cout<<endl;
}

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


    
    int n, m;
    cin>>n>>m;
    
    vector<pair<int,int>> a(n); // (val, size)
    
    for (int i=0; i<n; i++) {
	cin>>a[i].second>>a[i].first;
    }

    sort(a.begin(), a.end());

    vector<int> w(m);
    for (int i=0; i<m; i++) {
	cin>>w[i];
    }

    sort(w.begin(),w.end());

    vector<vector<int>> dp(n+1, vector<int>(m+1, 0));

    for (int i=1; i<=n; i++) {
	for (int j=1; j<=m; j++) {
	    int size = a[i-1].second;
	    int frame = w[j-1];
	    dp[i][j] = max({dp[i-1][j], dp[i][j-1], dp[i-1][j-1]+(size<=frame)});
	}
    }

    cout<<dp[n][m]<<endl;

    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 368 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 368 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 8 ms 4352 KB Output is correct
21 Correct 8 ms 4332 KB Output is correct
22 Correct 8 ms 4332 KB Output is correct
23 Correct 8 ms 4332 KB Output is correct
24 Correct 8 ms 4332 KB Output is correct
25 Correct 8 ms 4204 KB Output is correct
26 Correct 8 ms 4332 KB Output is correct
27 Correct 8 ms 4332 KB Output is correct
28 Correct 8 ms 4332 KB Output is correct
29 Correct 8 ms 4332 KB Output is correct
30 Correct 8 ms 4332 KB Output is correct
31 Correct 9 ms 4332 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 3 ms 1516 KB Output is correct
35 Correct 1 ms 492 KB Output is correct
36 Correct 8 ms 4332 KB Output is correct
37 Correct 8 ms 4332 KB Output is correct

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 368 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 8 ms 4352 KB Output is correct
21 Correct 8 ms 4332 KB Output is correct
22 Correct 8 ms 4332 KB Output is correct
23 Correct 8 ms 4332 KB Output is correct
24 Correct 8 ms 4332 KB Output is correct
25 Correct 8 ms 4204 KB Output is correct
26 Correct 8 ms 4332 KB Output is correct
27 Correct 8 ms 4332 KB Output is correct
28 Correct 8 ms 4332 KB Output is correct
29 Correct 8 ms 4332 KB Output is correct
30 Correct 8 ms 4332 KB Output is correct
31 Correct 9 ms 4332 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 3 ms 1516 KB Output is correct
35 Correct 1 ms 492 KB Output is correct
36 Correct 8 ms 4332 KB Output is correct
37 Correct 8 ms 4332 KB Output is correct
38 Runtime error 199 ms 274436 KB Execution killed with signal 9 (could be triggered by violating memory limits)
39 Halted 0 ms 0 KB -