Submission #709860

#	Time	Username	Problem	Language	Result	Execution time	Memory
709860		urosk	Team Contest (JOI22_team)	C++14	100 / 100	559 ms	74860 KiB

team

#define here cerr<<"===========================================\n"
#define dbg(x) cerr<<#x<<": "<<x<<endl;
#include "bits/stdc++.h"
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
#define ld double
#define ll long long
#define llinf 100000000000000000LL // 10^17
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define all(a) a.begin(),a.end()
#define ceri(a,l,r) {cerr<<#a<<": ";for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
#define cer(a) {cerr<<#a<<": ";for(ll x_ : a) cerr<<x_<< " ";cerr<<endl;}

#define daj_mi_malo_vremena ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);

using namespace std;
//using namespace __gnu_pbds;
/*
ll add(ll x,ll y){
    x+=y;
    if(x<0){
        x%=mod;
        x+=mod;
    }else{
        if(x>=mod) x%=mod;
    }
    return x;
}
ll mul(ll a,ll b){
	ll ans = (a*b)%mod;
	if(ans<0) ans+=mod;
	return ans;
}
typedef tree<int,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<int,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_multiset;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rnd(ll l,ll r){
    return uniform_int_distribution<ll>(l,r)(rng);
}
*/
#define maxn 1500005
ll n;
vector<ll> a[maxn];
set<pll> s[4];
bool bad[maxn];
void tc(){
    cin >> n;
    for(ll i = 1;i<=n;i++){
        a[i].resize(4);
        for(ll j = 1;j<=3;j++){
            cin >> a[i][j];
            s[j].insert({a[i][j],i});
        }
    }
    while(s[1].size()&&s[2].size()&&s[3].size()){
        bool moe = 1;
        for(ll i = 1;i<=3;i++){
            ll k = prev(s[i].end())->sc;
            ll val = prev(s[i].end())->fi;
            for(ll j = 1;j<=3;j++){
                if(i==j) continue;
                if(a[k][j]>=prev(s[j].end())->fi){
                    moe = 0;
                    bad[k] = 1;
                }
            }
        }
        if(moe){
            ll ans = 0;
            for(ll i = 1;i<=3;i++) ans+=prev(s[i].end())->fi;
            cout<<ans<<endl;
            return;
        }
        for(ll i = 1;i<=3;i++){
            ll k = prev(s[i].end())->sc;
            if(bad[k]) s[i].erase(prev(s[i].end()));
        }
    }
    cout<<-1<<endl;
}
int main(){
	daj_mi_malo_vremena
    int t; t = 1;
    while(t--){
        tc();
    }
	return 0;
}

Compilation message (stderr)

team.cpp: In function 'void tc()':
team.cpp:65:16: warning: unused variable 'val' [-Wunused-variable]
   65 |             ll val = prev(s[i].end())->fi;
      |                ^~~

• Subtask 1: 8 / 8
• Subtask 2: 29 / 29
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 9 / 9
• Subtask 6: 9 / 9
• Subtask 7: 27 / 27