oj.uz

Submission #239177

# Submission time Handle Problem Language Result Execution time Memory
239177 2020-06-14T17:05:17 Z Fasho Teams (IOI15_teams) C++14
34 / 100
 4000 ms 22904 KB 
#include "teams.h" //
#include <bits/stdc++.h>
#define TT 200005
#define ll long long int 	
#define MP make_pair
#define pb push_back
#define ppb pop_back
#define sp " "
#define endl "\n"
#define fi first
#define se second
#define ii pair<int,int>
#define lli pair<ll,ll>
#define fast cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false)
#define fast2 freopen ("in.txt","r",stdin);freopen ("out.txt","w",stdout);
#define mod 1000000007
#define fs(x,y) for(ll i=1;i<=y;i++) cin>>x[i]
#define fo(i,x,y) for(ll i=x;i<=y;i++)
#define INF 1000000000005
#define ull unsigned long long int
using namespace std;


int ar[TT],n,m,t;
ll tut1[TT],tut2[TT];

lli p[TT];

int bos[TT];
ll sum=1e18;

priority_queue<ll> pq;


void init(int N, int A[], int B[]) {

	n=N;
	// fo(i,0,n-1)  //
	// 	A[i]=p[i].fi,B[i]=p[i].se; //
	fo(i,0,n-1)
		p[i].fi=A[i],p[i].se=B[i];
	sort(p,p+n);

}

int can(int M, int K[]) {
	m=M;

	// fo(i,0,m-1) // 
	// K[i]=ar[i]; // 

	fo(i,0,m-1)
		ar[i]=K[i];
	sort(ar,ar+m);
	while(pq.size())
		pq.pop();
	int l=0;
	fo(i,0,m-1)
	{
		while(l<n && p[l].fi<=ar[i])
			pq.push(-p[l].se),l++;
		while(pq.size())
		{
			ll x=-pq.top();
			if(x>=ar[i])
				break;
			pq.pop();
		}
		// cout<<i<<sp<<ar[i]<<sp<<pq.size()<<endl;
		if(pq.size()<ar[i])
			return 0;
		fo(j,1,ar[i])
			pq.pop();
	}
	return 1;
}

// int main()
// {
// 	fast;
// 	// int a,b;
// 	// cin>>n>>a>>b;
// 	cin>>n;
// 	fo(i,0,n-1)
// 	cin>>p[i].fi>>p[i].se;
// 	init(n,bos,bos);
// 	cin>>t;
// 	while(t--)
// 	{
// 		cin>>m;
// 		fo(i,0,m-1)
// 		cin>>ar[i];
// 		cout<<"[d]"<<endl;
// 		fo(i,0,m-1)
// 		cout<<ar[i]<<sp;
// 		cout<<endl;
// 		cout<<can(m,bos)<<endl;
// 	}


// }

Compilation message

teams.cpp: In function 'int can(int, int*)':
teams.cpp:70:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(pq.size()<ar[i])
      ~~~~~~~~~^~~~~~

Subtask #1
21.0 / 21.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 2816 KB Output is correct
2 Correct 20 ms 3840 KB Output is correct
3 Correct 29 ms 4984 KB Output is correct
4 Correct 23 ms 4864 KB Output is correct
5 Correct 20 ms 3576 KB Output is correct
6 Correct 19 ms 3584 KB Output is correct
7 Correct 16 ms 3456 KB Output is correct
8 Correct 16 ms 3456 KB Output is correct
9 Correct 19 ms 4984 KB Output is correct
10 Correct 17 ms 4472 KB Output is correct
11 Correct 15 ms 4472 KB Output is correct
12 Correct 16 ms 4600 KB Output is correct
13 Correct 24 ms 4220 KB Output is correct
14 Correct 22 ms 4856 KB Output is correct
15 Correct 21 ms 4096 KB Output is correct
16 Correct 22 ms 3840 KB Output is correct
17 Correct 21 ms 4096 KB Output is correct
18 Correct 21 ms 4096 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 3232 KB Output is correct
2 Correct 27 ms 4608 KB Output is correct
3 Execution timed out 4070 ms 5240 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 56 ms 22904 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -