# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
468052 |
2021-08-26T09:04:44 Z |
Stickfish |
Exam (eJOI20_exam) |
C++17 |
|
89 ms |
3000 KB |
#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){
}
void solve_slow(int n){
}
signed main(){
int n;
cin >> n;
for(int i = 0; i < n; ++i)
cin >> a[i];
for(int i = 0; i < n; ++i)
cin >> b[i];
bool sub2 = true;
for(int i = 0; i < n; ++i){
if(b[i] != b[0])
sub2 = false;
}
if(sub2){
solve_2(n);
return 0;
}
bool sub4 = true;
set<int> st;
for(int i = 0; i < n; ++i){
if(st.find(a[i]) != st.end())
sub4 = false;
st.insert(a[i]);
}
if(sub4){
return 0;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
204 KB |
Output is correct |
2 |
Correct |
18 ms |
368 KB |
Output is correct |
3 |
Correct |
55 ms |
908 KB |
Output is correct |
4 |
Correct |
37 ms |
956 KB |
Output is correct |
5 |
Correct |
89 ms |
3000 KB |
Output is correct |
6 |
Correct |
36 ms |
1340 KB |
Output is correct |
7 |
Correct |
41 ms |
1528 KB |
Output is correct |
8 |
Correct |
88 ms |
2976 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
6 ms |
460 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |