oj.uz

Submission #158354

# Submission time Handle Problem Language Result Execution time Memory
158354 2019-10-16T16:34:10 Z johutha Teams (IOI15_teams) C++14
34 / 100
 4000 ms 44864 KB 
#include "teams.h"
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>


using namespace std;

struct event
{
	int tm;
	int pr = -1;
	int nr = -1;
};

bool evsort(event e1, event e2)
{
	if (e1.tm != e2.tm) return e1.tm < e2.tm;
	return e1.pr < e2.pr;
}

vector<event> evs;
vector<int> st;
vector<int> en;

void init(int N, int A[], int B[]) 
{
	for (int i = 0; i < N; i++)
	{
		st.push_back(A[i]);
		en.push_back(B[i]);
		event nw;
		nw.tm = A[i];
		nw.nr = i;
		nw.pr = -1;
		evs.push_back(nw);
		event ene;
		ene.tm = B[i];
		ene.nr = i;
		ene.pr = 1;
		evs.push_back(ene);
	}
}

int can(int M, int K[])
{
	vector<event> evcopy = evs;
	for (int i = 0; i < M; i++)
	{
		event mev;
		mev.tm = K[i];
		mev.nr = -1;
		mev.pr = 0;
		evcopy.push_back(mev);
	}
	sort(evcopy.begin(), evcopy.end(), evsort);

	multiset<int> active;
	for (auto e : evcopy)
	{
		if (e.pr == 0)
		{
			if (active.size() < e.tm)
			{
				return 0;
			}
			auto it = active.begin();
			for (int i = 0; i < e.tm; i++)
			{
				it = active.erase(it);
			}
		}
		else if (e.pr == -1)
		{
			active.insert(en[e.nr]);
		}
		else
		{
			if (active.find(e.tm) != active.end()) active.erase(active.find(e.tm));
		}
	}
	return 1;
}

Compilation message

teams.cpp: In function 'int can(int, int*)':
teams.cpp:64:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if (active.size() < e.tm)
        ~~~~~~~~~~~~~~^~~~~~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 292 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 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 4 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 3 ms 296 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 5 ms 292 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 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 256 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 252 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 9384 KB Output is correct
2 Correct 46 ms 9356 KB Output is correct
3 Correct 87 ms 9384 KB Output is correct
4 Correct 55 ms 9764 KB Output is correct
5 Correct 48 ms 10280 KB Output is correct
6 Correct 48 ms 10152 KB Output is correct
7 Correct 38 ms 10152 KB Output is correct
8 Correct 38 ms 10240 KB Output is correct
9 Correct 59 ms 12800 KB Output is correct
10 Correct 58 ms 12344 KB Output is correct
11 Correct 54 ms 12028 KB Output is correct
12 Correct 49 ms 11768 KB Output is correct
13 Correct 54 ms 10408 KB Output is correct
14 Correct 66 ms 12160 KB Output is correct
15 Correct 84 ms 10532 KB Output is correct
16 Correct 45 ms 10536 KB Output is correct
17 Correct 50 ms 10532 KB Output is correct
18 Correct 52 ms 10404 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4014 ms 9384 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 4034 ms 44864 KB Time limit exceeded
2 Halted 0 ms 0 KB -