제출 #869586

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
869586		LucaLucaM	Stone Arranging 2 (JOI23_ho_t1)	C++17	0 / 100	2077 ms	348 KiB

Main

#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
#include <cstring>
#include <functional>
#include <set>
#include <stack>
#warning That's the baby, that's not my baby

typedef long long ll;

bool inside (std::tuple<int, int, int> a, std::tuple<int, int, int> b) {
  return ((std::get<0>(a) <= std::get<0>(b)) && (std::get<1>(b) <= std::get<1>(a)));
}

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

  int n;
  std::cin >> n;
  int a[n];
  std::stack<int> st;
  std::set<int> inStack;
  std::vector<std::tuple<int, int, int>> updates;

  for (int i = 0; i < n; i++) {
    std::cin >> a[i];
    if (inStack.count(a[i])) {
      while (a[st.top()] != a[i]) {
        inStack.erase(a[st.top()]);
        st.pop();
      }
      std::tuple<int, int, int> cur = {st.top() + 1, i - 1, a[i]};
      while (!updates.empty() && inside(updates.back(), cur)) {
        updates.pop_back();
      }
      if (!updates.empty()) {
        assert(std::get<1>(cur) == i - 1);
        assert(i - 1 > std::get<1>(updates.back()));
      }
      while (!updates.empty() && inside(cur, updates.back()));
      updates.push_back(cur);
      st.pop();
      st.push(i);
    } else {
      inStack.insert(a[i]);
      st.push(i);
    }
  }

  int sumLen = 0;
  for (const auto &[l, r, v] : updates) {
    sumLen += r - l + 1;
//    std::cout << l << ' ' << r << ' ' << v << '\n';
//    assert(sumLen <= n);
  }

  for (const auto &[l, r, v] : updates) {
    for (int i = l; i <= r; i++) {
      a[i] = v;
    }
  }

  for (int i = 0; i < n; i++) {
    std::cout << a[i] << '\n';
  }

  return 0;
}

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

Main.cpp:9:2: warning: #warning That's the baby, that's not my baby [-Wcpp]
    9 | #warning That's the baby, that's not my baby
      |  ^~~~~~~

• Subtask 1: 0 / 25
• Subtask 2: 0 / 35
• Subtask 3: 0 / 40