| # |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
| 831413 |
2023-08-20T08:42:28 Z |
waldi |
팀들 (IOI15_teams) |
C++17 |
|
4000 ms |
45396 KB |
#include<bits/stdc++.h>
#define FOR(i,p,k) for(int i=(p);i<=(k);++i)
#define REP(i,n) FOR(i,0,(n)-1)
using namespace std;
int n;
vector<vector<int>> kub;
void init(int nn, int a[], int b[]){
n = nn;
kub.resize(n+1);
REP(i, n) kub[a[i]].emplace_back(b[i]);
}
int can(int m, int k[]){
vector<int> wym(n+1, 0);
REP(i, m) wym[k[i]] += k[i];
// wym ma 2sqrt(n) niezerowych wartosci
multiset<int> s;
FOR(i, 1, n){
for(int x : kub[i]) s.emplace(x);
while(s.size() && *s.begin() < i) s.erase(s.begin());
for(; wym[i]; --wym[i]){
if(s.empty()) return 0;
s.erase(s.begin());
}
}
return 1;
}
#ifdef LOCAL
#define maxn 1000
int main(){
int nn, a[maxn], b[maxn];
scanf("%d", &nn);
REP(i, nn) scanf("%d%d", &a[i], &b[i]);
init(nn, a, b);
int q;
scanf("%d", &q);
while(q--){
int m, k[maxn];
scanf("%d", &m);
REP(i, m) scanf("%d", &k[i]);
int wyn = can(m, k);
printf("%d\n", wyn);
}
}
#endif
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
1 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
212 KB |
Output is correct |
| 6 |
Correct |
1 ms |
340 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 |
256 KB |
Output is correct |
| 11 |
Correct |
0 ms |
212 KB |
Output is correct |
| 12 |
Correct |
1 ms |
304 KB |
Output is correct |
| 13 |
Correct |
1 ms |
212 KB |
Output is correct |
| 14 |
Correct |
1 ms |
300 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 |
0 ms |
300 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 |
296 KB |
Output is correct |
| 26 |
Correct |
1 ms |
300 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
11 ms |
6740 KB |
Output is correct |
| 2 |
Correct |
11 ms |
6688 KB |
Output is correct |
| 3 |
Correct |
36 ms |
9064 KB |
Output is correct |
| 4 |
Correct |
12 ms |
7384 KB |
Output is correct |
| 5 |
Correct |
11 ms |
5296 KB |
Output is correct |
| 6 |
Correct |
11 ms |
5280 KB |
Output is correct |
| 7 |
Correct |
6 ms |
5300 KB |
Output is correct |
| 8 |
Correct |
5 ms |
5280 KB |
Output is correct |
| 9 |
Correct |
21 ms |
9804 KB |
Output is correct |
| 10 |
Correct |
20 ms |
9432 KB |
Output is correct |
| 11 |
Correct |
21 ms |
9396 KB |
Output is correct |
| 12 |
Correct |
18 ms |
9280 KB |
Output is correct |
| 13 |
Correct |
21 ms |
8148 KB |
Output is correct |
| 14 |
Correct |
34 ms |
10180 KB |
Output is correct |
| 15 |
Correct |
30 ms |
8396 KB |
Output is correct |
| 16 |
Correct |
12 ms |
6556 KB |
Output is correct |
| 17 |
Correct |
17 ms |
6548 KB |
Output is correct |
| 18 |
Correct |
19 ms |
6576 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
15 ms |
7444 KB |
Output is correct |
| 2 |
Correct |
14 ms |
7524 KB |
Output is correct |
| 3 |
Execution timed out |
4080 ms |
9372 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
95 ms |
34972 KB |
Output is correct |
| 2 |
Correct |
125 ms |
36800 KB |
Output is correct |
| 3 |
Execution timed out |
4070 ms |
45396 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
