oj.uz

Submission #707311

# Submission time Handle Problem Language Result Execution time Memory
707311 2023-03-08T18:33:51 Z mseebacher Rice Hub (IOI11_ricehub) C++17
0 / 100
 1000 ms 468 KB 
//#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+1;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
0 / 17.0

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

Subtask #2
0 / 25.0

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

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 108 ms 300 KB Output is correct
4 Correct 110 ms 300 KB Output is correct
5 Incorrect 19 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

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