# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
833603 | vjudge1 | Exam (eJOI20_exam) | C++17 | 58 ms | 1456 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;
const int MAXN = 1e5 + 10;
const int INF = INT_MAX;
const long long LINF = LLONG_MAX;
const int MOD = 1e9 + 7;
const int MOD2 = 998244353;
void solv(){
int n;
cin >> n;
int h[n], t[n];
for(int i = 0; i < n; i++)cin >> h[i];
bool same = 1;
for(int i = 0; i < n; i++){
cin >> t[i];
if(i != 0)if(t[i] != t[i-1])same = false;
}
if(same){
int temp = t[0];
int ans = 0;
int nyala[n] = {};
int now = 0;
bool cashin = false;
for(int i = 0; i < n; i++){
if(h[i] < temp){
now++;
}
if(h[i] == temp){
now++;
cashin = true;
}
if(h[i] > temp){
if(cashin){
ans += now;
cashin = false;
}
now = 0;
}
}
if(cashin){
ans += now;
}
cout << ans << endl;
}else{
int before[n] = {};
int ans = 0;
for(int i = 0; i < n; i++){
int after[n+5] = {};
int l = i;
int mx = -1;
for(int j = i; j >= 0; j--){
if(h[i] >= t[j]){
after[j] = after[j+1] + 1;
}else{
after[j] = after[j+1];
}
// after[j] = after[j] - before[j];
if(after[j]-before[j] >mx){
mx = after[j] - before[j];
}
}
for(int j = i; j >= 0; j--){
before[j] = after[j] - before[j];
}
ans += mx;
}
cout << ans << endl;
}
}
int main(){
int tc = 1;
// cin >> tc;
while(tc--)solv();
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... |