| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 484885 | imachug | Teams (IOI15_teams) | C++17 | 4093 ms | 8848 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int>> students;
void init(int n, int a[], int b[]) {
for(int i = 0; i < n; i++) {
students.emplace_back(a[i], b[i]);
}
sort(students.begin(), students.end(), [](pair<int, int> p1, pair<int, int> p2) {
return p1.second < p2.second;
});
}
int can(int m, int k[]) {
sort(k, k + m);
long long total = 0;
for(int i = 0; i < m; i++) {
total += k[i];
}
if(total > students.size()) {
return 0;
}
multiset<pair<int, int>> disabled_intervals;
disabled_intervals.emplace(students.size() + 1, 0);
for(int i = 0; i < m; i++) {
int l = 0;
while(l < students.size() && students[l].second < k[i]) {
l++;
}
while(disabled_intervals.begin()->first <= l) {
disabled_intervals.erase(disabled_intervals.begin());
}
int cnt = 0;
int r = l;
for(auto [r1, x]: disabled_intervals) {
// search in range r..r1
while(cnt < k[i] && r < r1) {
if(students[r].first > x && students[r].first <= k[i]) {
cnt++;
}
r++;
}
if(cnt == k[i]) {
break;
}
}
if(cnt < k[i]) {
return 0;
}
while(disabled_intervals.begin()->first <= r) {
disabled_intervals.erase(disabled_intervals.begin());
}
disabled_intervals.insert(make_pair(r, k[i]));
}
return 1;
// multiset<pair<int, int>> projects;
// for(int i = 0; i < m; i++) {
// projects.insert(make_pair(k[i], k[i]));
// }
// for(auto [l, r]: students) {
// auto it = projects.lower_bound(make_pair(l, 0));
// if(it != projects.end() && it->first <= r) {
// auto p = *it;
// projects.erase(it);
// p.second--;
// if(p.second > 0) {
// projects.insert(p);
// }
// }
// }
// return projects.empty();
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
