This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}
// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
public:
template<typename T>
_Debug& operator,(T val) {
cout << val << endl;
return *this;
}
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif
// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back
// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;
// ---------- END OF TEMPLATE ----------
int a[150000][3];
vpii v[3];
int del[150000],num[150000];
multiset<int> S[3];
queue<int> Q;
int main() {
int i;
int N;
scanf("%d",&N);
for (i = 0; i < N; i++) scanf("%d %d %d",&a[i][0],&a[i][1],&a[i][2]);
int j;
for (i = 0; i < N; i++) {
for (j = 0; j < 3; j++) v[j].pb(mp(a[i][j],i)),S[j].insert(a[i][j]);
}
int p[3];
p[0] = p[1] = p[2] = N-1;
for (i = 0; i < 3; i++) S[i].insert(-1),sort(v[i].begin(),v[i].end());
for (i = 0; i < 3; i++) {
while ((p[i] >= 0) && (v[i][p[i]].first >= *S[i].rbegin())) {
num[v[i][p[i]].second]++;
if (num[v[i][p[i]].second] >= 2) Q.push(v[i][p[i]].second);
p[i]--;
}
}
while (!Q.empty()) {
int u = Q.front();
Q.pop();
if (!del[u]) {
del[u] = 1;
for (i = 0; i < 3; i++) S[i].erase(S[i].find(a[u][i]));
for (i = 0; i < 3; i++) {
while ((p[i] >= 0) && (v[i][p[i]].first >= *S[i].rbegin())) {
num[v[i][p[i]].second]++;
if (num[v[i][p[i]].second] >= 2) Q.push(v[i][p[i]].second);
p[i]--;
}
}
}
}
if (S[0].size() == 1) printf("-1\n");
else printf("%d\n",*S[0].rbegin()+*S[1].rbegin()+*S[2].rbegin());
return 0;
}
Compilation message (stderr)
team.cpp: In function 'int main()':
team.cpp:66:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
66 | scanf("%d",&N);
| ~~~~~^~~~~~~~~
team.cpp:67:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
67 | for (i = 0; i < N; i++) scanf("%d %d %d",&a[i][0],&a[i][1],&a[i][2]);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |