# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1150927 | SmuggingSpun | Exam (eJOI20_exam) | C++20 | 81 ms | 4612 KiB |
#include<bits/stdc++.h>
#define taskname "C"
using namespace std;
template<class T>void maximize(T& a, T b){
if(a < b){
a = b;
}
}
const int lim = 1e5 + 5;
int n, N, a[lim], b[lim];
vector<int>compress;
namespace sub2{
void solve(){
int ans = 0;
for(int i = 1; i <= n; i++){
if(a[i] > b[1]){
continue;
}
if(a[i] == b[1]){
int l = i;
ans++;
while(--l > 0 && a[l] <= b[1]){
ans++;
}
while(++i <= n && a[i] <= b[1]){
ans++;
}
}
}
cout << ans;
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... |