oj.uz

답안 #148721

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
148721 2019-09-01T04:59:49 Z Powered By Zigui(#3580, aaaa, evenharder, best_sheild97) King of Chairs (FXCUP4_chairs) C++17
100 / 100
 182 ms 10444 KB 
#include "king.h"
#include <bits/stdc++.h>
 
#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define INF  (1<<30)
#define INFL (1LL<<60)
#define EPS ((ld)(1e-9))
 
#define sz(x) ((int)(x).size())
#define setz(x) memset(x, 0, sizeof(x))
#define all(x) (x).begin(), (x).end()
#define rep(i, e) for (int i = 0, _##i = (e); i < _##i; i++)
#define repp(i, s, e) for (int i = (s), _##i = (e); i < _##i; i++)
#define repr(i, s, e) for (int i = (s)-1, _##i = (e); i >= _##i; i--)
#define repi(i, x) for (auto &i : (x))
#define ARR(...) vector<int>({__VA_ARGS__})
#define ARS(...) vector<string>({__VA_ARGS__})
 
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef complex<double> base;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
 
template<typename T, typename V>
ostream &operator<<(ostream &os, const pair<T, V> pai) { 
    return os << '(' << pai.first << ' ' << pai.second << ')';
}
 
template<typename T>
ostream &operator<<(ostream &os, const vector<T> v) {
    cout << '[';
    for (auto p : v) cout << p << ",";
    cout << "]";
    return os;
}
 
template<typename T, typename V>
ostream &operator<<(ostream &os, const set<T, V> v) {
    cout << "{";
    for (auto p : v) cout << p << ",";
    cout << "}";
    return os;
}
 
template<typename T, typename V>
ostream &operator<<(ostream &os, const map<T, V> v) {
    cout << "{";
    for (auto p : v) cout << p << ",";
    cout << "}";
    return os;
}
 
#ifndef __SOULTCH
#define debug(...) 0
#define endl '\n'
#else
#define debug(...) cout << " [-] ", _dbg(#__VA_ARGS__, __VA_ARGS__)
template<class TH> void _dbg(const char *sdbg, TH h){ cout << sdbg << '=' << h << endl; }
template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
    while(*sdbg != ',') cout << *sdbg++;
    cout << '=' << (h) << ','; 
    _dbg(sdbg+1, a...);
}
#endif
 
template<typename T> void get_max(T &a, T b) {a = max(a, b);}
template<typename T> void get_min(T &a, T b) {a = min(a, b);}

long long SendInfo(vector<int> W, vector<int> C) {
	int N = W.size();
	
	sort(all(W));
	sort(all(C));
	
		
	int p = 0, e = 0;
	for (e = 0; e < N; e++) {
		while(p < N and W[e] > C[p]) p++;
		if (p == N) break;
		p++;
	}
	
	//cout << e << endl;
	//cout << "DONE" << endl;
	
	return 0;
}























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

#define fi first
#define se second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define INF  (1<<30)
#define INFL (1LL<<60)
#define EPS ((ld)(1e-9))
 
#define sz(x) ((int)(x).size())
#define setz(x) memset(x, 0, sizeof(x))
#define all(x) (x).begin(), (x).end()
#define rep(i, e) for (int i = 0, _##i = (e); i < _##i; i++)
#define repp(i, s, e) for (int i = (s), _##i = (e); i < _##i; i++)
#define repr(i, s, e) for (int i = (s)-1, _##i = (e); i >= _##i; i--)
#define repi(i, x) for (auto &i : (x))
#define ARR(...) vector<int>({__VA_ARGS__})
#define ARS(...) vector<string>({__VA_ARGS__})
 
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef complex<double> base;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
 
template<typename T, typename V>
ostream &operator<<(ostream &os, const pair<T, V> pai) { 
    return os << '(' << pai.first << ' ' << pai.second << ')';
}
 
template<typename T>
ostream &operator<<(ostream &os, const vector<T> v) {
    cout << '[';
    for (auto p : v) cout << p << ",";
    cout << "]";
    return os;
}
 
template<typename T, typename V>
ostream &operator<<(ostream &os, const set<T, V> v) {
    cout << "{";
    for (auto p : v) cout << p << ",";
    cout << "}";
    return os;
}
 
template<typename T, typename V>
ostream &operator<<(ostream &os, const map<T, V> v) {
    cout << "{";
    for (auto p : v) cout << p << ",";
    cout << "}";
    return os;
}
 
#ifndef __SOULTCH
#define debug(...) 0
#define endl '\n'
#else
#define debug(...) cout << " [-] ", _dbg(#__VA_ARGS__, __VA_ARGS__)
template<class TH> void _dbg(const char *sdbg, TH h){ cout << sdbg << '=' << h << endl; }
template<class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
    while(*sdbg != ',') cout << *sdbg++;
    cout << '=' << (h) << ','; 
    _dbg(sdbg+1, a...);
}
#endif
 
template<typename T> void get_max(T &a, T b) {a = max(a, b);}
template<typename T> void get_min(T &a, T b) {a = min(a, b);}


set<pii> chair;
long long B;
void Init(long long BB, vector<int> C){
	int N = C.size();
	B = BB;
	
	rep(i, N) chair.insert({C[i], i});
	//cout << chair << endl;
}

int Maid(int W) {
	auto p = chair.lower_bound({W, -1});
	if (p == chair.end()) return -1;
	
	int res = p->se;
	chair.erase(p);
	//cout << res << ' ';
	return res;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 1040 KB Correct
2 Correct 10 ms 1048 KB Correct
3 Correct 10 ms 1052 KB Correct
4 Correct 10 ms 1040 KB Correct
5 Correct 11 ms 1140 KB Correct

Subtask #2
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 5936 KB Correct
2 Correct 119 ms 9620 KB Correct
3 Correct 124 ms 10440 KB Correct
4 Correct 125 ms 10432 KB Correct
5 Correct 124 ms 10384 KB Correct
6 Correct 123 ms 10436 KB Correct
7 Correct 127 ms 10444 KB Correct

Subtask #3
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 5944 KB Correct
2 Correct 152 ms 9624 KB Correct
3 Correct 145 ms 9896 KB Correct
4 Correct 177 ms 10436 KB Correct
5 Correct 164 ms 10436 KB Correct
6 Correct 182 ms 10180 KB Correct
7 Correct 150 ms 10440 KB Correct
8 Correct 137 ms 10348 KB Correct