Submission #1105577

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1105577	2024-10-26T19:19:02 Z	Drew_	Po (COCI21_po)	C++17	20 / 70	10 ms	1748 KB

Main

#include <bits/stdc++.h>
using namespace std;

#define f1 first
#define s2 second

using ll = long long;
using ii = pair<int, int>;


int main() {
  ios :: sync_with_stdio(0);
  cin.tie(0);

  int N;
  cin >> N;

  int Z = 0;
  priority_queue<int> pq;
  for (int i = 0, x; i < N; ++i) {
    cin >> x;

    while (!pq.empty() && pq.top() > x) pq.pop();
    if (!pq.empty() && pq.top() == x) continue;

    pq.push(x); Z++;
  }

  cout << Z << '\n';
  return 0;
}

Subtask #1

20.0 / 70.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Incorrect	1 ms	336 KB	Output isn't correct
3	Incorrect	1 ms	336 KB	Output isn't correct
4	Incorrect	4 ms	348 KB	Output isn't correct
5	Incorrect	5 ms	592 KB	Output isn't correct
6	Correct	10 ms	1748 KB	Output is correct
7	Incorrect	8 ms	1360 KB	Output isn't correct