Submission #1081368

#	Time	Username	Problem	Language	Result	Execution time	Memory
1081368		LCJLY	Fish 2 (JOI22_fish2)	C++14	0 / 100	2 ms	3676 KiB

fish2

#include <bits/stdc++.h>
using namespace std;

#define int long long 
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<int,int>pii;
typedef pair<pii,int>pi2;
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

int arr[505];
int	prefix[505];

void solve(){ 	
	int n;
	cin >> n;
	
	int lft[n+5];
	int rgt[n+5];
	for(int x=1;x<=n;x++){
		cin >> arr[x];
		prefix[x]=prefix[x-1]+arr[x];
		lft[x]=rgt[x]=x;
	}
	
	int q;
	cin >> q >> q >> q;
	
	int counter=0;
	for(int x=1;x<=n;x++){
		while(lft[x]>=1||rgt[x]>=n){
			if(lft[x]>1&&prefix[rgt[x]]-prefix[lft[x]-1]>=arr[lft[x]-1]){
				//eat lft
				int hold=lft[x]-1;
				lft[x]=min(lft[x],lft[hold]);
				rgt[x]=max(rgt[x],rgt[hold]);
			}
			else if(rgt[x]<n&&prefix[rgt[x]]-prefix[lft[x]-1]>=arr[rgt[x]+1]){
				int hold=rgt[x]+1;
				lft[x]=min(lft[x],lft[hold]);
				rgt[x]=max(rgt[x],rgt[hold]);
			}	
			else break;
		}
		if(lft[x]==1&&rgt[x]==n) counter++;
	}
	cout << counter << "\n";
}

int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t=1;
	//cin >> t;
	//freopen("in.txt","r",stdin);
	while(t--){
		solve();
	}
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 8
• Subtask 3: 0 / 12
• Subtask 4: 0 / 23
• Subtask 5: 0 / 35
• Subtask 6: 0 / 17