Submission #1214395

#	Time	Username	Problem	Language	Result	Execution time	Memory
1214395		Warinchai	Exam (eJOI20_exam)	C++20	12 / 100	15 ms	6924 KiB

exam

#include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
int a[200005];
int b[200005];
vector<int>id[200005];
vector<int>v;
vector<pair<int,int>>op;
int n;

struct fenwick{
    int info[100005];
    void upd(int id,int val){
        for(int i=id;i<=n;i+=i&-i)info[i]=max(info[i],val);
    }
    int fans(int id){
        int ans=0;
        for(int i=id;i>0;i-=i&-i)ans=max(ans,info[i]);
        return ans;
    }
}fw;

int qr[5005][5005];
int dp[5005];
int mx[20][100005];
int lg[100005];

int fmx(int l,int r){
    int x=lg[r-l+1];
    //cerr<<"qr:"<<l<<' '<<r<<" "<<max(mx[x][l],mx[x][r-(1<<x)])<<"\n";
    return max(mx[x][l],mx[x][r-(1<<x)+1]);
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i],v.push_back(a[i]);
    for(int i=1;i<=n;i++)cin>>b[i],v.push_back(b[i]);
    int val=b[1];
    int yes=0;
    int cnt=0;
    int ans=0;
    for(int i=1;i<=n;i++){
        if(a[i]==val)yes=1;
        else if(a[i]>val){
            if(yes)ans+=cnt;
            cnt=0;
            yes=0;
        }
        if(a[i]<=val)cnt++;
    }
    if(yes)ans+=cnt;
    cout<<ans;
    return 0;
}

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