oj.uz

답안 #762354

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
762354 2023-06-21T10:35:40 Z goodbyehanbyeol King of Chairs (FXCUP4_chairs) C++17
100 / 100
 94 ms 12740 KB 
#include "king.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

ll SendInfo(vector<int> W, vector<int> C) {
	return 0;
}

#include "vassal.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

set<pair<int, int> > st;

void Init(long long B, vector<int> C){
	int n = C.size();
	for(int i=0; i<n; i++) st.insert(make_pair(C[i], i));
}

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

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 520 KB Correct
2 Correct 0 ms 520 KB Correct
3 Correct 0 ms 520 KB Correct
4 Correct 1 ms 512 KB Correct
5 Correct 1 ms 604 KB Correct

Subtask #2
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 6716 KB Correct
2 Correct 56 ms 11540 KB Correct
3 Correct 60 ms 12612 KB Correct
4 Correct 61 ms 12556 KB Correct
5 Correct 66 ms 12632 KB Correct
6 Correct 61 ms 12652 KB Correct
7 Correct 66 ms 12652 KB Correct

Subtask #3
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 6876 KB Correct
2 Correct 73 ms 11692 KB Correct
3 Correct 68 ms 12560 KB Correct
4 Correct 94 ms 12740 KB Correct
5 Correct 77 ms 12648 KB Correct
6 Correct 87 ms 12600 KB Correct
7 Correct 69 ms 12604 KB Correct
8 Correct 65 ms 12476 KB Correct