Submission #1266476

#	Time	Username	Problem	Language	Result	Execution time	Memory
1266476		Tymond	Team Contest (JOI22_team)	C++20	100 / 100	70 ms	6300 KiB

team

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

struct pair_hash{
  size_t operator()(const pair<int,int>&x)const{
    return hash<long long>()(((long long)x.first)^(((long long)x.second)<<32));
  }
};

const int MAXN = 150000 + 7;
int X[MAXN][3];
int used[MAXN];
int n;
vector<pii> vec[3];
int p[3];

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> n;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < 3; j++){
            cin >> X[i][j];
            vec[j].pb(mp(X[i][j], i));
        }
    }

    for(int j = 0; j < 3; j++){
        p[j] = n - 1;
        sort(all(vec[j]));
    }

    int ans = -1;
    while(min({p[0], p[1], p[2]}) >= 0){
        for(int j = 0; j < 3; j++){
            while(p[j] >= 0 && used[vec[j][p[j]].se]){
                p[j]--;
            }
        }
        if(min({p[0], p[1], p[2]}) < 0){
            break;
        }

        int val[3] = {vec[0][p[0]].fi, vec[1][p[1]].fi, vec[2][p[2]].fi};
        int ele = -1;
        for(int j = 0; j < 3; j++){
            int cnt = 0;
            for(int k = 0; k < 3; k++){
                if(val[k] == X[vec[j][p[j]].se][k]){
                    cnt++;
                }
            }
            if(cnt > 1){
                ele = j;
            }
        }

        if(ele != -1){
            used[vec[ele][p[ele]].se] = 1;
            p[ele]--;
        }else{
            ans = val[0] + val[1] + val[2];
            break;
        }
    }
    cout << ans << '\n';
    

    return 0;
}

• 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