제출 #976590

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
976590		marinaluca	쌀 창고 (IOI11_ricehub)	C++14	100 / 100	9 ms	2676 KiB

ricehub

#include <bits/stdc++.h>

#pragma GCC optimize ("O4")
#pragma GCC optimize ("fast-math")
#pragma GCC optimize ("unroll-loops")

using namespace std;
//#define int long long
#define ll long long
#define xx first
#define yy second
#define all (x) begin(x), end(x)
#define FOR(i, a, b) for (auto i = (a); i < (b); ++ i)

int besthub (int R, int L, int X[], ll B){
    ll sum = 0;
    int maxi = 1;
    for (int st = 0, dr = 0; dr < R; ++ dr){
        sum += X[dr] - X[(st + dr) >> 1];
        while (sum > B){
            sum -= (X[(st + dr + 1) >> 1] - X[st ++]);
        }
        maxi = max (maxi, dr - st + 1);
    }
    return maxi;
}

컴파일 시 표준 에러 (stderr) 메시지

ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:21:50: warning: operation on 'st' may be undefined [-Wsequence-point]
   21 |             sum -= (X[(st + dr + 1) >> 1] - X[st ++]);
      |                                               ~~~^~
ricehub.cpp:21:50: warning: operation on 'st' may be undefined [-Wsequence-point]

• Subtask 1: 17 / 17
• Subtask 2: 25 / 25
• Subtask 3: 26 / 26
• Subtask 4: 32 / 32