# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
467146 |
2021-08-21T19:26:39 Z |
radaiosm7 |
Exam (eJOI20_exam) |
C++ |
|
29 ms |
3096 KB |
#include <bits/stdc++.h>
using namespace std;
int n, i, j, l, r;
int a[100005];
int b[100005];
int c[100005];
int v[100005];
int seg[400020];
bool lazy[400020];
int dp[5005];
void Update(int from, int to, int start=0, int ende=n-1, int indx=1) {
if (lazy[indx]) return;
if (from == start && to == ende) {
seg[indx] = to-from+1;
lazy[indx] = true;
return;
}
int mid = (start+ende)/2;
if (to <= mid) Update(from, to, start, mid, 2*indx);
else if (from > mid) Update(from, to, mid+1, ende, 2*indx+1);
else {
Update(from, mid, start, mid, 2*indx);
Update(mid+1, to, mid+1, ende, 2*indx+1);
}
seg[indx] = seg[2*indx]+seg[2*indx+1];
}
int main() {
scanf("%d", &n);
for (i=0; i < n; ++i) scanf("%d", &a[i]);
for (i=0; i < n; ++i) scanf("%d", &b[i]);
for (i=0; i < n; ++i) {
if (a[i] == b[0]) {
for (l=i; l-1 >= 0 && a[l-1]<a[i]; --l);
for (r=i; r+1 < n && a[r+1]<a[i]; ++r);
Update(l, r);
}
}
printf("%d\n", seg[1]);
return 0;
}
Compilation message
exam.cpp: In function 'int main()':
exam.cpp:32:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
32 | scanf("%d", &n);
| ~~~~~^~~~~~~~~~
exam.cpp:33:30: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
33 | for (i=0; i < n; ++i) scanf("%d", &a[i]);
| ~~~~~^~~~~~~~~~~~~
exam.cpp:34:30: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
34 | for (i=0; i < n; ++i) scanf("%d", &b[i]);
| ~~~~~^~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
332 KB |
Output is correct |
2 |
Correct |
7 ms |
1080 KB |
Output is correct |
3 |
Correct |
20 ms |
1956 KB |
Output is correct |
4 |
Correct |
19 ms |
1436 KB |
Output is correct |
5 |
Correct |
29 ms |
3096 KB |
Output is correct |
6 |
Correct |
27 ms |
2600 KB |
Output is correct |
7 |
Correct |
23 ms |
2872 KB |
Output is correct |
8 |
Correct |
28 ms |
3020 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
404 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |