#include "teams.h"
#include <iostream>
#include <iomanip>
#include <string>
#include <math.h>
#include <algorithm>
#include <cstring>
#include <numeric>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <unordered_map>
#include <unordered_set>
using namespace std;
typedef long long ll;
#define dbg(x) cerr<<#x<<": "<<x<<"\n";
#define fr(i, x) for(ll i=0 ; i<x ; i++)
#define fra(x, v) for(auto x:v)
#define fra1(x,v) for(auto &x:v)
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define pb(x) push_back(x)
#define F first
#define S second
const ll maxN=5e6;
ll n;
pair<ll, ll> vp[maxN];
bool uwu[maxN];
void init(int N, int A[], int B[]) {
n=N;
fr(i, N){
vp[i].F=B[i];
vp[i].S=A[i];
}
sort(vp, vp+n);
}
int can(int M, int K[]) {
sort(K, K+M);
ll cc=0;
fill(uwu, uwu+maxN, 0);
fr(i, M){
cc=0;
fr(j, n){
if(cc>=K[i]) break;
if(uwu[j] || vp[j].F<K[i] || vp[j].S>K[i]) continue;
cc++;
uwu[j]=1;
}
if(cc!=K[i]) return 0;
}
return 1;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
5076 KB |
Output is correct |
2 |
Correct |
2 ms |
5204 KB |
Output is correct |
3 |
Correct |
10 ms |
5208 KB |
Output is correct |
4 |
Correct |
10 ms |
5172 KB |
Output is correct |
5 |
Correct |
10 ms |
5212 KB |
Output is correct |
6 |
Correct |
2 ms |
5204 KB |
Output is correct |
7 |
Correct |
10 ms |
5212 KB |
Output is correct |
8 |
Correct |
10 ms |
5204 KB |
Output is correct |
9 |
Correct |
10 ms |
5208 KB |
Output is correct |
10 |
Correct |
10 ms |
5204 KB |
Output is correct |
11 |
Correct |
2 ms |
5172 KB |
Output is correct |
12 |
Correct |
10 ms |
5204 KB |
Output is correct |
13 |
Correct |
11 ms |
5220 KB |
Output is correct |
14 |
Correct |
10 ms |
5212 KB |
Output is correct |
15 |
Correct |
10 ms |
5168 KB |
Output is correct |
16 |
Correct |
10 ms |
5204 KB |
Output is correct |
17 |
Correct |
10 ms |
5168 KB |
Output is correct |
18 |
Correct |
10 ms |
5204 KB |
Output is correct |
19 |
Correct |
12 ms |
5164 KB |
Output is correct |
20 |
Correct |
10 ms |
5216 KB |
Output is correct |
21 |
Correct |
10 ms |
5212 KB |
Output is correct |
22 |
Correct |
10 ms |
5212 KB |
Output is correct |
23 |
Correct |
10 ms |
5204 KB |
Output is correct |
24 |
Correct |
10 ms |
5204 KB |
Output is correct |
25 |
Correct |
10 ms |
5208 KB |
Output is correct |
26 |
Correct |
10 ms |
5204 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
14 ms |
7520 KB |
Output is correct |
2 |
Correct |
14 ms |
7508 KB |
Output is correct |
3 |
Correct |
14 ms |
7508 KB |
Output is correct |
4 |
Correct |
16 ms |
7928 KB |
Output is correct |
5 |
Correct |
20 ms |
7564 KB |
Output is correct |
6 |
Correct |
17 ms |
7552 KB |
Output is correct |
7 |
Correct |
10 ms |
7496 KB |
Output is correct |
8 |
Correct |
11 ms |
7496 KB |
Output is correct |
9 |
Correct |
1042 ms |
7684 KB |
Output is correct |
10 |
Correct |
402 ms |
8152 KB |
Output is correct |
11 |
Correct |
47 ms |
8148 KB |
Output is correct |
12 |
Correct |
11 ms |
8244 KB |
Output is correct |
13 |
Correct |
13 ms |
8508 KB |
Output is correct |
14 |
Correct |
12 ms |
8532 KB |
Output is correct |
15 |
Correct |
14 ms |
8672 KB |
Output is correct |
16 |
Correct |
14 ms |
8584 KB |
Output is correct |
17 |
Correct |
12 ms |
8532 KB |
Output is correct |
18 |
Correct |
12 ms |
8524 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
71 ms |
7884 KB |
Output is correct |
2 |
Correct |
89 ms |
7856 KB |
Output is correct |
3 |
Execution timed out |
4066 ms |
7980 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
329 ms |
17692 KB |
Output is correct |
2 |
Correct |
385 ms |
17680 KB |
Output is correct |
3 |
Execution timed out |
4083 ms |
17076 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |