Submission #1210124

#TimeUsernameProblemLanguageResultExecution timeMemory
121012412345678Teams (IOI15_teams)C++17
0 / 100
4093 ms8872 KiB
#include "teams.h" #include <bits/stdc++.h> using namespace std; const int nx=1e5+5; int n, idx; vector<pair<int, int>> v; void init(int N, int A[], int B[]) { n=N; for (int i=0; i<N; i++) v.push_back({B[i], A[i]}); sort(v.begin(), v.end()); for (int i=0; i<N; i++) swap(v[i].first, v[i].second); } int can(int M, int K[]) { sort(K, K+M); idx=0; for (int i=0; i<M; i++) { int cnt=0; while (cnt<K[i]&&idx<n) { if (v[idx].first<=K[i]&&K[i]<=v[idx].second) cnt++; idx++; } if (cnt<K[i]) return 0; } 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...