Submission #805312

#	Time	Username	Problem	Language	Result	Execution time	Memory
805312		Halym2007	Rice Hub (IOI11_ricehub)	C++11	17 / 100	1088 ms	1492 KiB

ricehub

#include <bits/stdc++.h>
using namespace std;
#define ll long long
map <int, int> m;
vector <int> v;
int besthub(int R, int L, int X[], ll B) {
	for (int i = 0; i < R; ++i) {
		m[X[i]] = 1;
	}
	int jog = 0, ans;
	ll op;

	for (int i = 1; i <= L; ++i) {
		op = 0;
		ans = 0;
		for (int j = 1; j <= L; ++j) {
			if (m.find (j) != m.end()) {
				v.push_back ({abs (i - j)});
			}
		}
		sort (v.begin(), v.end());
		for (int i : v) {
			op += i;
			if (op > B) break;
			ans++;
		}
		jog = max (jog, ans);
		v.clear();
	}
	return jog;
}
//int main() {
//	 freopen("kk.txt", "r", stdin);
//	int R, L;
//	ll B;
//	cin >> R >> L >> B;
//	int X[R];
//	for (int i = 0; i < R; ++i) {
//		cin >> X[i];
//	}
//	cout << besthub (R, L, X, B);
//}

• Subtask 1: 17 / 17
• Subtask 2: 0 / 25
• Subtask 3: 0 / 26
• Subtask 4: 0 / 32