#include "teams.h"
#include <bits/stdc++.h>
#define x first
#define y second
#define pb push_back
#define all(v) v.begin(),v.end()
#pragma gcc optimize("O3")
#pragma gcc optimize("Ofast")
#pragma gcc optimize("unroll-loops")
using namespace std;
const int INF = 1e9;
const int TMX = 1 << 18;
const long long llINF = 1e18;
const long long mod = 1e9+7;
const long long hashmod = 100003;
const int MAXN = 100000;
const int MAXM = 1000000;
typedef long long ll;
typedef long double ld;
typedef pair <int,int> pi;
typedef pair <ll,ll> pl;
typedef vector <int> vec;
typedef vector <pi> vecpi;
typedef long long ll;
int n;
pi a[500005];
priority_queue <int> q;
void init(int N, int A[], int B[]) {
n = N;
for(int i = 1;i <= n;i++) a[i] = {A[i-1],B[i-1]};
sort(a+1,a+n+1);
}
int can(int m,int k[]) {
sort(k,k+m);
int j = 1,g;
while(!q.empty()) q.pop();
for(int i = 0;i < m;i++) {
while(j <= n&&a[j].x <= k[i]) q.push(-a[j++].y);
while(!q.empty()&&-q.top() < k[i]) q.pop();
for(g = 1;!q.empty()&&g <= k[i];g++) q.pop();
if(g != k[i]+1) return false;
}
return true;
}
Compilation message
teams.cpp:7: warning: ignoring #pragma gcc optimize [-Wunknown-pragmas]
7 | #pragma gcc optimize("O3")
|
teams.cpp:8: warning: ignoring #pragma gcc optimize [-Wunknown-pragmas]
8 | #pragma gcc optimize("Ofast")
|
teams.cpp:9: warning: ignoring #pragma gcc optimize [-Wunknown-pragmas]
9 | #pragma gcc optimize("unroll-loops")
|
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
1 ms |
384 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Correct |
1 ms |
364 KB |
Output is correct |
| 5 |
Correct |
1 ms |
364 KB |
Output is correct |
| 6 |
Correct |
1 ms |
364 KB |
Output is correct |
| 7 |
Correct |
1 ms |
364 KB |
Output is correct |
| 8 |
Correct |
1 ms |
364 KB |
Output is correct |
| 9 |
Correct |
1 ms |
364 KB |
Output is correct |
| 10 |
Correct |
1 ms |
364 KB |
Output is correct |
| 11 |
Correct |
1 ms |
364 KB |
Output is correct |
| 12 |
Correct |
1 ms |
364 KB |
Output is correct |
| 13 |
Correct |
1 ms |
364 KB |
Output is correct |
| 14 |
Correct |
1 ms |
364 KB |
Output is correct |
| 15 |
Correct |
1 ms |
364 KB |
Output is correct |
| 16 |
Correct |
1 ms |
364 KB |
Output is correct |
| 17 |
Correct |
1 ms |
384 KB |
Output is correct |
| 18 |
Correct |
1 ms |
384 KB |
Output is correct |
| 19 |
Correct |
1 ms |
364 KB |
Output is correct |
| 20 |
Correct |
1 ms |
364 KB |
Output is correct |
| 21 |
Correct |
1 ms |
364 KB |
Output is correct |
| 22 |
Correct |
1 ms |
364 KB |
Output is correct |
| 23 |
Correct |
1 ms |
364 KB |
Output is correct |
| 24 |
Correct |
1 ms |
364 KB |
Output is correct |
| 25 |
Correct |
1 ms |
364 KB |
Output is correct |
| 26 |
Correct |
1 ms |
364 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
17 ms |
1900 KB |
Output is correct |
| 2 |
Correct |
16 ms |
1900 KB |
Output is correct |
| 3 |
Correct |
39 ms |
2536 KB |
Output is correct |
| 4 |
Correct |
19 ms |
3692 KB |
Output is correct |
| 5 |
Correct |
18 ms |
2752 KB |
Output is correct |
| 6 |
Correct |
26 ms |
2748 KB |
Output is correct |
| 7 |
Correct |
15 ms |
2608 KB |
Output is correct |
| 8 |
Correct |
15 ms |
2684 KB |
Output is correct |
| 9 |
Correct |
17 ms |
3536 KB |
Output is correct |
| 10 |
Correct |
16 ms |
3220 KB |
Output is correct |
| 11 |
Correct |
14 ms |
3228 KB |
Output is correct |
| 12 |
Correct |
16 ms |
3308 KB |
Output is correct |
| 13 |
Correct |
24 ms |
3300 KB |
Output is correct |
| 14 |
Correct |
22 ms |
3596 KB |
Output is correct |
| 15 |
Correct |
19 ms |
3180 KB |
Output is correct |
| 16 |
Correct |
16 ms |
3052 KB |
Output is correct |
| 17 |
Correct |
16 ms |
3180 KB |
Output is correct |
| 18 |
Correct |
17 ms |
3180 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
22 ms |
2284 KB |
Output is correct |
| 2 |
Correct |
22 ms |
2288 KB |
Output is correct |
| 3 |
Execution timed out |
4093 ms |
2536 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
101 ms |
8940 KB |
Output is correct |
| 2 |
Correct |
114 ms |
8940 KB |
Output is correct |
| 3 |
Execution timed out |
4040 ms |
10336 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
