oj.uz

Submission #542787

# Submission time Handle Problem Language Result Execution time Memory
542787 2022-03-28T03:55:27 Z adamjinwei Teams (IOI15_teams) C++14
34 / 100
 4000 ms 19144 KB 
#include <bits/stdc++.h>
#include "teams.h"
#define inf 1000000007
#define mod 1000000007
// #define int long long
// #pragma GCC optimize("Ofast","inline","-ffast-math")
// #pragma GCC target("avx,sse2,sse3,sse4,mmx")
using namespace std;
template <typename T> void read(T &x){
	x=0;char ch=getchar();int fh=1;
	while (ch<'0'||ch>'9'){if (ch=='-')fh=-1;ch=getchar();}
	while (ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
	x*=fh;
}
template <typename T> void write(T x) {
	if (x<0) x=-x,putchar('-');
	if (x>9) write(x/10);
	putchar(x%10+'0');
}
template <typename T> void writeln(T x) {
	write(x);
	puts("");
}
int n;
pair<int,int> p[500005];
int q;
int m,k[500005];
void init(int N,int A[],int B[])
{
	n=N;
	for(int i=1;i<=n;++i)
		p[i]={A[i-1],B[i-1]};
	sort(p+1,p+n+1);
}
int can(int M,int K[])
{
	m=M;
	for(int i=1;i<=m;++i)
		k[i]=K[i-1];
	sort(k+1,k+m+1);
	int pos=1;
	priority_queue<int,vector<int>,greater<int>> pq;
	bool flag=true;
	for(int i=1;i<=m;++i)
	{
		while(pos<=n&&p[pos].first<=k[i])
			pq.push(p[pos++].second);
		while(!pq.empty()&&pq.top()<k[i]) pq.pop();
		for(int j=1;j<=k[i];++j)
			if(pq.empty())
			{
				flag=false;break;
			}
			else pq.pop();
	}
	return flag;
}

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 304 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 3012 KB Output is correct
2 Correct 14 ms 3020 KB Output is correct
3 Correct 25 ms 3580 KB Output is correct
4 Correct 17 ms 3996 KB Output is correct
5 Correct 12 ms 2616 KB Output is correct
6 Correct 13 ms 2588 KB Output is correct
7 Correct 11 ms 2592 KB Output is correct
8 Correct 12 ms 2620 KB Output is correct
9 Correct 10 ms 3576 KB Output is correct
10 Correct 9 ms 3152 KB Output is correct
11 Correct 9 ms 3152 KB Output is correct
12 Correct 9 ms 3152 KB Output is correct
13 Correct 17 ms 3224 KB Output is correct
14 Correct 17 ms 3392 KB Output is correct
15 Correct 14 ms 3016 KB Output is correct
16 Correct 14 ms 3040 KB Output is correct
17 Correct 15 ms 3136 KB Output is correct
18 Correct 15 ms 3136 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 3788 KB Output is correct
2 Correct 25 ms 3740 KB Output is correct
3 Execution timed out 4072 ms 4472 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 16216 KB Output is correct
2 Correct 102 ms 16296 KB Output is correct
3 Execution timed out 4008 ms 19144 KB Time limit exceeded
4 Halted 0 ms 0 KB -