Submission #1191104

#	Time	Username	Problem	Language	Result	Execution time	Memory
1191104		lopkus	거래 (IZhO13_trading)	C++20	0 / 100	0 ms	320 KiB

trading

#include <bits/stdc++.h>

void solve() {
  int n, m;
  std::cin >> n >> m;
  std::vector<int> l(n + 1), r(n + 1), x(n + 1);
  for(int i = 1; i <= m; i++) {
    std::cin >> l[i] >> r[i] >> x[i];
  }
  std::vector<int> ans(n + 1, 0);
  for(int i = 1; i <= m; i++) {
    for(int j = l[i]; j <= r[i]; j++) {
      ans[j] = std::max(ans[j], x[i]++);
    }
  }
  for(int i = 1; i <= n; i++) {
    std::cout << ans[i] << " "[i == n];
  }
}

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

  int t = 1;
  //std::cin >> t;
  while (t--) {
      solve();
  }

  return 0;
}

• Subtask 1: 0 / 100