제출 #36936

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

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5 + 1;

int n, x[N];
ll limit, s[N];

int besthub(int _n, int M, int _x[], ll _limit) {
  n = _n, limit = _limit;
  copy(_x, _x + n, x + 1);
  for(int i = 1; i <= n; i++) s[i] = s[i-1] + x[i];
  int l = 1, r = n;
  while (l < r) {
    int mid = l+r+1 >> 1;
    bool valid = false;
    // cout << mid << ":\n";
    int llen = mid-1 >> 1, rlen = mid >> 1;;
    for(int i = llen + 1; i <= n - rlen; i++) {
       ll resl = 1ll * llen * x[i] - (s[i-1] - s[i - llen - 1]);
       ll resr = s[i + rlen]  - s[i] - 1ll * rlen * x[i];
      //  cout << i << ' ' << resl << ' ' << resr << endl;
       valid |= resl + resr <= limit;
    }
    if (valid) l = mid;
    else r = mid - 1;
  }
  return l;
}

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

ricehub.cpp: In function 'int besthub(int, int, int*, ll)':
ricehub.cpp:16:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int mid = l+r+1 >> 1;
                  ^
ricehub.cpp:19:19: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
     int llen = mid-1 >> 1, rlen = mid >> 1;;
                   ^

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