Submission #1156113

#TimeUsernameProblemLanguageResultExecution timeMemory
1156113aarb_.tomatexdTeams (IOI15_teams)C++20
21 / 100
4091 ms14228 KiB
#include "teams.h" #include <bits/stdc++.h> using namespace std; #define ll long long vector<int>a, b; int n; void init (int N, int A[], int B[]) { a = vector<int>(A, A+N); b = vector<int>(B, B+N); n = N; } vector<int>kk; int can (int m, int k[]) { kk = vector<int>(k, k+m); vector<int>visited(n, 0); sort(kk.begin(), kk.end()); for(int i=0;i<m;i++){ int r = kk[i]; int rr = r; //priority_queue<pair<int,int>> q; vector<int>aaasi; for(int j=0;j<n;j++) if (a[j] <= r) aaasi.push_back(j); //Sort sort(aaasi.begin(),aaasi.end(), [&](int l, int r) { return b[l] < b[r]; }); for(auto valido: aaasi){ if(rr > b[valido] or visited[valido]) continue; r--; visited[valido] = true; if(r<=0) break; } if(r > 0) 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...