| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 567787 | dantoh000 | Team Contest (JOI22_team) | C++14 | 501 ms | 23712 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>
using namespace std;
typedef pair<int,int> ii;
int n;
int a[150005], b[150005], c[150005];
set<ii> A,B,C;
int main(){
scanf("%d",&n);
for (int i = 0; i < n; i++){
scanf("%d%d%d",&a[i],&b[i],&c[i]);
A.insert({a[i], i});
B.insert({b[i], i});
C.insert({c[i], i});
}
for (int i = 0; i < n; i++){
int aid = A.rbegin()->second;
int bid = B.rbegin()->second;
int cid = C.rbegin()->second;
int mxa = a[aid], mxb = b[bid], mxc = c[cid];
if (b[aid] == mxb || c[aid] == mxc){
A.erase({a[aid], aid});
B.erase({b[aid], aid});
C.erase({c[aid], aid});
}
else if (a[bid] == mxa || c[bid] == mxc){
A.erase({a[bid], bid});
B.erase({b[bid], bid});
C.erase({c[bid], bid});
}
else if (a[cid] == mxa || b[cid] == mxb){
A.erase({a[cid], cid});
B.erase({b[cid], cid});
C.erase({c[cid], cid});
}
else{
printf("%d",mxa+mxb+mxc);
return 0;
}
}
printf("-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... | ||||
