Submission #2677647

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))

ll solve(int N,int M,vector<ll>& x,vector<ll>& y,vector<ll>& z) {
    ll best = 0;
    for(int pm1=-1;pm1<=1;pm1+=2)
    for(int pm2=-1;pm2<=1;pm2+=2)
    for(int pm3=-1;pm3<=1;pm3+=2){
        vector<ll> s(N);
        rep(i,N){
            s[i] = x[i]*pm1 + y[i]*pm2 + z[i]*pm3;
        }
        sort(ALL(s)); reverse(ALL(s));
        // cerr<<s<<endl;
        ll score = 0;
        rep(i,M) score += s[i];
        // ll score = accumulate(s.begin(), s.begin()+M, 0);
        best = max(best, score);
    }
    return best;
}

int main() {
    int N,M; cin>>N>>M;
    vector<ll> x(N), y(N), z(N);
    rep(i,N){
        cin>>x[i] >>y[i]>>z[i];
    }
    cout << solve(N,M,x,y,z) << endl;
    return 0;
}

Submission Info

Judge Result