oj.uz

답안 #1051513

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1051513 2024-08-10T07:41:31 Z NeroZein Fire (BOI24_fire) C++17
0 / 100
 19 ms 5008 KB 
#include "bits/stdc++.h"
using namespace std;

#ifdef Nero
#include "Deb.h"
#else
#define debug(...)
#endif

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, m;
  cin >> n >> m;
  vector<int> s(n), e(n);
  vector<int> normal;
  vector<int> non_normal;
  
  for (int i = 0; i < n; ++i) {
    cin >> s[i] >> e[i];
    if (s[i] <= e[i]) {
      normal.push_back(i);
    } else {
      assert(e[i] == 0);
      non_normal.push_back(i); 
    }
  }
  
  sort(normal.begin(), normal.end(), [&](int i, int j) {
    return s[i] < s[j];
  });
  
  int res = 0;
  int lst = 0; 
  for (int i = 0, mx = 0; i < (int) normal.size(); ++i) {
    
    if (s[normal[i]] > lst) {
      if (mx < s[normal[i]]) {
        break; 
      } else {
        res++; 
        lst = mx; 
        mx = max(mx, e[normal[i]]);
      }
    } else {
      mx = max(mx, e[normal[i]]);
    }
    if (i == (int) normal.size() - 1) {
      lst = mx; 
      res++;
    }
  }
  if (lst < m - 1) {
    res = n + 1; 
  }
  
  int ans = res; 
  int ind = 0;
  for (int i = 0; i < (int) non_normal.size(); ++i) {
    if (s[non_normal[i]] < s[non_normal[ind]]) {
      ind = i; 
    }
  }
  if (!non_normal.empty()) {
    for (int i = ind; i <= ind; ++i) {
      
      vector<pair<int, int>> ranges;
      for (int j = 0; j < (int) non_normal.size(); ++j) {
        if (i != j) {
          ranges.push_back({0, e[non_normal[j]]});
        }
      }
      
      for (int j = 0; j < (int) normal.size(); ++j) {
        ranges.push_back({s[normal[j]], e[normal[j]]});
      }
      
      sort(ranges.begin(), ranges.end()); 
      res = 1;
      lst = e[non_normal[i]];
      
      for (int j = 0, mx = e[non_normal[i]]; j < (int) ranges.size() && lst < s[non_normal[i]]; ++j) {
        auto [l, r] = ranges[j];
        if (l > lst) {
          if (mx < min(l, s[non_normal[i]])) {
            break;
          } else {
            res++;
            lst = mx; 
            mx = max(mx, r); 
          }
        } else {
          mx = max(mx, r); 
        }
        if (j == (int) ranges.size() - 1 && lst < s[non_normal[i]]) {
          lst = mx;
          res++; 
        }
      }
      if (lst < s[non_normal[i]]) {
        res = n + 1; 
      }
      ans = min(ans, res); 
    }
  }
    if (ans > n) {
      ans = -1; 
    }
  cout << ans << '\n';
  return 0;
}

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 0 ms 600 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 0 ms 600 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 0 ms 600 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Incorrect 19 ms 5008 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Runtime error 0 ms 604 KB Execution killed with signal 6
4 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 0 ms 600 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -