# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
432241 |
2021-06-18T05:58:44 Z |
jeqcho |
Teams (IOI15_teams) |
C++17 |
|
4000 ms |
11404 KB |
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
#define FOR(i,a,b) for(int i=a;i<b;++i)
#define F0R(i,b) FOR(i,0,b)
#define ROF(i,a,b) for(int i=b-1;i>=a;--i)
#define R0F(i,b) ROF(i,0,b)
#define trav(a,x) for(auto&a:x)
#define all(x) begin(x),end(x)
#define fi first
#define se second
#define pb push_back
#define sz(x) int(x.size())
int const N=1e5+3;
int A[N],B[N];
int n;
pii stu[N];
bool used[N];
void init(int n1, int A1[], int B1[]) {
n=n1;
F0R(i,n)
{
A[i]=A1[i];
B[i]=B1[i];
stu[i]={A[i],B[i]};
}
sort(stu,stu+n);
}
int can(int m, int K[]) {
sort(K,K+m);
fill(used,used+n,0);
R0F(i,m)
{
bool ok=0;
int cnt=0;
R0F(sta,K[i]+1)
{
int idex=lower_bound(stu,stu+n,pii{sta,-1})-stu;
int edex=upper_bound(stu,stu+n,pii{sta,1e9})-stu;
FOR(k,idex,edex)
{
if(used[k])continue;
if(stu[k].se>=K[i])
{
++cnt;
used[k]=1;
if(cnt==K[i])
{
ok=1;
break;
}
}
}
if(ok)break;
}
if(!ok)return 0;
}
return 1;
}
Compilation message
teams.cpp: In function 'int can(int, int*)':
teams.cpp:49:47: warning: conversion from 'long int' to 'int' may change value [-Wconversion]
49 | int idex=lower_bound(stu,stu+n,pii{sta,-1})-stu;
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
teams.cpp:50:48: warning: conversion from 'long int' to 'int' may change value [-Wconversion]
50 | int edex=upper_bound(stu,stu+n,pii{sta,1e9})-stu;
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Correct |
1 ms |
204 KB |
Output is correct |
10 |
Correct |
1 ms |
204 KB |
Output is correct |
11 |
Correct |
0 ms |
204 KB |
Output is correct |
12 |
Correct |
1 ms |
332 KB |
Output is correct |
13 |
Correct |
1 ms |
204 KB |
Output is correct |
14 |
Correct |
1 ms |
204 KB |
Output is correct |
15 |
Correct |
1 ms |
204 KB |
Output is correct |
16 |
Correct |
1 ms |
204 KB |
Output is correct |
17 |
Correct |
1 ms |
204 KB |
Output is correct |
18 |
Correct |
1 ms |
204 KB |
Output is correct |
19 |
Correct |
1 ms |
204 KB |
Output is correct |
20 |
Correct |
1 ms |
204 KB |
Output is correct |
21 |
Correct |
1 ms |
204 KB |
Output is correct |
22 |
Correct |
1 ms |
204 KB |
Output is correct |
23 |
Correct |
1 ms |
204 KB |
Output is correct |
24 |
Correct |
1 ms |
204 KB |
Output is correct |
25 |
Correct |
1 ms |
204 KB |
Output is correct |
26 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
19 ms |
2660 KB |
Output is correct |
2 |
Correct |
17 ms |
2728 KB |
Output is correct |
3 |
Correct |
26 ms |
2752 KB |
Output is correct |
4 |
Correct |
19 ms |
3012 KB |
Output is correct |
5 |
Correct |
12 ms |
2764 KB |
Output is correct |
6 |
Correct |
14 ms |
2636 KB |
Output is correct |
7 |
Correct |
12 ms |
2660 KB |
Output is correct |
8 |
Correct |
12 ms |
2636 KB |
Output is correct |
9 |
Correct |
1613 ms |
2868 KB |
Output is correct |
10 |
Correct |
1251 ms |
2804 KB |
Output is correct |
11 |
Correct |
145 ms |
2740 KB |
Output is correct |
12 |
Correct |
37 ms |
2752 KB |
Output is correct |
13 |
Correct |
28 ms |
2728 KB |
Output is correct |
14 |
Correct |
23 ms |
2644 KB |
Output is correct |
15 |
Correct |
16 ms |
2660 KB |
Output is correct |
16 |
Correct |
17 ms |
2636 KB |
Output is correct |
17 |
Correct |
14 ms |
2656 KB |
Output is correct |
18 |
Correct |
14 ms |
2660 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
41 ms |
3164 KB |
Output is correct |
2 |
Correct |
55 ms |
3032 KB |
Output is correct |
3 |
Execution timed out |
4085 ms |
2732 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
41 ms |
11404 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |