oj.uz

Submission #640376

# Submission time Handle Problem Language Result Execution time Memory
640376 2022-09-14T12:27:12 Z tvladm2009 Money (IZhO17_money) C++14
0 / 100
 1 ms 336 KB 
#include <bits/stdc++.h>

using ll = long long;

const int MAX_N = 1e6;

int a[1 + MAX_N];
std::set<int> s;

int main() {
  std::ios_base::sync_with_stdio(0);
  std::cin.tie(0);
  int n;
  std::cin >> n;
  for (int i = 1; i <= n; i++) {
    std::cin >> a[i];
  }
  int answer = 0, next = 0;
  s.insert((1 << 30));
  for (int i = 1; i <= n; i++) {
    if (i == 1 || a[i - 1] >= a[i] || (*s.lower_bound(a[i])) != next) {
      answer++;
      next = *s.lower_bound(a[i]);
    }
    s.insert(a[i]);
  }
  std::cout << answer;
  return 0;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Incorrect 0 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -