# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
824192 | vanic | Exam (eJOI20_exam) | C++14 | 490 ms | 99520 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 <algorithm>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <cstring>
using namespace std;
const int maxn=1e5+5;
int n;
int a[maxn], b[maxn];
void solve1(){
int val=b[0];
bool p=0;
int prosl=-1;
int br=0;
for(int i=0; i<n; i++){
if(a[i]==val && !p){
br+=i-prosl;
p=1;
}
else if(a[i]>val){
prosl=i;
p=0;
}
else if(p){
# | 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... |