제출 #1113550

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1113550		dynam1c	Naval battle (CEOI24_battle)	C++17	30 / 100	473 ms	9056 KiB

Main

#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<tuple<int, int, char, int>> ships(n);
  int ii = 0;
  for (auto& [x, y, c, i] : ships)
    cin >> x >> y >> c, i = ii++;
  sort(ships.begin(), ships.end(),
    [&](tuple<int, int, char, int> a, tuple<int, int, char, int> b) {
      auto [x1, y1, c1, i1] = a;
      auto [x2, y2, c2, i2] = b;
      if (x1+y1 < x2+y2)
        return true;
      if (x1+y1 > x2+y2)
        return false;
      return x1 < x2;
    });

  int prev = 0;
  stack<int> st;
  vector<bool> sunk(n);
  for (auto& [x, y, c, i] : ships) {
    if (x+y != prev)
      st = stack<int>{};
    prev = x+y;

    if (c == 'E')
      st.push(i);
    else if (!st.empty())
      sunk[i] = true, sunk[st.top()] = true, st.pop();
  }

  for (int i = 0; i < n; i++)
    if (!sunk[i])
      cout << i+1 << endl;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 6
• Subtask 2: 0 / 12
• Subtask 3: 0 / 8
• Subtask 4: 0 / 11
• Subtask 5: 0 / 9
• Subtask 6: 30 / 30
• Subtask 7: 0 / 24