oj.uz

Submission #333450

# Submission time Handle Problem Language Result Execution time Memory
333450 2020-12-06T04:07:57 Z blue Rice Hub (IOI11_ricehub) C++11
17 / 100
 19 ms 2540 KB 
#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
{
    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(m < R)
        {//l * * m m1 * r

            c += (F[m+1] - F[m]) * ((m - (l - 1)) - (r - m));
            m++;
            while(c > B)
            {
                c -= F[m] - F[l];
                l++;
            }
        }
        else if(F[m] - F[l] > F[r+1] - F[m])
        {
            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:7:9: warning: unused variable 'fields' [-Wunused-variable]
    7 |     int fields = R;
      |         ^~~~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory 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

Subtask #2
0 / 25.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 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 376 KB Output is correct
7 Correct 1 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 0 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 Incorrect 0 ms 364 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory 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 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 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 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 Incorrect 1 ms 364 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 620 KB Output is correct
2 Correct 3 ms 620 KB Output is correct
3 Correct 17 ms 2540 KB Output is correct
4 Correct 19 ms 2540 KB Output is correct
5 Correct 7 ms 1260 KB Output is correct
6 Correct 7 ms 1260 KB Output is correct
7 Correct 15 ms 2284 KB Output is correct
8 Correct 15 ms 2284 KB Output is correct
9 Correct 7 ms 1152 KB Output is correct
10 Correct 7 ms 1132 KB Output is correct
11 Correct 17 ms 2540 KB Output is correct
12 Correct 18 ms 2540 KB Output is correct
13 Incorrect 8 ms 1260 KB Output isn't correct
14 Halted 0 ms 0 KB -