oj.uz

Submission #971715

# Submission time Handle Problem Language Result Execution time Memory
971715 2024-04-29T08:09:51 Z batsukh2006 Rice Hub (IOI11_ricehub) C++17
0 / 100
 1000 ms 2400 KB 
#include<bits/stdc++.h>
using namespace std;
#define ss second
#define ff first
#define endl '\n'
int besthub(int r, int l, int x[], long long B){
	int ans=0;
	map<int,int> mp;
	for(int i=0; i<r; i++) mp[x[i]]++;
	for(int i=0; i<r; i++){
		int b=B;
		int sum=mp[x[i]];
		int lt=i-1,rt=i+1;
		while(lt>=0||rt<r){
			if(lt>=0&&(abs(x[i]-x[lt])<=abs(x[i]-x[rt])||rt==r)){
				if(abs(x[i]-x[lt])>b) break;
				sum++;
				mp[lt]--;
				b-=abs(x[i]-x[lt]);
				if(mp[lt]==0) lt--;
			}else{
				if(abs(x[i]-x[rt])>b) break;
				sum++;
				mp[rt]--;
				b-=abs(x[i]-x[rt]);
				if(mp[rt]==0) rt++;
			}
		}
		ans=max(ans,sum);
	}
	return ans;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1063 ms 2400 KB Time limit exceeded
2 Halted 0 ms 0 KB -