oj.uz

Submission #137004

# Submission time Handle Problem Language Result Execution time Memory
137004 2019-07-26T21:34:33 Z arthurconmy Teams (IOI15_teams) C++14
34 / 100
 4000 ms 23168 KB 
#include <bits/stdc++.h>

#ifndef ARTHUR_LOCAL
	#include "teams.h"
#endif

using namespace std;

const int MAXN=100001;
int n;

vector<pair<int,int>> I;

bool comp(pair<int,int> a, pair<int,int> b)
{
	if(a.second != b.second) return a.second < b.second;
	return a.first < b.first;
}

void init(int N, int a[], int b[])
{
	n=N;

	for(int i=0; i<n; i++)
	{
		I.push_back({a[i],b[i]});
	}

	sort(I.begin(),I.end());
}

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

	sort(K,K+m); // ???

	priority_queue<pair<int,int>> PQ; // increasing order of second coordinate

	for(int i=0; i<m; i++)
	{	
		//cout << K[i] << endl;

		while(cur_ind < n && I[cur_ind].first <= K[i])
		{
			//cout << "ADDING " << I[cur_ind].first << " " << I[cur_ind].second << endl;

			PQ.push({-I[cur_ind].second,I[cur_ind].first});
			cur_ind++;
		}

		// cout << PQ.size() << endl;

		while(!PQ.empty() && -PQ.top().first < K[i])
		{
			//cout << "REMOVING " << PQ.top().second << " " << -PQ.top().first << endl;
			PQ.pop();
		}		

		for(int dot=1; dot<=K[i]; dot++)
		{
			if(PQ.empty()) return 0;

			PQ.pop();
			//cout << "PILLY POPPED" << endl;

			while(!PQ.empty() && -PQ.top().first < K[i])
			{
				//cout << "ALSO REMOVING " << PQ.top().second << " " << -PQ.top().first << endl;
				PQ.pop();
			}
		}
	}

	return 1;
}

#ifdef ARTHUR_LOCAL

	int A[4];
	int B[4];
	int K1[2];
	int K2[2];

	int main()
	{
		A[0]=1;
		A[1]=2;
		A[2]=2;
		A[3]=2;

		B[0]=2;
		B[1]=3;
		B[2]=3;
		B[3]=4;

		init(4,A,B);
	
		K1[0]=3;
		K1[1]=1;

		cout << can(2,K1) << endl;

		K2[0]=1;
		K2[1]=1;

		cout << can(2,K2) << endl;
	}

#endif

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 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 256 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 380 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 392 KB Output is correct
19 Correct 2 ms 392 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 256 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 256 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 3440 KB Output is correct
2 Correct 20 ms 3440 KB Output is correct
3 Correct 36 ms 4588 KB Output is correct
4 Correct 22 ms 3568 KB Output is correct
5 Correct 21 ms 3056 KB Output is correct
6 Correct 23 ms 3056 KB Output is correct
7 Correct 15 ms 3056 KB Output is correct
8 Correct 16 ms 3056 KB Output is correct
9 Correct 27 ms 4336 KB Output is correct
10 Correct 24 ms 4056 KB Output is correct
11 Correct 25 ms 4076 KB Output is correct
12 Correct 25 ms 4204 KB Output is correct
13 Correct 31 ms 3820 KB Output is correct
14 Correct 31 ms 4332 KB Output is correct
15 Correct 20 ms 3440 KB Output is correct
16 Correct 19 ms 3444 KB Output is correct
17 Correct 26 ms 3436 KB Output is correct
18 Correct 26 ms 3436 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 3820 KB Output is correct
2 Correct 26 ms 3792 KB Output is correct
3 Execution timed out 4022 ms 5472 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 113 ms 16352 KB Output is correct
2 Correct 113 ms 16452 KB Output is correct
3 Execution timed out 4019 ms 23168 KB Time limit exceeded
4 Halted 0 ms 0 KB -