| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 598300 |
2022-07-18T01:57:23 Z |
jeroenodb |
Teams (IOI15_teams) |
C++14 |
|
77 ms |
23124 KB |
#include "bits/stdc++.h"
using namespace std;
#define all(x) begin(x),end(x)
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { string sep; for (const T &x : v) os << sep << x, sep = " "; return os; }
#define debug(a) cerr << "(" << #a << ": " << a << ")\n";
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pi;
const int mxN = 5e5+2, oo = 1e9;
#include "teams.h"
int pref[mxN] = {}, pref2[mxN];
void init(int N, int A[], int B[]) {
for(int i=0;i<N;++i) {
pref[A[i]]++;
pref2[B[i]+1]++;
}
partial_sum(pref,pref+mxN,pref);
partial_sum(pref2,pref2+mxN,pref2);
}
int can(int M, int K[]) {
sort(K,K+M);
int from=0, opens=0, closes=0;
for(int i=0;i<M;++i) {
int at = K[i];
opens+=pref[at]-pref[from];
int tmp = min(closes,pref2[at]-pref2[from]);
closes-=tmp;
opens-=pref2[at]-pref2[from]-tmp;
if(opens<at) return false;
opens-=at;
closes+=at;
from = at;
}
return true;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
4180 KB |
Output is correct |
| 2 |
Correct |
3 ms |
4180 KB |
Output is correct |
| 3 |
Correct |
3 ms |
4152 KB |
Output is correct |
| 4 |
Correct |
3 ms |
4180 KB |
Output is correct |
| 5 |
Correct |
3 ms |
4176 KB |
Output is correct |
| 6 |
Correct |
4 ms |
4180 KB |
Output is correct |
| 7 |
Correct |
3 ms |
4180 KB |
Output is correct |
| 8 |
Correct |
3 ms |
4180 KB |
Output is correct |
| 9 |
Incorrect |
4 ms |
4180 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
6080 KB |
Output is correct |
| 2 |
Correct |
9 ms |
6152 KB |
Output is correct |
| 3 |
Correct |
9 ms |
6080 KB |
Output is correct |
| 4 |
Correct |
11 ms |
6700 KB |
Output is correct |
| 5 |
Correct |
7 ms |
5716 KB |
Output is correct |
| 6 |
Correct |
7 ms |
5672 KB |
Output is correct |
| 7 |
Incorrect |
7 ms |
5696 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
15 ms |
6868 KB |
Output is correct |
| 2 |
Correct |
14 ms |
6884 KB |
Output is correct |
| 3 |
Correct |
26 ms |
10220 KB |
Output is correct |
| 4 |
Correct |
11 ms |
6696 KB |
Output is correct |
| 5 |
Correct |
13 ms |
6436 KB |
Output is correct |
| 6 |
Correct |
13 ms |
6484 KB |
Output is correct |
| 7 |
Incorrect |
16 ms |
6476 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
51 ms |
16264 KB |
Output is correct |
| 2 |
Correct |
48 ms |
16204 KB |
Output is correct |
| 3 |
Correct |
77 ms |
23124 KB |
Output is correct |
| 4 |
Correct |
41 ms |
15920 KB |
Output is correct |
| 5 |
Correct |
37 ms |
13456 KB |
Output is correct |
| 6 |
Correct |
40 ms |
13556 KB |
Output is correct |
| 7 |
Incorrect |
37 ms |
13484 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
