#include <teams.h>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pi = pair<int, int>;
#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>;
tcT, size_t SZ > using AR = array<T, SZ>;
using vi = V<int>;
#define f first
#define s second
#define sz(x) int((x).size())
#define all(x) bg(x), end(x)
#define sor(x) sort(all(x))
#define pb push_back
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = ((b)-1); i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
int n;
vector<pi> alfa;
bool cmp(const pi& x, const pi& y){
return x.s < y.s;
}
void init(int N, int A[], int B[]) {
n = N;
alfa.resize(n);
F0R(i, n){
alfa[i].f = A[i];
}
F0R(i, n){
alfa[i].s = B[i];
}
sort(alfa.begin(), alfa.begin() + n, cmp);
// F0R(i, n){
// cout << alfa[i].f << " ";
// }
// cout << "\n";
// F0R(i, n){
// cout << alfa[i].s << " ";
// }
// cout << "\n";
}
int can(int M, int K[]) {
multiset<int> k;
sort(K, K + M);
F0R(i, M){
F0R(j, K[i]){
k.insert(K[i]);
}
}
// for(auto it = k.begin(); it != k.end(); ++it){
// cout << *it << " ";
// }
// cout << "\n";
F0R(i, n){
auto it = k.lower_bound(alfa[i].f);
if(it == k.end()) continue;
// cout << alfa[i].f << " " << alfa[i].s << " " << *it << "\n";
if(alfa[i].f <= (*it) && (*it) <= alfa[i].s){
k.erase(it);
}
}
return sz(k) == 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
2 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
2 ms |
724 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
2 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
212 KB |
Output is correct |
16 |
Correct |
1 ms |
212 KB |
Output is correct |
17 |
Correct |
1 ms |
212 KB |
Output is correct |
18 |
Correct |
1 ms |
212 KB |
Output is correct |
19 |
Correct |
1 ms |
212 KB |
Output is correct |
20 |
Correct |
1 ms |
212 KB |
Output is correct |
21 |
Correct |
1 ms |
212 KB |
Output is correct |
22 |
Correct |
1 ms |
212 KB |
Output is correct |
23 |
Correct |
1 ms |
212 KB |
Output is correct |
24 |
Correct |
1 ms |
212 KB |
Output is correct |
25 |
Correct |
1 ms |
212 KB |
Output is correct |
26 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
45 ms |
6600 KB |
Output is correct |
2 |
Correct |
45 ms |
6556 KB |
Output is correct |
3 |
Correct |
33 ms |
5196 KB |
Output is correct |
4 |
Correct |
56 ms |
6856 KB |
Output is correct |
5 |
Correct |
37 ms |
6484 KB |
Output is correct |
6 |
Correct |
44 ms |
6412 KB |
Output is correct |
7 |
Correct |
34 ms |
6476 KB |
Output is correct |
8 |
Correct |
32 ms |
6484 KB |
Output is correct |
9 |
Correct |
32 ms |
6608 KB |
Output is correct |
10 |
Correct |
33 ms |
6516 KB |
Output is correct |
11 |
Correct |
32 ms |
6440 KB |
Output is correct |
12 |
Correct |
33 ms |
6476 KB |
Output is correct |
13 |
Correct |
33 ms |
6364 KB |
Output is correct |
14 |
Correct |
36 ms |
6496 KB |
Output is correct |
15 |
Correct |
16 ms |
2388 KB |
Output is correct |
16 |
Correct |
20 ms |
2644 KB |
Output is correct |
17 |
Correct |
34 ms |
5476 KB |
Output is correct |
18 |
Correct |
40 ms |
6204 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
4077 ms |
6820 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
4080 ms |
31672 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |