제출 #1193706

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1193706		avighna	Snail (NOI18_snail)	C++20	100 / 100	1 ms	328 KiB

snail

#include <bits/stdc++.h>

int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int64_t h;
  int n;
  std::cin >> h >> n;
  std::vector<int64_t> p(n);
  for (auto &i : p) {
    std::cin >> i;
  }

  int64_t cur = 0;
  std::vector<bool> seen(n);
  int64_t orig = -1;
  for (int64_t day = 0;; day++) {
    bool seen_anything = false;
    for (int i = 0; i < n; ++i) {
      if (cur == 0 and seen[i]) {
        std::cout << "-1 -1\n";
        return 0;
      }
      if (cur == 0) {
        seen[i] = seen_anything = true;
      }
      if ((cur = std::max(int64_t(0), cur + p[i])) >= h) {
        std::cout << day << ' ' << i << '\n';
        return 0;
      }
    }
    orig++;
    if (!seen_anything) {
      break;
    }
  }

  int64_t sum = cur;
  std::pair<int64_t, int> max_sum = {-1, -1};
  for (int i = 0; i < n; ++i) {
    sum += p[i];
    max_sum = std::max(max_sum, {sum, i});
  }
  auto ceil_div = [](int64_t a, int64_t b) { return (a + b - 1) / b; };
  int64_t day = ceil_div(h - cur - (max_sum.first - cur), sum - cur) + 1;
  int64_t cur_pos = cur + (sum - cur) * (day - 1);
  for (int i = 0; i < n; ++i) {
    cur_pos += p[i];
    if (cur_pos >= h) {
      std::cout << day + orig << ' ' << i << '\n';
      return 0;
    }
  }
}

• Subtask 1: 11 / 11
• Subtask 2: 9 / 9
• Subtask 3: 25 / 25
• Subtask 4: 17 / 17
• Subtask 5: 38 / 38