oj.uz

Submission #62061

# Submission time Handle Problem Language Result Execution time Memory
62061 2018-07-27T11:16:02 Z aome Rice Hub (IOI11_ricehub) C++17
0 / 100
 5 ms 740 KB 
#include "ricehub.h"

#include <bits/stdc++.h>

using namespace std;

int besthub(int R, int L, int X[], long long B) {
	int ptr = 0, res = 0;
	for (int i = 0; i < R; ++i) {
		while (ptr < R && 3 * (X[ptr] - X[i]) <= 2 * B) ptr++;
		res = max(res, ptr - i);
	}
	return res;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Incorrect 3 ms 468 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 548 KB Output is correct
2 Correct 3 ms 548 KB Output is correct
3 Correct 3 ms 548 KB Output is correct
4 Incorrect 3 ms 596 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

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