oj.uz

Submission #149366

# Submission time Handle Problem Language Result Execution time Memory
149366 2019-09-01T06:20:16 Z Little Piplup(#3742, gratus907, DHdroid, coffeetea99) King of Chairs (FXCUP4_chairs) C++17
95 / 100
 526 ms 6188 KB 
#include "king.h"
#include <bits/stdc++.h>
long long SendInfo(std::vector<int> W, std::vector<int> C) 
{
	int N = W.size();
	sort(C.begin(),C.end());
	sort(W.begin(),W.end());
	std::vector <bool> able(N, false);
	std::vector <bool> FC(N, false);
	long long maxweight = 0;
	long long maxchair = 0;
	for (int i = 0; i<N; i++)
	{
		int u = std::lower_bound(C.begin(),C.end(),W[i])-C.begin();
		while(u < N && FC[u])
		{
			u++;
		}
		if (u == N)
		{
			continue;
		}
		else 
		{
			FC[u] = 1;
			maxweight = std::max(maxweight,(long long)W[i]);
			maxchair = std::max(maxchair, (long long)u);
		}
	}
	return maxchair;
}

#include "vassal.h"
#include <algorithm>
long long BB;
std::vector <int> Chairs;
bool fullchair[101010];
void Init(long long B, std::vector<int> C)
{
	int N = C.size();
	Chairs = C;
	sort(Chairs.begin(),Chairs.end());
	BB = Chairs[B];
}

int Maid(int W)
{
	if (W > BB)
		return -1;
	int N = Chairs.size();
	int u = std::lower_bound(Chairs.begin(),Chairs.end(),W)-Chairs.begin();
	while(u < N && fullchair[u])
	{
		u++;
	}
	if (u == N)
	{
		return -1;
	}
	else 
	{
		fullchair[u] = 1;
		return u;
	}
}

Compilation message

vassal.cpp: In function 'void Init(long long int, std::vector<int>)':
vassal.cpp:8:6: warning: unused variable 'N' [-Wunused-variable]
  int N = C.size();
      ^

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1044 KB Correct
2 Correct 11 ms 1044 KB Correct
3 Correct 11 ms 1044 KB Correct
4 Correct 10 ms 1040 KB Correct
5 Correct 11 ms 972 KB Correct

Subtask #2
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 3580 KB Correct
2 Correct 150 ms 5768 KB Correct
3 Correct 502 ms 6188 KB Correct
4 Correct 132 ms 6180 KB Correct
5 Correct 149 ms 5676 KB Correct
6 Correct 154 ms 6184 KB Correct
7 Correct 508 ms 5932 KB Correct

Subtask #3
40.0 / 45.0

# Verdict Execution time Memory Grader output
1 Partially correct 80 ms 3688 KB B = 51294
2 Partially correct 164 ms 5768 KB B = 91757
3 Partially correct 519 ms 6184 KB B = 99999
4 Partially correct 173 ms 6184 KB B = 99999
5 Partially correct 195 ms 6180 KB B = 99999
6 Partially correct 146 ms 6180 KB B = 99999
7 Partially correct 526 ms 6188 KB B = 99999
8 Correct 106 ms 6064 KB Correct