#include "teams.h"
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vii;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vii> vvii;
typedef vector<vll> vvll;
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
#define ffor(i, a, b) for (ll i = (a); i < (ll)(b); i++)
#define fford(i, a, b) for (ll i = (a); i > (ll)(b); i--)
#define rep(i, n) ffor(i, 0, n)
#define forin(x, a) for (auto &x: a)
#define all(a) a.begin(), a.end()
vpii students;
void init(int N, int A[], int B[]) {
rep(i, N) {
students.emplace_back(B[i], A[i]);
}
sort(all(students));
rep(i, N) {
swap(students[i].first, students[i].second);
}
}
int can(int M, int K[]) {
map<int, int> k;
rep(i, M) {
k[K[i]] += K[i];
}
forin(s, students) {
auto lowest = k.lower_bound(s.first);
if (lowest != k.end() && lowest->first <= s.second) {
int x = lowest->first;
k[x]--;
if (!k[x]) {
k.erase(x);
}
}
}
return k.empty();
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Correct |
2 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
1 ms |
204 KB |
Output is correct |
| 6 |
Correct |
1 ms |
332 KB |
Output is correct |
| 7 |
Correct |
1 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| 10 |
Correct |
1 ms |
204 KB |
Output is correct |
| 11 |
Correct |
0 ms |
204 KB |
Output is correct |
| 12 |
Correct |
1 ms |
204 KB |
Output is correct |
| 13 |
Correct |
1 ms |
204 KB |
Output is correct |
| 14 |
Correct |
1 ms |
204 KB |
Output is correct |
| 15 |
Correct |
1 ms |
204 KB |
Output is correct |
| 16 |
Correct |
1 ms |
204 KB |
Output is correct |
| 17 |
Correct |
1 ms |
204 KB |
Output is correct |
| 18 |
Correct |
1 ms |
204 KB |
Output is correct |
| 19 |
Correct |
1 ms |
204 KB |
Output is correct |
| 20 |
Correct |
1 ms |
204 KB |
Output is correct |
| 21 |
Correct |
1 ms |
204 KB |
Output is correct |
| 22 |
Correct |
1 ms |
204 KB |
Output is correct |
| 23 |
Correct |
1 ms |
204 KB |
Output is correct |
| 24 |
Correct |
1 ms |
204 KB |
Output is correct |
| 25 |
Correct |
1 ms |
204 KB |
Output is correct |
| 26 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
20 ms |
2208 KB |
Output is correct |
| 2 |
Correct |
18 ms |
2192 KB |
Output is correct |
| 3 |
Correct |
18 ms |
2244 KB |
Output is correct |
| 4 |
Correct |
18 ms |
2252 KB |
Output is correct |
| 5 |
Correct |
16 ms |
3012 KB |
Output is correct |
| 6 |
Correct |
15 ms |
3012 KB |
Output is correct |
| 7 |
Correct |
17 ms |
3012 KB |
Output is correct |
| 8 |
Correct |
17 ms |
3012 KB |
Output is correct |
| 9 |
Correct |
8 ms |
3012 KB |
Output is correct |
| 10 |
Correct |
8 ms |
2756 KB |
Output is correct |
| 11 |
Correct |
9 ms |
2756 KB |
Output is correct |
| 12 |
Correct |
10 ms |
2884 KB |
Output is correct |
| 13 |
Correct |
15 ms |
3188 KB |
Output is correct |
| 14 |
Correct |
17 ms |
3140 KB |
Output is correct |
| 15 |
Correct |
17 ms |
3304 KB |
Output is correct |
| 16 |
Correct |
17 ms |
3292 KB |
Output is correct |
| 17 |
Correct |
14 ms |
3244 KB |
Output is correct |
| 18 |
Correct |
14 ms |
3276 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
310 ms |
2244 KB |
Output is correct |
| 2 |
Correct |
331 ms |
3776 KB |
Output is correct |
| 3 |
Execution timed out |
4069 ms |
3668 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1312 ms |
9360 KB |
Output is correct |
| 2 |
Correct |
1504 ms |
16444 KB |
Output is correct |
| 3 |
Execution timed out |
4078 ms |
15156 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
