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;
typedef int64_t ll;
int main()
{
ll n;
cin >> n;
vector<ll> slots(n);
vector<ll> users(n);
for (ll i = 0; i < n; i++)
{
cin >> slots[i];
}
for (ll i = 0; i < n; i++)
{
cin >> users[i];
}
ll happy = 0;
ll wanting = 0;
ll satisfiable = 0;
for(int i = n-1; i >= 0; i--){
if(slots[i]){
if(wanting>0){
wanting--;
happy++;
slots[i]=0;
}
}
if(users[i]) wanting++;
if(slots[i]&&users[i]) satisfiable++;
}
cout << happy-wanting+satisfiable;
}
# | 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... |