# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
833242 |
2023-08-22T03:36:14 Z |
vjudge1 |
Exam (eJOI20_exam) |
C++17 |
|
1 ms |
724 KB |
#include<bits/stdc++.h>
using namespace std;
#define For(i, n) for (int i = 0; i < n; i++)
#define Each(x, v) for (auto x : v)
#define pb push_back
const int MAXN = 200;
int N, H[MAXN + 5], T[MAXN + 5], dp[MAXN + 5][MAXN + 5];
int f(int l, int r) {
if (l > r) return 0;
if (l == r) {
if (T[l] == H[l]) return 1;
return 0;
}
if (dp[l][r] != -1) return dp[l][r];
int terbesar = 0, cnt = 0;
for (int i = l; i <= r; i++) terbesar = max(terbesar, H[i]);
for (int i = l; i <= r; i++) {
if (T[i] == terbesar) {
cnt++;
}
}
int ans = cnt;
for (int i = l; i <= r - 1; i++) {
ans = max(ans, f(l, i) + f(i + 1, r));
}
return dp[l][r] = ans;
}
bool ceksubsoal2() {
int pivot = T[0];
for (int i = 1; i < N; i++) {
if (T[i] != T[0]) {
return false;
}
}
return true;
}
void subsoal2() {
int target = T[0], ans = 0;
vector <int> pos;
for (int i = 0; i < N; i++) {
if (H[i] == target) {
pos.pb(i);
ans++;
}
}
Each (x, pos) {
for (int i = x - 1; i >= 0; i--) {
if (H[i] < H[x]) {
ans++;
}
else break;
}
for (int i = x + 1; i < N; i++) {
if (H[i] < H[x]) {
ans++;
}
else break;
}
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
memset(dp, -1, sizeof dp);
cin >> N;
For (i, N) cin >> H[i];
For (i, N) cin >> T[i];
if (ceksubsoal2()) subsoal2();
else cout << f(0, N - 1) << endl;
}
Compilation message
exam.cpp: In function 'bool ceksubsoal2()':
exam.cpp:33:6: warning: unused variable 'pivot' [-Wunused-variable]
33 | int pivot = T[0];
| ^~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
468 KB |
Output is correct |
2 |
Correct |
0 ms |
468 KB |
Output is correct |
3 |
Correct |
0 ms |
468 KB |
Output is correct |
4 |
Correct |
0 ms |
468 KB |
Output is correct |
5 |
Incorrect |
0 ms |
468 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
724 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
468 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
724 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
468 KB |
Output is correct |
2 |
Correct |
0 ms |
468 KB |
Output is correct |
3 |
Correct |
0 ms |
468 KB |
Output is correct |
4 |
Correct |
0 ms |
468 KB |
Output is correct |
5 |
Incorrect |
0 ms |
468 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
468 KB |
Output is correct |
2 |
Correct |
0 ms |
468 KB |
Output is correct |
3 |
Correct |
0 ms |
468 KB |
Output is correct |
4 |
Correct |
0 ms |
468 KB |
Output is correct |
5 |
Incorrect |
0 ms |
468 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |