Submission #786070

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
786070	2023-07-18T02:29:55 Z	andecaandeci	Exhibition (JOI19_ho_t2)	C++17	50 / 100	1000 ms	4168 KB

joi2019_ho_t2

#include <bits/stdc++.h>
using namespace std;

#define int long long

const int maks = 1e5 + 5;
int dp[2][maks];

int n, m, bingkai[maks];
pair<int, int> gambar[maks];

bool com(pair<int, int> a, pair<int, int> b) {
  return ((a.first < b.first) or (a.first == b.first and a.second < b.second));
}

signed main() {

  cin >> n >> m;
  for (int i = 1; i <= n; i++) {
    cin >> gambar[i].second >> gambar[i].first;
  }

  for (int i = 1; i <= m; i++) {
    cin >> bingkai[i];
  }
  sort(bingkai+1, bingkai+1+m);
  sort(gambar+1, gambar+1+n, com);

  // for (int i = 1; i <= n; i++) cout << gambar[i].first << " " << gambar[i].second << endl;
  // cout << endl;
  // for (int i = 1; i <= m; i++) cout << bingkai[i] << endl;
  // cout << endl;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      if (gambar[i].second <= bingkai[j]) dp[i%2][j] = max(dp[i%2][j], dp[(i-1)%2][j-1]+1);
      dp[i%2][j] = max(dp[i%2][j], dp[(i-1)%2][j]);
      dp[i%2][j] = max(dp[i%2][j], dp[i%2][j-1]);
    }
  }
  cout << dp[n%2][m] << endl;
}

Subtask #1

10.0 / 10.0

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

Subtask #2

40.0 / 40.0

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

Subtask #3

0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	3 ms	348 KB	Output is correct
21	Correct	3 ms	340 KB	Output is correct
22	Correct	3 ms	340 KB	Output is correct
23	Correct	3 ms	340 KB	Output is correct
24	Correct	3 ms	340 KB	Output is correct
25	Correct	3 ms	340 KB	Output is correct
26	Correct	3 ms	340 KB	Output is correct
27	Correct	3 ms	340 KB	Output is correct
28	Correct	2 ms	340 KB	Output is correct
29	Correct	3 ms	340 KB	Output is correct
30	Correct	3 ms	340 KB	Output is correct
31	Correct	3 ms	340 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	212 KB	Output is correct
34	Correct	2 ms	340 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	3 ms	340 KB	Output is correct
37	Correct	3 ms	340 KB	Output is correct
38	Execution timed out	1051 ms	4168 KB	Time limit exceeded
39	Halted	0 ms	0 KB	-