Submission #833809

#	Time	Username	Problem	Language	Result	Execution time	Memory
833809		vjudge1	Exam (eJOI20_exam)	C++17	0 / 100	1 ms	340 KiB

exam

#include<bits/stdc++.h>
#define ll long long
#define endl "\n"
#define pb push_back
#define pf push_front
#define p push
#define q queue
#define popf pop_front()
#define popb pop_back()
#define dq deque
#define fi first
#define se second
#define ve vector
#define lb lower_bound
#define ub upper_bound
#define pq priority_queue
#define st stack
#define rep(i,a,b) for (ll i=a; i<b; i++)
#define rept(i,a,b) for (ll i=a; i<=b; i++)
#define repr(i,a,b) for (ll i=a; i>=b; i--)
#define ppi pair<ll,ll>
#define test cout<<"A"<<endl

using namespace std;

int main(){
	ios_base::sync_with_stdio(false);
//    cin.tie(NULL);
    
	ll n;
	cin>>n;
	ve<ll> H(n);
	ve<ll> T(n);
	ll sta, end;
	sta = n;
	end = 0;
	rep(i,0,n){
		cin>>H[i];
	}
	ll ans = 0;
	bool ada =false;
	rep(i,0,n){
		cin>>T[i];
		if (T[i] == H[i]){
			ada = true;
			sta = min(sta, i);
			end = max(end, i);
		}
	}
	if (!ada){
		cout<<0<<endl;
	}
	rept(i, sta, end){
		 if (H[i] <= T[i]){
		 	ans++;
		 }
	}
	repr(i, sta-1, 0){
		 if (H[i] <= T[i]){
		 	ans++;
		 } else{
		 	break;
		 }
	}
	rep(i, end+1, n){
		 if (H[i] <= T[i]){
		 	ans++;
		 } else {
		 	break;
		 }
	}
	cout<<ans<<endl;
    
    return 0;
}

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