Submission #67009

#TimeUsernameProblemLanguageResultExecution timeMemory
67009nvmdavaTeams (IOI15_teams)C++17
0 / 100
4042 ms40584 KiB
#include "teams.h" #include <bits/stdc++.h> using namespace std; struct unit{ int l, r; bool operator<(const unit& rhs) const { if(l == rhs.l){ return r < rhs.r; } return l < rhs.l; } }; vector<unit> v; void init(int N, int A[], int B[]) { unit t; for(int i = 0 ; i < N; i++){ t.l = A[i]; t.r = B[i]; v.push_back(t); } sort(v.begin(), v.end()); } int can(int M, int K[]) { vector<int> q; for(int i = 0; i < M; i++){ q.push_back(K[i]); } sort(q.begin(), q.end()); int i = 0, t = q[0]; for(auto x : v){ if(q[i] < x.l){ return 0; } if(q[i] <= x.r){ t--; if(t == 0){ i++; if(i == M){ return 1; } } } } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...