oj.uz

Submission #363778

# Submission time Handle Problem Language Result Execution time Memory
363778 2021-02-07T09:05:56 Z silverfish Hotel (CEOI11_hot) C++14
30 / 100
 832 ms 35932 KB 
#include <bits/stdc++.h>
using namespace std;
 
/*<DEBUG>*/
#define tem template <typename 
#define can_shift(_X_, ...) enable_if_t<sizeof test<_X_>(0) __VA_ARGS__ 8, debug&> operator<<(T i)
#define _op debug& operator<<
tem C > auto test(C *x) -> decltype(cerr << *x, 0LL);
tem C > char test(...);
tem C > struct itr{C begin, end; };
tem C > itr<C> get_range(C b, C e) { return itr<C>{b, e}; }
struct debug{
#ifdef _LOCAL
	~debug(){ cerr << endl; }
	tem T > can_shift(T, ==){ cerr << boolalpha << i; return *this; }
	tem T> can_shift(T, !=){ return *this << get_range(begin(i), end(i)); }
	tem T, typename U > _op (pair<T, U> i){ 
		return *this << "< " << i.first << " , " << i.second << " >"; }
	tem T> _op (itr<T> i){
		*this <<  "{ ";
		for(auto it = i.begin; it != i.end; it++){
			*this << " , " + (it==i.begin?2:0) << *it;
		}
		return *this << " }";
	}
#else
tem T> _op (const T&) { return *this; }
#endif 
};
 
string _ARR_(int* arr, int sz){
	string ret = "{ " + to_string(arr[0]); 
	for(int i = 1; i < sz; i++) ret += " , " +  to_string(arr[i]);
	ret += " }"; return ret;
}
 
#define exp(...) " [ " << #__VA_ARGS__ << " : " << (__VA_ARGS__) << " ]"
/*</DEBUG>*/
 
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<int, int> pii;
//mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
#define pb push_back
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define TC int __TC__; cin >> __TC__; while(__TC__--)
#define ar array
 
const int INF = 1e9 + 7, N = 5e5;
 
int n, m, o;
ar<ll,2> offer[N];
//size room, cost room, size offer, cost offer
set<ar<ll,2>> rooms;
vector<ll> profit;
 
int main(void)
{
	FAST;
	cin >> n >> m >> o;
	for(int i = 0; i < n; ++i){
		ar<ll,2> room;
		cin >> room[1] >> room[0];
		rooms.insert(room);
	}
 
	for(int i = 0; i < m; ++i) cin >> offer[i][1] >> offer[i][0];
 
	sort(offer, offer+m, [](const ar<ll,2> &a, const ar<ll,2> &b){
		if(a[1] == b[1]) return a[0] > b[0];
		return a[1] > b[1];
	});

	for(int i = 0; i < m; ++i){
		auto it = rooms.lower_bound({offer[i][0], -INF});	
		if(it == rooms.end()) continue;
		//debug() << exp(offer[i]) exp(*it);
		ll cur_profit = offer[i][1] - (*it)[1];
		if(cur_profit > 0){
			profit.pb(cur_profit);
			rooms.erase(it);
		}
	}
 
	ll ans = 0;
	sort(profit.rbegin(), profit.rend());
	for(int i = 1; i < (int)profit.size(); ++i){
		assert(profit[i] <= profit[i-1]);
	}
 
	for(int i= 0; i < min(o, (int)profit.size()); ++i){
		ans += profit[i];
	}
	cout << ans << '\n';
 
 
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1132 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 65 ms 3820 KB Output isn't correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 95 ms 6508 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 385 ms 18148 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 832 ms 35932 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 743 ms 26160 KB Output isn't correct
2 Halted 0 ms 0 KB -