oj.uz

Submission #830025

# Submission time Handle Problem Language Result Execution time Memory
830025 2023-08-18T17:42:50 Z OAleksa Rice Hub (IOI11_ricehub) C++14
42 / 100
 1000 ms 1364 KB 
#include <bits/stdc++.h>
#include "ricehub.h"
#define f first
#define s second
using namespace std; 

int besthub(int R, int L, int X[], long long B)
{
  	int n = R;
  	int a[n];
  	for(int i = 0;i < n;i++)
  		a[i] = X[i];
	int ans = 0;
	for(int i = 0;i < n;i++) {
		multiset<int> st;
		for(int j = 0;j < n;j++)
			st.insert(abs(a[j] - a[i]));
		int res = 0;
		long long t = 0;
		for(auto x : st) {
			if(t + x <= B) {
				t += x;
				++res;
			}
			else
				break;
		}
		ans = max(ans, res);
	}
	return ans;
  	// set<int> levo, desno;
  	// long long t = 0;
  	// desno.insert(0);
  	// for(int i = 1;i < n;i++) {	
  		// if(t + a[i] - a[0] <= B) {
  			// desno.insert(i);
  			// t += a[i] - a[0];
  			// ++ans;
  		// }
  	// }
  	// for(int i = 1;i < n;i++) {
  		// t -= ((int)desno.size() - 1) * (a[i] - a[i - 1]);
  		// t += ((int)levo.size() + 1) * (a[i] - a[i - 1]);
  		// if(desno.size() > 0)
  			// desno.erase(desno.begin());
  		// desno.insert(i);
  		// levo.insert(i - 1);
  		// while(levo.size() > 0 && t > B) {
  			// int x = *levo.begin();
  			// t -= (a[i] - a[x]);
  			// levo.erase(levo.begin());
  		// }
  		// int j = *--desno.end() + 1;
  		// while(j < n) {
  			// if(t + a[j] - a[i] <= B) {
  				// t += a[j] - a[i];
  				// desno.insert(j++);
  			// }
  			// else	
  				// break;
  		// }
  		// while(j < n && levo.size() > 0) {
  			// int x = *levo.begin();
  			// if(t - (a[i] - a[x]) + a[j] - a[i] <= B) {
  				// t =  t - (a[i] - a[x]) + a[j] - a[i];
  				// levo.erase(levo.begin());
  				// desno.insert(a[j++]);
  			// }
  			// else
  				// break;
  		// }
  		// ans = max(ans, (int)levo.size() + (int)desno.size());
  	// }
  	// return ans;
}

// signed main()
// {
	// ios_base::sync_with_stdio(false);
	// cin.tie(0);
	// cout.tie(0);
	// int tt = 1;
	// //cin >> tt;
	// while(tt--) {
		 // int n, k;
		 // long long x;
		 // cin >> n >> k >> x;
		 // int a[n];
		 // for(int i = 0;i < n;i++)
		 	// cin >> a[i];
		// cout << besthub(n, k, a, x);
	// }
   // return 0;
// }

Subtask #1
17.0 / 17.0

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

Subtask #2
25.0 / 25.0

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

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct
2 Correct 2 ms 212 KB Output is correct
3 Correct 40 ms 340 KB Output is correct
4 Correct 37 ms 340 KB Output is correct
5 Correct 11 ms 336 KB Output is correct
6 Correct 11 ms 328 KB Output is correct
7 Correct 46 ms 348 KB Output is correct
8 Correct 46 ms 348 KB Output is correct
9 Correct 12 ms 336 KB Output is correct
10 Correct 12 ms 212 KB Output is correct
11 Correct 32 ms 340 KB Output is correct
12 Correct 32 ms 340 KB Output is correct
13 Correct 59 ms 344 KB Output is correct
14 Correct 57 ms 340 KB Output is correct
15 Correct 19 ms 340 KB Output is correct
16 Correct 13 ms 212 KB Output is correct
17 Correct 35 ms 340 KB Output is correct
18 Correct 35 ms 340 KB Output is correct
19 Correct 58 ms 348 KB Output is correct
20 Correct 56 ms 348 KB Output is correct
21 Execution timed out 1089 ms 596 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

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