# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
329724 |
2020-11-22T07:49:59 Z |
figter001 |
Teams (IOI15_teams) |
C++17 |
|
4000 ms |
16468 KB |
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define fast ios::sync_with_stdio(false);cin.tie(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<pair<int,int>> s;
int n;
void init(int N, int A[], int B[]) {
n = N;
for(int i=0;i<n;i++){
s.push_back({A[i], B[i]});
}
sort(all(s) , [](pair<int,int> a,pair<int,int> b){
if(a.second == b.second)
return a.first < b.first;
return a.second < b.second;
});
}
int can(int M, int K[]) {
sort(K,K+M);
int id = 0,cnt=0;
for(int i=0;i<s.size();i++){
if(id == M)break;
cnt += (s[i].first <= K[id] && s[i].second >= K[id]);
if(cnt == K[id]){
cnt = 0;
id++;
}
}
return id == M;
}
Compilation message
teams.cpp: In function 'int can(int, int*)':
teams.cpp:31:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
31 | for(int i=0;i<s.size();i++){
| ~^~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
364 KB |
Output is correct |
6 |
Correct |
1 ms |
364 KB |
Output is correct |
7 |
Correct |
1 ms |
364 KB |
Output is correct |
8 |
Correct |
1 ms |
364 KB |
Output is correct |
9 |
Correct |
1 ms |
364 KB |
Output is correct |
10 |
Correct |
1 ms |
364 KB |
Output is correct |
11 |
Correct |
1 ms |
364 KB |
Output is correct |
12 |
Correct |
1 ms |
364 KB |
Output is correct |
13 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
14 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
18 ms |
3428 KB |
Output is correct |
2 |
Correct |
17 ms |
3428 KB |
Output is correct |
3 |
Correct |
18 ms |
3428 KB |
Output is correct |
4 |
Correct |
19 ms |
3684 KB |
Output is correct |
5 |
Correct |
13 ms |
3044 KB |
Output is correct |
6 |
Correct |
15 ms |
3044 KB |
Output is correct |
7 |
Correct |
13 ms |
3044 KB |
Output is correct |
8 |
Correct |
13 ms |
3044 KB |
Output is correct |
9 |
Correct |
9 ms |
3172 KB |
Output is correct |
10 |
Correct |
8 ms |
2788 KB |
Output is correct |
11 |
Correct |
7 ms |
2916 KB |
Output is correct |
12 |
Correct |
9 ms |
2916 KB |
Output is correct |
13 |
Correct |
15 ms |
3172 KB |
Output is correct |
14 |
Correct |
15 ms |
3300 KB |
Output is correct |
15 |
Incorrect |
17 ms |
3428 KB |
Output isn't correct |
16 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
75 ms |
3808 KB |
Output is correct |
2 |
Correct |
88 ms |
3808 KB |
Output is correct |
3 |
Execution timed out |
4062 ms |
4040 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
343 ms |
16412 KB |
Output is correct |
2 |
Correct |
380 ms |
16468 KB |
Output is correct |
3 |
Execution timed out |
4054 ms |
15324 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |