제출 #1293602

#제출 시각아이디문제언어결과실행 시간메모리
1293602goulthen팀들 (IOI15_teams)C++20
0 / 100
4091 ms6056 KiB
#include "teams.h" #include <bits/stdc++.h> using namespace std; #define rep(i,a,b) for (int i = a; i <= b; i++) #define pii pair<int,int> #define fi first #define se second const int MAXN = 2e5+10; pii a[MAXN]; int n; void init(int N, int A[], int B[]) { n = N; rep(i,0,N-1) a[i+1] = {B[i],A[i]}; sort(a+1, a+n+1); } int can(int M, int K[]) { sort(K,K+M); int r = 1; rep(i,0,M-1) { int x = K[i]; //cout << i << ' ' << x << '\n'; int cnt = x; while (cnt > 0) { //cout << i << ' ' << r << ' ' << x << '\n'; if(r>n) return 0; //cout << a[r].fi << ' ' << a[r].se << '\n'; while (a[r].fi < x || a[r].se > x) { if(r==n) return 0; r++; } cnt--; r++; } } 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...