# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1090894 | KasymK | Exam (eJOI20_exam) | C++17 | 4 ms | 948 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 ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 1e5+5;
int a[N], b[N];
int main(){
int n;
scanf("%d", &n);
for(int i = 1; i <= n; ++i){
int x;
scanf("%d", &x);
a[i] = x;
}
for(int i = 1; i <= n; ++i){
int x;
scanf("%d", &x);
b[i] = x;
}
bool ok = 1;
for(int i = 1; i < n and ok; ++i)
ok &= (b[i] == b[i+1]);
if(ok){ // subtask 2
int need = b[1];
int answer = 0;
if((int)count(a+1, a+n+1, need) == 0){
puts("0");
return 0;
}
for(int i = 1; i <= n; ++i){
bool have = 0;
int id = -1;
for(int j = i; j <= n; ++j){
id = j;
if(a[j] > need)
break;
have |= (a[j] == need);
}
if(have)
answer += (id-i);
i = id;
}
printf("%d\n", answer);
return 0;
}
return 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... |