# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
242869 |
2020-06-29T13:51:14 Z |
godwind |
Teams (IOI15_teams) |
C++14 |
|
4000 ms |
17912 KB |
#include "teams.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <random>
#include <set>
#include <map>
#include <queue>
#include <cstring>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <functional>
using namespace std;
const int N = 100 * 1000 + 228;
int n;
int a[N], b[N];
struct seg
{
int l, r, id;
seg() {}
seg(int _l, int _r, int _id) {
l = _l;
r = _r;
id = _id;
}
};
bool operator<(seg fir, seg sec) {
return fir.r < sec.r || (fir.r == sec.r && fir.id < sec.id);
}
vector< seg > open[N], close[N];
void init(int N, int A[], int B[]) {
n = N;
for (int i = 0; i < n; ++i) {
a[i] = A[i];
b[i] = B[i];
open[a[i]].emplace_back(seg(a[i], b[i], i));
close[b[i]].emplace_back(seg(a[i], b[i], i));
}
}
int cnt[N];
int can(int M, int K[]) {
for (int i = 0; i <= n; ++i) {
cnt[i] = 0;
}
int sum_all = 0;
for (int i = 0; i < M; ++i) {
sum_all += K[i];
if (sum_all > n) {
return 0;
}
++cnt[K[i]];
}
sort(K, K + M);
set< seg > s;
for (int x = 1; x <= n; ++x) {
for (seg sg : close[x - 1]) {
if (s.count(sg)) {
s.erase(sg);
}
}
for (seg sg : open[x]) {
s.insert(sg);
}
for (int it = 0; it < x * cnt[x]; ++it) {
if (s.empty()) {
return 0;
}
s.erase(s.begin());
}
}
return 1;
}
Compilation message
teams.cpp: In function 'void init(int, int*, int*)':
teams.cpp:38:34: warning: declaration of 'N' shadows a global declaration [-Wshadow]
void init(int N, int A[], int B[]) {
^
teams.cpp:17:11: note: shadowed declaration is here
const int N = 100 * 1000 + 228;
^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
4992 KB |
Output is correct |
2 |
Correct |
8 ms |
4992 KB |
Output is correct |
3 |
Correct |
8 ms |
5120 KB |
Output is correct |
4 |
Correct |
7 ms |
4992 KB |
Output is correct |
5 |
Correct |
9 ms |
5120 KB |
Output is correct |
6 |
Correct |
7 ms |
5120 KB |
Output is correct |
7 |
Correct |
8 ms |
4992 KB |
Output is correct |
8 |
Correct |
8 ms |
4992 KB |
Output is correct |
9 |
Correct |
7 ms |
4992 KB |
Output is correct |
10 |
Correct |
8 ms |
4992 KB |
Output is correct |
11 |
Correct |
7 ms |
4992 KB |
Output is correct |
12 |
Correct |
8 ms |
4992 KB |
Output is correct |
13 |
Correct |
9 ms |
4992 KB |
Output is correct |
14 |
Correct |
9 ms |
4992 KB |
Output is correct |
15 |
Correct |
9 ms |
4992 KB |
Output is correct |
16 |
Correct |
9 ms |
4992 KB |
Output is correct |
17 |
Correct |
7 ms |
4992 KB |
Output is correct |
18 |
Correct |
7 ms |
5120 KB |
Output is correct |
19 |
Correct |
7 ms |
4992 KB |
Output is correct |
20 |
Correct |
7 ms |
4992 KB |
Output is correct |
21 |
Correct |
7 ms |
4992 KB |
Output is correct |
22 |
Correct |
7 ms |
5120 KB |
Output is correct |
23 |
Correct |
8 ms |
4992 KB |
Output is correct |
24 |
Correct |
7 ms |
4992 KB |
Output is correct |
25 |
Correct |
7 ms |
5120 KB |
Output is correct |
26 |
Correct |
8 ms |
4992 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
42 ms |
11384 KB |
Output is correct |
2 |
Correct |
40 ms |
11384 KB |
Output is correct |
3 |
Correct |
90 ms |
14456 KB |
Output is correct |
4 |
Correct |
43 ms |
13048 KB |
Output is correct |
5 |
Correct |
27 ms |
11264 KB |
Output is correct |
6 |
Correct |
29 ms |
11264 KB |
Output is correct |
7 |
Correct |
18 ms |
11264 KB |
Output is correct |
8 |
Correct |
17 ms |
11264 KB |
Output is correct |
9 |
Correct |
45 ms |
16548 KB |
Output is correct |
10 |
Correct |
43 ms |
16188 KB |
Output is correct |
11 |
Correct |
44 ms |
16156 KB |
Output is correct |
12 |
Correct |
39 ms |
15824 KB |
Output is correct |
13 |
Correct |
55 ms |
14508 KB |
Output is correct |
14 |
Correct |
78 ms |
17188 KB |
Output is correct |
15 |
Correct |
92 ms |
14840 KB |
Output is correct |
16 |
Correct |
40 ms |
12288 KB |
Output is correct |
17 |
Correct |
36 ms |
12140 KB |
Output is correct |
18 |
Correct |
38 ms |
12340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
58 ms |
11768 KB |
Output is correct |
2 |
Correct |
58 ms |
11768 KB |
Output is correct |
3 |
Execution timed out |
4097 ms |
14456 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
48 ms |
17912 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |