Submission #1310578

#	Time	Username	Problem	Language	Result	Execution time	Memory
1310578		yusifm	Exam (eJOI20_exam)	C++20	0 / 100	11 ms	2648 KiB

exam

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define str string
#define pb push_back
#define pf push_front
#define in insert
#define all(v) v.begin(),v.end()
const ll sz=1000000,INF=1000000000000000000;
using namespace std;
void solve()
{
    ll n,num1,num2,maxNum=-INF,res=-INF,cnt=0,ans=0;
    cin>>n;
    vector<ll>nums1,nums2;
    for(int i=0;i<n;i++)
    {
        cin>>num1;
        nums1.pb(num1),maxNum=max(maxNum,num1);
    }
    for(int i=0;i<n;i++)
    {
        cin>>num2;
        nums2.pb(num2);
    }
    if(nums2[0]==maxNum)
    {
        ans=n;
    }
    else
    {
        for(int i=0;i<nums1.size();i++)
        {
            if(nums1[i]>nums2[0])
            {
                nums1[i]=-INF;
            }
        }
        for(int i=0;i<nums1.size();i++)
        {
            if(nums1[i]!=-INF)
            {
                res=max(res,nums1[i]),cnt++;
            }
            else
            {
                if(res==nums2[0])
                {
                    ans+=cnt;
                }
                res=-INF,cnt=0;
            }
        }
        ans+=cnt;
    }
    cout<<ans;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr),cout.tie(nullptr);
    ll t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 12
• Subtask 3: 0 / 13
• Subtask 4: 0 / 23
• Subtask 5: 0 / 16
• Subtask 6: 0 / 22