oj.uz

Submission #28833

# Submission time Handle Problem Language Result Execution time Memory
28833 2017-07-17T09:33:19 Z dereotu Rice Hub (IOI11_ricehub) C++14
42 / 100
 309 ms 7104 KB 
#include "ricehub.h"
#include <bits/stdc++.h>
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define forr(i,A,B) for(int i=A;i<B;++i)
#define space ' '
#define endl '\n'
#define LL long long
using namespace std;

int a[100005],ans;
vector<pair<int,int> > arr(100005);
//sonraki arrayi tutmayı denemelisin line 39
int besthub(int R, int L, int X[], long long B){
	if(L<=10000){
		forr(i,0,L){
			int b=0,h=0;
			memset(a,0,sizeof a);
			forr(j,0,R){
				a[j]=abs(X[j]-i);
			}
			sort(a,a+R);
			forr(j,0,R){
				if(b+a[j]<=B){
					b+=a[j];
					h++;
				}
				else break;
			}
			ans=max(ans,h);
		}
	 	return ans;
	 }
	 else{
	 	int b=0,left=0,right=0,ontop=0,h=0;
	 	forr(i,0,R){
	 		arr.clear();
	 		forr(j,0,R){
	 			arr[j].st=abs(X[j]-X[i]);
	 			if(X[j]-X[i]>0) arr[j].nd=1;
	 			else if(X[j]-X[i]<0) arr[j].nd=-1;
	 			else arr[j].nd=0;
	 		}
	 		sort(arr.begin(),arr.end());
	 		forr(j,0,R){
				if(b+arr[j].nd<=B){
					b+=arr[j].st;
					if(arr[j].nd==1) right++;
					else if(arr[j].nd==-1) left++;
					else ontop++;
					h++;
				}
				else break;
			}
			ans=max(ans,h);
			if(right-left>=2){
				i+=(right-left)/2;
				i--;
			}
	 	}
	 	return ans;
	 }
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 7104 KB Output is correct
2 Correct 3 ms 7104 KB Output is correct
3 Correct 3 ms 7104 KB Output is correct
4 Correct 3 ms 7104 KB Output is correct
5 Correct 0 ms 7104 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7104 KB Output is correct
2 Correct 0 ms 7104 KB Output is correct
3 Correct 9 ms 7104 KB Output is correct
4 Correct 9 ms 7104 KB Output is correct
5 Correct 19 ms 7104 KB Output is correct
6 Correct 19 ms 7104 KB Output is correct
7 Correct 19 ms 7104 KB Output is correct
8 Correct 19 ms 7104 KB Output is correct
9 Correct 0 ms 7104 KB Output is correct
10 Correct 0 ms 7104 KB Output is correct
11 Correct 0 ms 7104 KB Output is correct
12 Correct 0 ms 7104 KB Output is correct
13 Correct 0 ms 7104 KB Output is correct
14 Correct 0 ms 7104 KB Output is correct
15 Correct 19 ms 7104 KB Output is correct
16 Correct 23 ms 7104 KB Output is correct
17 Correct 0 ms 7104 KB Output is correct
18 Correct 0 ms 7104 KB Output is correct
19 Correct 19 ms 7104 KB Output is correct
20 Correct 19 ms 7104 KB Output is correct
21 Correct 23 ms 7104 KB Output is correct
22 Correct 26 ms 7104 KB Output is correct
23 Correct 273 ms 7104 KB Output is correct
24 Correct 306 ms 7104 KB Output is correct
25 Correct 306 ms 7104 KB Output is correct
26 Correct 309 ms 7104 KB Output is correct
27 Correct 289 ms 7104 KB Output is correct
28 Correct 279 ms 7104 KB Output is correct

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

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