oj.uz

Submission #130623

# Submission time Handle Problem Language Result Execution time Memory
130623 2019-07-15T18:43:52 Z mahmoudbadawy Teams (IOI15_teams) C++17
34 / 100
 4000 ms 23264 KB 
#include "teams.h"
#include <bits/stdc++.h>
#define F first
#define S second

using namespace std;

const int N=5e5;
vector< pair<int,int> > v;
int a[N],b[N];
int n;

void init(int nn, int A[], int B[]) {
	n=nn;
	for(int i=0;i<n;i++)
		a[i]=A[i],b[i]=B[i];
}

multiset< int > ss;

int can(int m, int k[]) {
	v.clear(); ss.clear();
	for(int i=0;i<n;i++)
	{
		v.push_back({a[i],-(i+1)});
		v.push_back({b[i],i+1});
	}
	for(int i=0;i<m;i++)
	{
		v.push_back({k[i],0});
	}
	sort(v.begin(),v.end());
	for(int i=0;i<v.size();i++)
	{
		if(v[i].S<0)
		{
			ss.insert(b[-v[i].S-1]);
		}
		else if(v[i].S>0)
		{
			if(ss.find(b[v[i].S-1])!=ss.end())
				ss.erase(ss.find(b[v[i].S-1]));
		}
		else
		{
			int x=v[i].F;
			while(x--){
				auto it=ss.lower_bound(v[i].F);
				if(it==ss.end()) return 0;
				ss.erase(it);
			}
		}
	}
	return 1;
}

Compilation message

teams.cpp: In function 'int can(int, int*)':
teams.cpp:33:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<v.size();i++)
              ~^~~~~~~~~

Subtask #1
21.0 / 21.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 5224 KB Output is correct
2 Correct 33 ms 5228 KB Output is correct
3 Correct 81 ms 6888 KB Output is correct
4 Correct 42 ms 7912 KB Output is correct
5 Correct 43 ms 4844 KB Output is correct
6 Correct 44 ms 4840 KB Output is correct
7 Correct 33 ms 4840 KB Output is correct
8 Correct 33 ms 4884 KB Output is correct
9 Correct 57 ms 9448 KB Output is correct
10 Correct 55 ms 8936 KB Output is correct
11 Correct 55 ms 8808 KB Output is correct
12 Correct 48 ms 8552 KB Output is correct
13 Correct 53 ms 7144 KB Output is correct
14 Correct 64 ms 8912 KB Output is correct
15 Correct 80 ms 6504 KB Output is correct
16 Correct 34 ms 5228 KB Output is correct
17 Correct 52 ms 5736 KB Output is correct
18 Correct 54 ms 5836 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4033 ms 5484 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4046 ms 23264 KB Time limit exceeded
2 Halted 0 ms 0 KB -