Submission #707328

#	Time	Username	Problem	Language	Result	Execution time	Memory
707328		mseebacher	Rice Hub (IOI11_ricehub)	C++17	0 / 100	543 ms	516 KiB

ricehub

//#include <bits/stdc++.h>
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <functional>
#include <iostream>
#include <fstream>
#include <string>
using namespace std;

#define mp make_pair
#define f first
#define s second
#define pb push_back

typedef long long ll;
typedef long double lld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;

const lld pi = 3.14159265358979323846;

#define MAXI (int)2e5+5


int besthub(int r,int l,int x[],ll b){
	int ans = 0;
	ll pref[r+1];
	pref[0] = 0;
	for(int i = 1;i<=r;i++){
		pref[i] = pref[i-1] + x[i-1];
	}
  	for(int i = 1;i<=r;i++){
		for(int j = i;j<=r;j++){
			int mid = (i+j) >> 1;
			ll cost = (ll)(mid-i+1)*x[mid-1]-pref[mid]-pref[i-1]; // Seg unten
			cost += (ll)pref[j]-pref[mid]-(j-mid)*x[mid-1]; // seg oben
			if(cost <= b) ans = max(j-i+1,ans);
		}
	}
	
	return ans;
}

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