# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
468052 | Stickfish | Exam (eJOI20_exam) | C++17 | 89 ms | 3000 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 <iostream>
#include <set>
using namespace std;
const int MAXN = 1e5 + 123;
int a[MAXN];
int b[MAXN];
void solve_2(int n){
int cnt = 0;
int isneeded = 0;
int ans = 0;
for(int i = 0; i < n; ++i){
if(a[i] == b[0]){
isneeded = 1;
}
if(a[i] > b[0]){
ans += cnt * isneeded;
isneeded = 0;
cnt = 0;
} else {
++cnt;
}
}
cout << ans + cnt * isneeded << endl;
}
void solve_4(int n){
}
# | 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... |