oj.uz

Submission #121015

# Submission time Handle Problem Language Result Execution time Memory
121015 2019-06-26T02:39:39 Z turbat Rice Hub (IOI11_ricehub) C++14
0 / 100
 6 ms 760 KB 
    #include <bits/stdc++.h>
    #include "ricehub.h"
    using namespace std;
     
    long long s[100005];
     
    long long can(int l, int r){
    	int mid = (l + r) / 2;
    	if ((r - l) % 2) return s[r] + s[l - 1] - 2 * s[mid];		
    	return s[r] + s[l - 1] - s[mid] - s[mid + 1];
    }
     
    int besthub(int R, int L, int X[], long long B){
    	int ans = 0;
    	for (int i = 1;i <= R;i++) s[i] = s[i - 1] + X[i - 1];
    	for (int i = 1;i <= R;i++){
    		int l = i, r = R, mid;
    		while (l != r){
    			mid = (l + r + 1) / 2;
    			if (can(l, mid) <= B) l = mid;
    			else r = mid - 1;
    		}
    		ans = max(ans, l - i + 1);
    	}
      return ans;
    }

Subtask #1
0 / 17.0

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

Subtask #2
0 / 25.0

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

Subtask #3
0 / 26.0

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

Subtask #4
0 / 32.0

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