제출 #940012

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
940012		vjudge1	Cloud Computing (CEOI18_clo)	C++17	0 / 100	1 ms	600 KiB

clo

#include <bits/stdc++.h>
 
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
#define rnd(l, r) uniform_int_distribution<int>(l, r)(rng)
 
using namespace std;

void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);} 
int pow(int a,int b,int m){int ans=1;while(b){if(b&1){ans=(ans*a)%m;}b>>=1;a=(a*a)%m;}return ans;}
int binpow(int a,int b){int ans=1;while(b){if(b&1){ans=(ans*a);}b>>=1;a=(a*a);}return ans;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());



 
main(){
	iostream::sync_with_stdio(false);	
    cin.tie(nullptr);
    cout.tie(nullptr);
	int n, m;
	cin >> n;
	vector <pair <int,int> > a;
	for(int i = 0; i < n; i++){
		int p, b, c;
		cin >> p >> b >> c;
		a.pb({b, c});
	}
	cin >> m;
	vector <pair <int,int> > b;
	for(int i = 0; i < m; i++){
		int p, a, c;
		cin >> p >> a >> c;
		b.pb({a, c});
	}
	multiset <int> cost, took;
	sort(rall(b));
	sort(rall(a));
	int l = 0;
	int ans = 0;
	for(auto x : b){
		while(l < n && a[l].ff >= x.ff){
			cost.insert(a[l].ss);
			l++;
		}
		if(cost.empty() || *cost.begin() >= x.ss){
			if(!took.empty() && *took.begin() < x.ss){
				ans -= *took.begin();
				took.erase(took.begin());
				took.insert(x.ss);
				ans += x.ss;
			}
			continue;
		}
		auto it = cost.upper_bound(x.ss);
		it--;
		ans += -*it + x.ss;
		cost.erase(it);
		took.insert(x.ss);
	}
	cout << ans << endl;
}	
/*
 * Before implementing the problem:
	
	Do I understand the problem correctly?
	Which places are tricky? What do I need to remember to implement them correctly?
	Which place is the heaviest by implementation? Can I do it simpler?
	Which place is the slowest? Where do I need to be careful about constant factors and where I can choose slower but simpler implementation?
	----------------------------------
	If not AC:
 
	Did you remember to do everything to handle the tricky places you thought about before?
	Is the solution correct?
	Do I understand the problem correctly?
	----------------------------------
	If you have a test on which the solution gives wrong answer:
 
	Is the solution doing what it was supposed to do?
	Is the problem in the code or in the idea?
*/

컴파일 시 표준 에러 (stderr) 메시지

clo.cpp:21:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   21 | main(){
      | ^~~~
clo.cpp: In function 'void fp(std::string)':
clo.cpp:13:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
clo.cpp:13:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 18
• Subtask 2: 0 / 18
• Subtask 3: 0 / 18
• Subtask 4: 0 / 18
• Subtask 5: 0 / 18
• Subtask 6: 0 / 10