oj.uz

Submission #96397

# Submission time Handle Problem Language Result Execution time Memory
96397 2019-02-09T09:36:05 Z mohammad Rice Hub (IOI11_ricehub) C++14
0 / 100
 5 ms 504 KB 
#include "ricehub.h"
#include "iostream"
#include "vector"
#include "map"
#include "math.h"
#include "string"
#include "algorithm"
#include "set"
#include <iterator>
#include <string.h>
#include <queue>
#include <list>

using namespace	std;

typedef long long ll ;
const ll M = 998244353  ;
const ll oo = 1e13 ;

int cost[100010];

int besthub(int R, int L, int X[], long long B){
	int ans = 1 ;
	for(int i = 1 ; i < R ; ++i){
		cost[i] = X[i] - X[i - 1] ;
	}
	int co = 1 ;
	ll c = 0 ;
	for(int i = 0 ; i < R - 1 ; ++i){
		c += cost[i];
		if(c > B){
			ans = max(ans , co);
			c = cost[i] ;
			co = 1 ;
			if(c > B){
				ans = max(ans , co);
				c = 0 ;
				co = 0 ;
			}
		}
		co++;
	}
	ans = max(ans , co);
	return ans;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 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 256 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 380 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

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