oj.uz

Submission #333412

# Submission time Handle Problem Language Result Execution time Memory
333412 2020-12-05T21:49:57 Z blue Rice Hub (IOI11_ricehub) C++11
49 / 100
 53 ms 2540 KB 
#include "ricehub.h"
#include <iostream>
#include <vector>
using namespace std;

int besthub(int R, int L, int X[], long long B) //fields, max coordinate, i'th field, budget
{
    int fields = R;

    vector<long long> F(R+2);
    F[0] = -(2e15 + 1); //Change to appropriate value when budget limit is chnaged
    F[R+1] = (4e15 + 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)
        {//l * * m m1 * r
            if(F[m+1] - F[m] > B)
            {
                l = m = r = m+1;
                c = 0;
                continue;
            }
            
            c += (F[m+1] - F[m]) * ((m - (l - 1)) - (r - m));
            m++;
            while(c > B)
            {
                c -= F[m] - F[l];
                l++;
            }
        }
        else break;
        res = max(res, r - l + 1);
    }
    return res;
}

Compilation message

ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:8:9: warning: unused variable 'fields' [-Wunused-variable]
    8 |     int fields = R;
      |         ^~~~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 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 0 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 0 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 0 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 1 ms 492 KB Output is correct
17 Correct 0 ms 364 KB Output is correct
18 Correct 0 ms 364 KB Output is correct
19 Correct 1 ms 396 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 0 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Incorrect 1 ms 364 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory 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 1 ms 364 KB Output is correct
6 Correct 1 ms 384 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 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 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 1 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 -

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 492 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 17 ms 1516 KB Output is correct
4 Correct 15 ms 1516 KB Output is correct
5 Correct 7 ms 876 KB Output is correct
6 Correct 7 ms 876 KB Output is correct
7 Correct 51 ms 1516 KB Output is correct
8 Correct 15 ms 1900 KB Output is correct
9 Correct 7 ms 1132 KB Output is correct
10 Correct 7 ms 1132 KB Output is correct
11 Correct 18 ms 2412 KB Output is correct
12 Correct 19 ms 2540 KB Output is correct
13 Correct 53 ms 1260 KB Output is correct
14 Correct 8 ms 1280 KB Output is correct
15 Correct 12 ms 2040 KB Output is correct
16 Correct 13 ms 2028 KB Output is correct
17 Correct 16 ms 2284 KB Output is correct
18 Correct 15 ms 2284 KB Output is correct
19 Correct 15 ms 2412 KB Output is correct
20 Correct 15 ms 2412 KB Output is correct