# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
591877 | Cross_Ratio | Team Contest (JOI22_team) | C++14 | 1 ms | 212 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef tuple<int,int,int> T;
typedef pair<int,int> P;
int A[150005][3];
signed main() {
cin.sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int N;
cin >> N;
int i, j;
for(i=0;i<N;i++) {
for(j=0;j<3;j++) cin >> A[i][j];
}
priority_queue<P> Q[3];
for(i=0;i<N;i++) {
for(j=0;j<3;j++) Q[j].push(P(A[i][j],i));
}
int x[3];
for(i=0;i<3;i++) {
x[i] = Q[i].top().second;
Q[i].pop();
}
Q[0].pop();
int y = Q[1].top().second;
Q[1].pop();
int z = Q[2].top().second;
Q[2].pop();
while(!Q[0].empty()||!Q[1].empty()||!Q[2].empty()) {
bool isChange = false;
for(i=0;i<3;i++) {
bool isWrong = false;
for(j=0;j<3;j++) {
if(i==j) continue;
if(A[x[i]][j]>=A[x[j]][j]) isWrong = true;
}
if(isWrong) {
if(!Q[i].empty()) {
x[i] = Q[i].top().second;
Q[i].pop();
break;
}
isChange = true;
}
}
if(!isChange) {
int ans = 0;
for(i=0;i<3;i++) ans += A[x[i]][i];
cout << ans;
return 0;
}
}
cout << -1;
}
Compilation message (stderr)
# | 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... |