| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 295351 |
2020-09-09T15:48:27 Z |
peti1234 |
Teams (IOI15_teams) |
C++17 |
|
4000 ms |
21940 KB |
#include <bits/stdc++.h>
using namespace std;
long long n, pos, sum;
vector<pair<int, int> > sz;
priority_queue<int> q;
vector<int> kerd;
//bool can(int m, vector<int> a) {
bool can(int m, int a[]) {
pos=0, sum=0;
for (int i=0; i<m; i++) sum+=a[i];
if (sum>n) return 0;
kerd.clear();
for (int i=0; i<m; i++) for (int j=0; j<a[i]; j++) kerd.push_back(a[i]);
sort(kerd.begin(), kerd.end());
for (int i=0; i<sum; i++) {
while(pos<n && sz[pos].first<=kerd[i]) q.push(sz[pos].second), pos++;
while(q.size() && kerd[i]>-q.top()) {
//cout << kerd[i] << " " << q.top() << endl;
q.pop();
}
if (q.size()==0) return 0;
q.pop();
}
while(q.size()) q.pop();
return 1;
}
//void init(int p, vector<int> a, vector<int> b) {
void init(int p, int a[], int b[]) {
n=p;
for (int i=0; i<n; i++) sz.push_back({a[i], -b[i]});
sort(sz.begin(), sz.end());
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
256 KB |
Output is correct |
| 2 |
Correct |
1 ms |
256 KB |
Output is correct |
| 3 |
Correct |
1 ms |
384 KB |
Output is correct |
| 4 |
Correct |
1 ms |
256 KB |
Output is correct |
| 5 |
Correct |
1 ms |
256 KB |
Output is correct |
| 6 |
Correct |
1 ms |
384 KB |
Output is correct |
| 7 |
Correct |
1 ms |
384 KB |
Output is correct |
| 8 |
Correct |
1 ms |
256 KB |
Output is correct |
| 9 |
Correct |
1 ms |
384 KB |
Output is correct |
| 10 |
Correct |
1 ms |
384 KB |
Output is correct |
| 11 |
Correct |
1 ms |
256 KB |
Output is correct |
| 12 |
Correct |
1 ms |
384 KB |
Output is correct |
| 13 |
Correct |
1 ms |
384 KB |
Output is correct |
| 14 |
Correct |
1 ms |
256 KB |
Output is correct |
| 15 |
Correct |
1 ms |
384 KB |
Output is correct |
| 16 |
Correct |
1 ms |
256 KB |
Output is correct |
| 17 |
Correct |
1 ms |
256 KB |
Output is correct |
| 18 |
Correct |
1 ms |
384 KB |
Output is correct |
| 19 |
Correct |
1 ms |
256 KB |
Output is correct |
| 20 |
Correct |
1 ms |
384 KB |
Output is correct |
| 21 |
Correct |
1 ms |
256 KB |
Output is correct |
| 22 |
Correct |
1 ms |
256 KB |
Output is correct |
| 23 |
Correct |
1 ms |
256 KB |
Output is correct |
| 24 |
Correct |
1 ms |
256 KB |
Output is correct |
| 25 |
Correct |
1 ms |
384 KB |
Output is correct |
| 26 |
Correct |
1 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
19 ms |
3316 KB |
Output is correct |
| 2 |
Correct |
19 ms |
3956 KB |
Output is correct |
| 3 |
Correct |
31 ms |
4212 KB |
Output is correct |
| 4 |
Correct |
21 ms |
4596 KB |
Output is correct |
| 5 |
Correct |
19 ms |
3572 KB |
Output is correct |
| 6 |
Correct |
18 ms |
3572 KB |
Output is correct |
| 7 |
Correct |
15 ms |
3572 KB |
Output is correct |
| 8 |
Correct |
14 ms |
3572 KB |
Output is correct |
| 9 |
Correct |
14 ms |
4212 KB |
Output is correct |
| 10 |
Correct |
13 ms |
3828 KB |
Output is correct |
| 11 |
Correct |
13 ms |
3828 KB |
Output is correct |
| 12 |
Correct |
14 ms |
3828 KB |
Output is correct |
| 13 |
Correct |
21 ms |
3700 KB |
Output is correct |
| 14 |
Correct |
22 ms |
4212 KB |
Output is correct |
| 15 |
Correct |
18 ms |
3448 KB |
Output is correct |
| 16 |
Correct |
17 ms |
3448 KB |
Output is correct |
| 17 |
Correct |
19 ms |
3828 KB |
Output is correct |
| 18 |
Correct |
19 ms |
3956 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
380 ms |
3180 KB |
Output is correct |
| 2 |
Correct |
436 ms |
4460 KB |
Output is correct |
| 3 |
Execution timed out |
4048 ms |
4592 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1855 ms |
12640 KB |
Output is correct |
| 2 |
Correct |
2158 ms |
19552 KB |
Output is correct |
| 3 |
Execution timed out |
4062 ms |
21940 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
