oj.uz

답안 #782709

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
782709 2023-07-14T08:09:11 Z JoenPoenMan 쌀 창고 (IOI11_ricehub) C++17
0 / 100
 1000 ms 2384 KB 
#include "ricehub.h"

#include <bits/stdc++.h>

using namespace std;

#define ALL(arr) begin(arr), end(arr)
#define CONTAINS(arr, val) (find(ALL(arr), val) == end(arr))

typedef pair<int, int> ii;

int besthub(int R, int L, int X[], long long B)
{
    vector<int> crs;
    long long cost = 0;
    int i = 0;
    int best = 0;
    int dc = 0;
    for (int x = 1; x <= L && i < R; x++)
    {
        while (crs.size() && i < R && (X[i]-x) <= crs[0]) {
            cost -= crs[0];
            crs.erase(crs.begin());
            crs.push_back(x - X[i]);
            cost += X[i]-x;
            dc -= 2;
            i++;
        }
        while (i < R && cost + (X[i]-x) < B) {
            crs.push_back(x - X[i]);
            cost += X[i]-x;
            dc--;
            i++;
        }
        best = max(best, (int)crs.size());
        for (int &el : crs) {
            if (el == 0) {
                dc += 2;
            } 
            el++;
        }
        cost += dc;
        while (cost > B) {
            cost -= crs[0];
            crs.erase(crs.begin());
            dc--;
        }
    }
    return best;
}

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 311 ms 312 KB Output is correct
5 Incorrect 1 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 524 KB Output is correct
2 Correct 9 ms 452 KB Output is correct
3 Correct 10 ms 2384 KB Output is correct
4 Execution timed out 1078 ms 2364 KB Time limit exceeded
5 Halted 0 ms 0 KB -