oj.uz

답안 #150973

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
150973 2019-09-01T13:23:46 Z baikdohyup King of Chairs (FXCUP4_chairs) C++17
17 / 100
 1000 ms 8676 KB 
#include "king.h"

long long SendInfo(std::vector<int> W, std::vector<int> C) {
	return 0;
}


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

std::vector<std::pair<int, int>> chair;

void Init(long long B, std::vector<int> C){
	int N = C.size();

	for (int i = 0; i < N; i++) {
		chair.push_back(std::pair<int,int>(C[i], i));
	}
}

int findidx(int first, int last, int weight, int cut) {
	int mid;

	while (first <= last) {
		mid = (first + last) / 2;
		
		if (mid != cut && chair[mid - 1].first < weight && chair[mid].first >= weight) {
			return mid;
		}
		else if (chair[mid].first < weight) {
			first = mid + 1;
		}
		else if (chair[mid].first >= weight && mid == cut) {
			return mid;
		}
		else {
			last = mid - 1;
		}
	}

	return -1;
}

int Maid(int W){
	int first = 0, last = (int)chair.size() - 1;
	int idx;

	while (1) {
		idx = findidx(first, last, W, first);

		if (idx == -1) {
			return -1;
		}

		if (chair[idx].second != -1) {
			int temp = chair[idx].second;
			chair[idx].second = -1;

			return temp;
		}
		else {
			first = idx + 1;
		}
	}

	return -1;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 764 KB Correct
2 Correct 4 ms 892 KB Correct
3 Correct 4 ms 976 KB Correct
4 Correct 4 ms 764 KB Correct
5 Correct 4 ms 892 KB Correct

Subtask #2
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 253 ms 5144 KB Correct
2 Execution timed out 1121 ms 7884 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 305 ms 5004 KB Correct
2 Execution timed out 1127 ms 8676 KB Time limit exceeded
3 Halted 0 ms 0 KB -