oj.uz

Submission #148964

# Submission time Handle Problem Language Result Execution time Memory
148964 2019-09-01T05:28:26 Z =SUM(D1:D9)(#3629, ydk1104, stet_stet, Hyperbolic) King of Chairs (FXCUP4_chairs) C++17
0 / 100
 73 ms 7100 KB 
#include "king.h"
#include <algorithm>

long long SendInfo(std::vector<int> W, std::vector<int> C) {
	int N = W.size();
	std::sort(W.begin(),W.end());
	std::sort(C.begin(),C.end());
	
	int min = 0, max = N;
	int ans = 0;
	
	while(min<=max)
	{
		int h = (min+max)/2;
		for(int i=1;i<=h;i++) if(W[i]>C[N+i-h]) goto u;
		ans = h;
		min = h+1;
		continue;
		u:;
		max = h-1;
	}
	if(ans==0) return 0;
	else return W[ans-1];
}

#include "vassal.h"
#include <algorithm>
#include <map>

std::multimap<long long int,int> M;

long long limit;
int check[100010];
int next[100010],size[100010];

bool cmp(std::pair<int,int> A, std::pair<int,int> B)
{
	return A.first<B.first;
}

void Init(long long B, std::vector<int> C){
	int N = C.size();
	limit = B;
	
	for(int i=0;i<N;i++) M.insert(std::make_pair(C[i],i));
	
	for(int i=0;i<N;i++) size[i] = 1, next[i] = i;
}

int Maid(int W){
	if(W>limit) return -1;
	else
	{
		std::map<long long int,int> ::iterator it;
		it = M.lower_bound(W);
		if(it==M.end()) return -1;
		else
		{
			int ans = it->second;
			M.erase(it);
			return ans;
		}
	}
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1060 KB Correct
2 Incorrect 11 ms 1060 KB Wrong
3 Halted 0 ms 0 KB -

Subtask #2
0 / 38.0

# Verdict Execution time Memory Grader output
1 Incorrect 65 ms 7100 KB Wrong
2 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Incorrect 73 ms 7100 KB Wrong
2 Halted 0 ms 0 KB -