# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
924301 |
2024-02-08T19:55:48 Z |
Macker |
Teams (IOI15_teams) |
C++17 |
|
699 ms |
91472 KB |
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(v) v.begin(), v.end()
vector<vector<int>> st;
int len = 1;
int qry(int l, int r, int val, int i = 1, int s = 0, int e = len){
if(l >= e || s >= r) return 0;
if(l <= s && e <= r){
return upper_bound(all(st[i]), val) - st[i].begin();
}
return qry(l, r, val, i * 2, s, (s + e) / 2) +
qry(l, r, val, i * 2 + 1, (s + e) / 2, e);
}
void init(int N, int A[], int B[]) {
while(len < N + 1) len *= 2;
st.resize(2 * len);
for (int i = 0; i < N; i++) {
st[len + B[i]].push_back(A[i]);
}
for (int i = len; i < 2 * len; i++) sort(all(st[i]));
/*
for (int i = len - 1; i > 0; i--) {
int j = 0, k = 0;
st[i].reserve(st[i * 2].size() + st[i * 2 + 1].size());
while(j < st[i * 2].size() && k < st[i * 2 + 1].size()){
if(st[i * 2][j] < st[i * 2 + 1][k]){
st[i].push_back(st[i * 2][j++]);
}
else{
st[i].push_back(st[i * 2 + 1][k++]);
}
}
for (; j < st[i * 2].size(); j++) st[i].push_back(st[i * 2][j]);
for (; k < st[i * 2 + 1].size(); k++) st[i].push_back(st[i * 2 + 1][k]);
}
*/
for (int i = len - 1; i >= 0; i--) {
vector<int> a = st[i * 2];
a.insert(a.end(), all(st[i * 2 + 1]));
sort(all(a));
st[i] = a;
}
}
int can(int M, int K[]) {
sort(K, K + M, greater<int>());
int rem = 0;
for (int i = 0; i < M; i++) {
int my, a, b;
a = qry(K[i], len + 1, K[i]);
if(i != M - 1) b = qry(K[i], len + 1, K[i + 1]);
else b = 0;
my = a - b;
rem += K[i];
if(rem > a) return 0;
rem -= min(my, rem);
}
return 1;
}
Compilation message
teams.cpp: In function 'int qry(int, int, int, int, int, int)':
teams.cpp:14:39: warning: conversion from '__gnu_cxx::__normal_iterator<int*, std::vector<int> >::difference_type' {aka 'long int'} to 'int' may change value [-Wconversion]
14 | return upper_bound(all(st[i]), val) - st[i].begin();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
600 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
74 ms |
18472 KB |
Output is correct |
2 |
Correct |
73 ms |
18592 KB |
Output is correct |
3 |
Correct |
82 ms |
18404 KB |
Output is correct |
4 |
Correct |
77 ms |
18552 KB |
Output is correct |
5 |
Correct |
28 ms |
15660 KB |
Output is correct |
6 |
Correct |
29 ms |
15648 KB |
Output is correct |
7 |
Incorrect |
28 ms |
15648 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
74 ms |
18592 KB |
Output is correct |
2 |
Correct |
73 ms |
18588 KB |
Output is correct |
3 |
Correct |
149 ms |
20956 KB |
Output is correct |
4 |
Correct |
87 ms |
18456 KB |
Output is correct |
5 |
Correct |
64 ms |
15672 KB |
Output is correct |
6 |
Correct |
51 ms |
15660 KB |
Output is correct |
7 |
Incorrect |
65 ms |
15496 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
486 ms |
87972 KB |
Output is correct |
2 |
Correct |
471 ms |
87832 KB |
Output is correct |
3 |
Correct |
699 ms |
91472 KB |
Output is correct |
4 |
Correct |
460 ms |
87988 KB |
Output is correct |
5 |
Correct |
250 ms |
73928 KB |
Output is correct |
6 |
Correct |
216 ms |
74148 KB |
Output is correct |
7 |
Incorrect |
242 ms |
74148 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |