Submission #1153593

#TimeUsernameProblemLanguageResultExecution timeMemory
1153593PagodePaivaTeams (IOI15_teams)C++17
34 / 100
4093 ms12876 KiB
#include "teams.h" #include<bits/stdc++.h> #define fr first #define sc second using namespace std; vector <pair <int, int>> v; bool comp(pair <int, int> a, pair <int,int> b){ if(a.sc < b.sc) return true; else if(a.sc > b.sc) return false; return (a.fr < b.fr); } void init(int n, int a[], int b[]) { for(int i = 0;i < n;i++){ v.push_back({a[i], b[i]}); } sort(v.begin(), v.end(), comp); return; } int can(int m, int k[]) { sort(k, k+m); vector <pair <int, int>> aux = v; for(int i = 0;i < m;i++){ int tam = k[i]; while(tam > 0){ bool auxx = false; for(int j = 0;j < aux.size();j++){ if(aux[j].first <= k[i] and k[i] <= aux[j].second){ aux.erase(aux.begin()+j); auxx = true; break; } } if(!auxx) return 0; tam--; } } return 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...