| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 568511 | CSQ31 | Teams (IOI15_teams) | C++17 | 105 ms | 16444 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;
typedef pair<int,int> pii;
#define fi first
#define se second
int n;
vector<pii>r;
void init(int N, int A[], int B[]) {
n = N;
for(int i=0;i<n;i++)r.push_back({A[i],B[i]});
sort(r.begin(),r.end());
}
int can(int m, int K[]) {
int sum = 0;
map<int,int>cnt;
for(int i=0;i<m;i++){
sum+=K[i];
cnt[K[i]]++;
if(sum>n)return 0;
}
vector<pii>a;
for(auto x:cnt)a.push_back(x);
int s = a.size();
vector<int>need(s);
for(int i=0;i<s;i++)need[i] = a[i].fi * a[i].se;
int ptr = -1;
for(int i=0;i<s;i++){
int last = ptr;
while(ptr+1<n && r[ptr+1].fi<=a[i].fi)ptr++;
if(ptr == last)continue;
vector<int>w;
for(int j=last+1;j<=ptr;j++)w.push_back(a[j].se);
sort(w.begin(),w.end());
for(int x:w){
for(int j=i;j<s;j++){
if(need[j] && a[j].fi <= x){
need[j]--;
break;
}
}
}
last = ptr;
}
for(int x:need){
if(x)return 0;
}
return 1;
}
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... | ||||
