#include "ricehub.h"
#include <vector>
using namespace std;
int besthub(int R, int L, int X[], long long B) //fields, max coordinate, i'th field, budget
{
vector<long long> F(R+2);
F[0] = -(2e16 + 1);
F[R+1] = (4e16 + 1);
for(int i = 1; i <= R; i++) F[i] = X[i-1];
int l = 1; //leftmost field
int m = 1; //hub
int r = 1; //rightmost field
long long c = 0; //current cost
int res = 1; //running result
while(1)
{
if(F[r+1] - F[m] + c <= B)
{
c += F[r+1] - F[m];
r++;
}
else if(F[m] - F[l] > F[r+1] - F[m])
{
c -= (F[m] - F[l]);
l++;
}
else if(m == R) break;
else
{
c += (F[m+1] - F[m]) * ((m - (l - 1)) - (r - m));
m++;
}
res = max(res, r - l + 1);
}
return res;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
364 KB |
Output is correct |
2 |
Correct |
0 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
0 ms |
364 KB |
Output is correct |
5 |
Correct |
0 ms |
364 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
364 KB |
Output is correct |
2 |
Correct |
0 ms |
364 KB |
Output is correct |
3 |
Correct |
0 ms |
364 KB |
Output is correct |
4 |
Correct |
0 ms |
364 KB |
Output is correct |
5 |
Correct |
0 ms |
364 KB |
Output is correct |
6 |
Correct |
1 ms |
364 KB |
Output is correct |
7 |
Correct |
0 ms |
364 KB |
Output is correct |
8 |
Correct |
0 ms |
364 KB |
Output is correct |
9 |
Correct |
0 ms |
364 KB |
Output is correct |
10 |
Correct |
0 ms |
364 KB |
Output is correct |
11 |
Correct |
1 ms |
364 KB |
Output is correct |
12 |
Correct |
0 ms |
364 KB |
Output is correct |
13 |
Correct |
0 ms |
364 KB |
Output is correct |
14 |
Correct |
0 ms |
364 KB |
Output is correct |
15 |
Correct |
0 ms |
364 KB |
Output is correct |
16 |
Correct |
0 ms |
364 KB |
Output is correct |
17 |
Correct |
0 ms |
364 KB |
Output is correct |
18 |
Correct |
1 ms |
364 KB |
Output is correct |
19 |
Correct |
0 ms |
364 KB |
Output is correct |
20 |
Correct |
0 ms |
364 KB |
Output is correct |
21 |
Correct |
0 ms |
364 KB |
Output is correct |
22 |
Correct |
1 ms |
364 KB |
Output is correct |
23 |
Correct |
1 ms |
364 KB |
Output is correct |
24 |
Correct |
0 ms |
364 KB |
Output is correct |
25 |
Correct |
0 ms |
364 KB |
Output is correct |
26 |
Correct |
0 ms |
364 KB |
Output is correct |
27 |
Incorrect |
0 ms |
364 KB |
Output isn't correct |
28 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
0 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
5 |
Correct |
0 ms |
364 KB |
Output is correct |
6 |
Correct |
0 ms |
364 KB |
Output is correct |
7 |
Correct |
1 ms |
364 KB |
Output is correct |
8 |
Correct |
1 ms |
364 KB |
Output is correct |
9 |
Correct |
1 ms |
364 KB |
Output is correct |
10 |
Correct |
0 ms |
364 KB |
Output is correct |
11 |
Correct |
1 ms |
364 KB |
Output is correct |
12 |
Correct |
0 ms |
364 KB |
Output is correct |
13 |
Correct |
1 ms |
364 KB |
Output is correct |
14 |
Correct |
1 ms |
364 KB |
Output is correct |
15 |
Correct |
1 ms |
364 KB |
Output is correct |
16 |
Correct |
0 ms |
364 KB |
Output is correct |
17 |
Correct |
1 ms |
364 KB |
Output is correct |
18 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
19 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
492 KB |
Output is correct |
2 |
Correct |
5 ms |
492 KB |
Output is correct |
3 |
Correct |
16 ms |
1536 KB |
Output is correct |
4 |
Correct |
17 ms |
1516 KB |
Output is correct |
5 |
Correct |
12 ms |
876 KB |
Output is correct |
6 |
Correct |
7 ms |
876 KB |
Output is correct |
7 |
Correct |
14 ms |
1516 KB |
Output is correct |
8 |
Correct |
18 ms |
1516 KB |
Output is correct |
9 |
Correct |
8 ms |
876 KB |
Output is correct |
10 |
Correct |
7 ms |
876 KB |
Output is correct |
11 |
Correct |
18 ms |
1516 KB |
Output is correct |
12 |
Correct |
26 ms |
1516 KB |
Output is correct |
13 |
Correct |
10 ms |
876 KB |
Output is correct |
14 |
Correct |
8 ms |
876 KB |
Output is correct |
15 |
Correct |
12 ms |
1132 KB |
Output is correct |
16 |
Correct |
12 ms |
1132 KB |
Output is correct |
17 |
Correct |
14 ms |
1388 KB |
Output is correct |
18 |
Correct |
17 ms |
1664 KB |
Output is correct |
19 |
Correct |
21 ms |
1388 KB |
Output is correct |
20 |
Correct |
16 ms |
1364 KB |
Output is correct |