Submission #707312

#	Time	Username	Problem	Language	Result	Execution time	Memory
707312		mseebacher	Rice Hub (IOI11_ricehub)	C++17	17 / 100	1039 ms	340 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;
	for(int i = 0;i<r;i++){
		for(int j = i;j<r;j++){
			ll cost = 0;
			for(int h = i;h<=j;h++){
				int mid = (i+j) >> 1;
				cost += abs(x[mid]-x[h]);
			}
			if(cost < b) ans = max(j-i+1,ans);
		}
	}
	
	return ans;
}

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