oj.uz

Submission #969648

# Submission time Handle Problem Language Result Execution time Memory
969648 2024-04-25T12:01:24 Z duckindog Teams (IOI15_teams) C++17
34 / 100
 4000 ms 19028 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 500'000 + 10;
int n;
int a[N], b[N];

void init(int n_, int a_[], int b_[]) { 
  n = n_;
  vector<pair<int, int>> p;
  for (int i = 0; i < n; ++i) p.push_back({a_[i], b_[i]});
  sort(p.begin(), p.end());
  for (int i = 0; i < n; ++i) tie(a[i], b[i]) = p[i];
}
int can(int m, int k[]) { 
  sort(k, k + m);
  priority_queue<int, vector<int>, greater<>> q;
  int it = 0;
  for (int i = 0; i < m; ++i) { 
    while (it < n && a[it] <= k[i]) q.push(b[it++]);
    int cnt = k[i];
    while (q.size() && cnt) { 
      cnt -= (q.top() >= k[i]);
      q.pop();
    }
    if (cnt) return 0;
  } 
  return 1;
}

#ifdef LOCAL
int n_, a_[N], b_[N];
int inQ;
int inM, inK[N];

int32_t main() { 
  cin.tie(0)->sync_with_stdio(0);

  cin >> n_;
  for (int i = 0; i < n_; ++i) cin >> a_[i] >> b_[i];
  init(n_, a_, b_);
  cin >> inQ;
  while (inQ--) { 
    cin >> inM;
    for (int i = 0; i < inM; ++i) cin >> inK[i];
    cout << can(inM, inK) << "\n";
  }
}
#endif

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2496 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2492 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2492 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2648 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 5584 KB Output is correct
2 Correct 16 ms 5576 KB Output is correct
3 Correct 23 ms 5588 KB Output is correct
4 Correct 16 ms 5840 KB Output is correct
5 Correct 12 ms 5072 KB Output is correct
6 Correct 13 ms 5224 KB Output is correct
7 Correct 11 ms 5240 KB Output is correct
8 Correct 13 ms 5056 KB Output is correct
9 Correct 9 ms 5420 KB Output is correct
10 Correct 8 ms 5056 KB Output is correct
11 Correct 8 ms 4980 KB Output is correct
12 Correct 9 ms 5160 KB Output is correct
13 Correct 15 ms 5328 KB Output is correct
14 Correct 16 ms 5472 KB Output is correct
15 Correct 14 ms 5584 KB Output is correct
16 Correct 13 ms 5476 KB Output is correct
17 Correct 13 ms 5584 KB Output is correct
18 Correct 14 ms 5396 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 5852 KB Output is correct
2 Correct 19 ms 5840 KB Output is correct
3 Execution timed out 4043 ms 6148 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 19028 KB Output is correct
2 Correct 86 ms 18872 KB Output is correct
3 Execution timed out 4108 ms 19004 KB Time limit exceeded
4 Halted 0 ms 0 KB -