oj.uz

Submission #153470

# Submission time Handle Problem Language Result Execution time Memory
153470 2019-09-14T08:45:11 Z phpark King of Chairs (FXCUP4_chairs) C++17
0 / 100
 66 ms 6412 KB 
#include "king.h"
using namespace std;
long long SendInfo(vector <int> W, vector <int> C)
{
	return 1;
}
#include <set>
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include "vassal.h"
using namespace std;
static multiset <int> sit;
static vector <pair<int, int>> chair;
static int N;
void Init(long long B, vector <int> C)
{
	N = C.size();
	chair.resize(N);
	
	for (int i = 0; i < N; i++) chair.push_back(make_pair(C[i], i));
	
	for (int i = 0; i < N; i++) sit.insert(chair[i].first);
}

int Maid(int w)
{
	int left = 0, right = N, mid = 0;
	auto itr = sit.lower_bound(w);
	if (itr == sit.end()) {
		
		return -1;
	}
	else {
		int ans = *itr;    //고른 의자 무게

		int idx = 0;   //고른 의자가 현재의자배열의 어디에 있는가

		while (right <= left) {
			if (ans < chair[mid].first) {
				right = mid - 1;
			}
			else if (chair[mid].first < ans) {
				left = mid + 1;
			}
			else {
				idx = mid;
			}
		}

		int chair_num = chair[idx].second;    //고른 의자의 원래 배열의 인덱스
		
		

		chair.erase(chair.begin()+idx);
		sit.erase(sit.find(ans));
		
		return chair_num;
	}
	
}

Subtask #1
0 / 17.0

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

Subtask #2
0 / 38.0

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

Subtask #3
0 / 45.0

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