oj.uz

답안 #149278

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
149278 2019-09-01T06:07:23 Z ----MIT합격선----(#3601, maruii, Diuven, andy627) King of Chairs (FXCUP4_chairs) C++17
100 / 100
 187 ms 10456 KB 
#include "king.h"
#include <algorithm>
using namespace std;
typedef long long lint;

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

#include "vassal.h"
#include <algorithm>
#include <utility>
#include <set>
using namespace std;
typedef pair<int, int> pii;

set<pii> A;
int n;
void Init(long long B, std::vector<int> C){
	n = C.size();
	for(int i=0; i<n; i++) A.insert({C[i], i});
}

int Maid(int W){
	auto it = A.lower_bound({W,0});
	if(it==A.end()) return -1;
	int ret = it->second;
	A.erase(it);
	return ret;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 1056 KB Correct
2 Correct 10 ms 1056 KB Correct
3 Correct 10 ms 1052 KB Correct
4 Correct 10 ms 516 KB Correct
5 Correct 10 ms 548 KB Correct

Subtask #2
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 5948 KB Correct
2 Correct 110 ms 9136 KB Correct
3 Correct 118 ms 10448 KB Correct
4 Correct 118 ms 10452 KB Correct
5 Correct 119 ms 10444 KB Correct
6 Correct 118 ms 10452 KB Correct
7 Correct 114 ms 10448 KB Correct

Subtask #3
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 80 ms 5956 KB Correct
2 Correct 139 ms 9384 KB Correct
3 Correct 142 ms 10368 KB Correct
4 Correct 173 ms 10228 KB Correct
5 Correct 169 ms 10456 KB Correct
6 Correct 187 ms 10448 KB Correct
7 Correct 151 ms 10452 KB Correct
8 Correct 128 ms 10448 KB Correct