oj.uz

답안 #294839

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
294839 2020-09-09T09:54:37 Z shrek12357 쌀 창고 (IOI11_ricehub) C++14
17 / 100
 1000 ms 1040 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <fstream>
#include <queue>
#include "ricehub.h"
using namespace std;
 
bool tern(int lo, int hi, vector<long long> pre, long long b, int s1, int s2) {
	if (hi - lo == 1) {
		long long val1 = pre[hi + 1] - pre[hi] - pre[lo + 1] + pre[lo];
		return val1 <= b;
	}
	while (hi >= lo) {
		int mid1 = lo + (hi - lo) / 3;
		int mid2 = hi - (hi - lo) / 3;
		long long val1 = pre[s2 + 1] - pre[mid1 + 1] - (s2- mid1)*(pre[mid1 + 1] - pre[mid1]) + (mid1 - s1)*(pre[mid1 + 1] - pre[mid1]) - pre[mid1] + pre[s1];
		long long val2 = pre[s2 + 1] - pre[mid2 + 1] - (s2 - mid2)*(pre[mid2 + 1] - pre[mid2]) + (mid2 - s1)*(pre[mid2 + 1] - pre[mid2]) - pre[mid2] + pre[s1];
		if (val1 <= b) {
			return true;
		}
		if (val2 <= b) {
			return true;
		}
		if (val1 < val2) {
			hi = mid2 - 1;
		}
		else if (val1 > val2) {
			lo = mid1 + 1;
		}
		else {
			lo = mid1 + 1;
			hi = mid2 - 1;
		}
	}
	return false;
}
 
bool check(int r, int mid, vector<long long> pre, long long b) {
	if (mid == 0) {
		return true;
	}
	for (int i = mid - 1; i < r; i++) {
		if (tern(i - (mid - 1), i, pre, b, i - (mid - 1), i)) {
			return true;
		}
	}
	return false;
}
 
int besthub(int r, int l, int x[], long long b) {
	int lo = 0;
	int hi = r - 1;
	int best = 0;
	vector<long long> pre;
	pre.push_back(0);
	for (int i = 0; i < r; i++) {
		pre.push_back(pre[i] + x[i]);
	}
	while (hi >= lo) {
		int mid = (hi + lo) / 2;
		if (check(r, mid, pre, b)) {
			best = max(best, mid);
			lo = mid + 1;
		}
		else {
			hi = mid - 1;
		}
	}
	//cout << best << endl;
	return best;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Incorrect 0 ms 256 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Incorrect 1 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1088 ms 1040 KB Time limit exceeded
2 Halted 0 ms 0 KB -