제출 #921118

#제출 시각아이디문제언어결과실행 시간메모리
921118alexddTeam Contest (JOI22_team)C++17
0 / 100
164 ms24156 KiB
#include<bits/stdc++.h> using namespace std; int n; int a[3][150005]; set<pair<int,int>> s[3]; void baga(int x) { for(int i=0;i<3;i++) s[i].insert({a[i][x],x}); } void scoate(int x) { for(int i=0;i<3;i++) s[i].erase({a[i][x],x}); } int getmax(int x) { return (*prev(s[x].end())).second; } int getrez(int x) { return (*prev(s[x].end())).first; } signed main() { cin>>n; for(int i=1;i<=n;i++) { cin>>a[0][i]>>a[1][i]>>a[2][i]; baga(i); } while(!s[0].empty()) { int m[3] = {getmax(0),getmax(1),getmax(2)}; if(a[1][m[0]] == a[1][m[1]]) { scoate(m[0]); } else if(a[2][m[0]] == a[2][m[2]]) { scoate(m[0]); } else if(a[2][m[1]] == a[2][m[2]]) { scoate(m[1]); } else { cout<<getrez(0)+getrez(1)+getrez(2); return 0; } } cout<<-1; return 0; } /** */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...