# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
516832 | nickyrio | Exam (eJOI20_exam) | C++17 | 106 ms | 14480 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define all(s) s.begin(), s.end()
const int N = 1e5 + 100;
const int LG = 17;
int a[N], b[N], n, L[N], R[N];
vector<int> e[N];
int BIT[N], RMQ[LG][N], lg2[N];
int query(int u) {
int ans = 0;
for(; u > 0; u -= u & -u) ans = max(ans, BIT[u]);
return ans;
}
void update(int u, int v) {
for (; u < N; u += u & -u) BIT[u] = max(BIT[u], v);
}
void sub2() {
for (int i = 2; i <= n; ++i) if (b[i] != b[1]) return;
int cnt = 0;
for (int i = 1; i <= n; ++i) if (a[i] == b[1]) {
for (int j = i - 1; a[j] < a[i]; --j) a[j] = a[i];
for (int j = i + 1; a[j] < a[i]; ++j) a[j] = a[i];
}
for (int i = 1; i <= n; ++i) if (a[i] == b[1]) ++cnt;
cout << cnt << '\n';
exit(0);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |