oj.uz

Submission #154036

# Submission time Handle Problem Language Result Execution time Memory
154036 2019-09-17T18:55:40 Z youssefbou62 Teams (IOI15_teams) C++14
34 / 100
 4000 ms 33296 KB 
#include  <bits/stdc++.h>
#include "teams.h"
using namespace std;

#define mp make_pair
#define fi first
#define se second
#define all(v) v.begin(),v.end()
#define allarr(a) a , a + n
#define ll long long
#define ull unsigned long long 
#define pb push_back
#define fastio ios_base::sync_with_stdio(false) ; cin.tie(NULL); cout.tie(NULL)
typedef pair<int, int> pi;
typedef pair<ll,ll> pll; 
typedef pair<int,pi> trp ;
typedef vector<pi> vpi;
typedef vector<pll> vpll ;
// int ab  (int  x ) { return (x>0?x:-x); }
const int MaxN = 5e5+5; 
pi st[MaxN];
int n ,pr[MaxN];  
vector<int> in[MaxN]; 
void init(int N,int a[],int b[]){
	n = N ; 
	for(int i = 0 ; i < n ;i++ ){
		st[i]={a[i],b[i]};
		in[a[i]].pb(b[i]); 
	} 
	// sort(st,st+n); 
}

int can(int M,int K[]){
	// sort(K,K+M); 
	memset(pr,0,sizeof pr); 

	for(int i = 0 ; i < M ; i++ )pr[K[i]]++; 

	priority_queue<int,vector<int>,greater<int> >q ;  	
	for(int i = 1 ; i <= n ; i++ ){
		for(int j : in[i])
			q.push(j);  
		if( pr[i] ){
			if( (int)q.size() >= pr[i]*i ){
				int k = i *pr[i];
				while( k-- )q.pop(); 
			}else return 0; 
		}
		while( !q.empty() && q.top() == i )q.pop(); 
	}

	return 1  ;
} 

// int main(){

// 	int a[]={1,2,2,2},b[]={2,3,3,4};
// 	init(4,a,b); 

// 	int K[]={1,3},KK[]={1,1}; 
// 	cout << can(2,K)<<" " << can(2,KK)<<endl; 

// }

Subtask #1
21.0 / 21.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 17912 KB Output is correct
2 Correct 35 ms 17912 KB Output is correct
3 Correct 44 ms 18296 KB Output is correct
4 Correct 35 ms 18296 KB Output is correct
5 Correct 23 ms 16760 KB Output is correct
6 Correct 23 ms 16760 KB Output is correct
7 Correct 21 ms 16732 KB Output is correct
8 Correct 22 ms 16788 KB Output is correct
9 Correct 27 ms 17520 KB Output is correct
10 Correct 24 ms 17344 KB Output is correct
11 Correct 25 ms 17264 KB Output is correct
12 Correct 28 ms 17392 KB Output is correct
13 Correct 32 ms 17268 KB Output is correct
14 Correct 35 ms 17904 KB Output is correct
15 Correct 50 ms 18168 KB Output is correct
16 Correct 34 ms 17784 KB Output is correct
17 Correct 28 ms 16888 KB Output is correct
18 Correct 32 ms 16888 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 18296 KB Output is correct
2 Correct 70 ms 18296 KB Output is correct
3 Execution timed out 4091 ms 18772 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 198 ms 32504 KB Output is correct
2 Correct 221 ms 31948 KB Output is correct
3 Execution timed out 4008 ms 33296 KB Time limit exceeded
4 Halted 0 ms 0 KB -