제출 #1205783

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1205783		asli_bg	Cloud Computing (CEOI18_clo)	C++20	0 / 100	2 ms	584 KiB

clo

#include <bits/stdc++.h>
using namespace std;
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

#define int long long
 
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<bool> vb;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<pll> vll;
 
typedef tree<pii,null_type,less<pii>,rb_tree_tag,
tree_order_statistics_node_update> oset;
 
#define fi first
#define se second
#define pb push_back
#define pf push_front
 
#define mid (l+r)/2
#define all(x) x.begin(),x.end()
#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)
 
#define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl;
#define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;
#define sp <<" "<<
 
#define DEBUG(x) cout<<(#x) sp x<<endl
#define carp(a,b) (((a%MOD)*(b%MOD))%MOD)
#define topla(a,b) (((a%MOD)+(b%MOD))%MOD)
 
const ll INF=1e18;
const int MAXN=505;
const int MAXK=30;
const int MOD=1e9+7;

vii tut[MAXN];

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    vii cost;

    int n;
    cin>>n;
    vii a;
    a.pb({0,0});
    FORE(i,1,n+1){
        int c,f,v;
        cin>>c>>f>>v;
        a.pb({f,v});
        cost.pb({v,i});
    }

    sort(all(cost));

    //contp(cost);

    int m;
    cin>>m;
    vii b;
    b.pb({0,0});
    FORE(i,1,m+1){
        int c,f,v;
        cin>>c>>f>>v;
        b.pb({f,v});
    }

    //contp(a);
    //contp(b);

    FORE(i,1,m+1){
        int f=b[i].fi;
        int v=b[i].se;
        FORE(j,1,n+1){
            if(a[j].fi>=f){
                //cout<<"here" sp j sp i<<endl;
                tut[j].pb({v,i});
            }
        }
    }

    vb used(m+1,false); //ürünlerden hangileri accepted

    int ans=0;

    //contp(cost);

    FOR(i,cost.size()){ //for(int i=cost.size()-1;i>=0;i--){
        int ind=cost[i].se;
        int deg=cost[i].fi;
        int mx=0;
        int ind2=-1;


        //use first not used max priced product
        for(auto el:tut[ind]){
            if(used[el.se]) continue;
            if(el.fi>deg and mx<el.fi){
                mx=el.fi;
                ind2=el.se;
            }
        }

        if(ind2!=-1 and b[ind2].se>deg){
            used[ind2]=true;
            ans+=b[ind2].se-deg;
        }

    }

    cout<<ans<<endl;
}

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