oj.uz

Submission #128649

# Submission time Handle Problem Language Result Execution time Memory
128649 2019-07-11T07:59:22 Z miguel Exhibition (JOI19_ho_t2) C++14
50 / 100
 1000 ms 52220 KB 
#include<bits/stdc++.h>
using namespace std;
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define sz size()
#define x first
#define y second
#define pi pair <int, int>
#define pii pair <int, pi>
#define vi vector <int>
const ll mod = 1e9 + 7;
int n, m, ans;
vector <pi> t;
vector <int> r;
int dp[5001][5001];

int32_t main(){
    ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
    cin>>n>>m;
    t.pb({-1, -1});
    r.pb(-1);
    //for(int i=1; i<=n; i++) dp[i]=1;
    for(int i=1; i<=n; i++){
        int s, v;
        cin>>s>>v;
        t.pb({v, s});
    }
    sort(t.begin(), t.end());
    for(int i=1; i<=m; i++){
        int x;
        cin>>x;
        r.pb(x);
    }
    sort(t.begin(), t.end());
    sort(r.begin(), r.end());
    for(int i=1; i<=n; i++){
        for(int j=1; j<=m; j++){
            dp[i][j]=max(dp[i-1][j], dp[i][j-1]);
            if(t[i].y<=r[j]) dp[i][j]=max(dp[i][j], dp[i-1][j-1]+1);
        }
    }
    cout<<dp[n][m];
}

Subtask #1
10.0 / 10.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 380 KB Output is correct
19 Correct 2 ms 380 KB Output is correct
20 Correct 14 ms 8312 KB Output is correct
21 Correct 14 ms 8372 KB Output is correct
22 Correct 16 ms 8284 KB Output is correct
23 Correct 13 ms 8312 KB Output is correct
24 Correct 14 ms 8312 KB Output is correct
25 Correct 16 ms 8312 KB Output is correct
26 Correct 14 ms 8316 KB Output is correct
27 Correct 13 ms 8312 KB Output is correct
28 Correct 14 ms 8312 KB Output is correct
29 Correct 16 ms 8316 KB Output is correct
30 Correct 14 ms 8312 KB Output is correct
31 Correct 14 ms 8312 KB Output is correct
32 Correct 7 ms 4400 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 9 ms 5496 KB Output is correct
35 Correct 2 ms 632 KB Output is correct
36 Correct 14 ms 8312 KB Output is correct
37 Correct 14 ms 8312 KB Output is correct

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 380 KB Output is correct
19 Correct 2 ms 380 KB Output is correct
20 Correct 14 ms 8312 KB Output is correct
21 Correct 14 ms 8372 KB Output is correct
22 Correct 16 ms 8284 KB Output is correct
23 Correct 13 ms 8312 KB Output is correct
24 Correct 14 ms 8312 KB Output is correct
25 Correct 16 ms 8312 KB Output is correct
26 Correct 14 ms 8316 KB Output is correct
27 Correct 13 ms 8312 KB Output is correct
28 Correct 14 ms 8312 KB Output is correct
29 Correct 16 ms 8316 KB Output is correct
30 Correct 14 ms 8312 KB Output is correct
31 Correct 14 ms 8312 KB Output is correct
32 Correct 7 ms 4400 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 9 ms 5496 KB Output is correct
35 Correct 2 ms 632 KB Output is correct
36 Correct 14 ms 8312 KB Output is correct
37 Correct 14 ms 8312 KB Output is correct
38 Execution timed out 1073 ms 52220 KB Time limit exceeded
39 Halted 0 ms 0 KB -