Submission #953562

#TimeUsernameProblemLanguageResultExecution timeMemory
953562nhatcaoEvent Hopping (BOI22_events)C++17
0 / 100
1554 ms3604 KiB
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
  int n;
  cin >> n;

  vector<int> start_time(n), end_time(n);
  for (int i = 0; i < n; i++) {
    cin >> start_time[i] >> end_time[i];
  }

  sort(start_time.begin(), start_time.end());

  vector<int> dp(n + 1);
  dp[0] = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < i; j++) {
      if (end_time[j] < start_time[i]) {
        dp[i] = max(dp[i], dp[j] + 1);
      }
    }
  }

  cout << dp[n] << endl;

  return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...