제출 #587529

#제출 시각아이디문제언어결과실행 시간메모리
587529TekorTeam Contest (JOI22_team)C++17
37 / 100
2085 ms5168 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define pb push_back #define all(v) v.begin(),v.end() void boos() { ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0); } const int N = 3e5 + 100; const ll LLINF = (ll)1e18; ll a[N],b[N],c[N]; int n; bool cmp(int x,int y) { return a[x] < a[y]; } bool cmp1(int x,int y) { return b[x] < b[y]; } void solve() { cin >> n; vector <int> g,q; for(int i = 1;i <= n;i++) { cin >> a[i] >> b[i] >> c[i]; g.pb(i); q.pb(i); } sort(all(g),cmp); sort(all(q),cmp1); ll ans = -1; for(auto v : g) { ll mxa = a[v]; set <ll> tt; //cout << v << " -- " << a[v] << endl; for(int j = 0;j < q.size();j++) { int to = q[j]; ll mxb = b[to]; //cout << to << " :: " << b[to] << " == "; if(j > 0 && b[q[j - 1]] != b[to]) { int pos = j - 1; while(pos >= 0 && b[q[pos]] == b[q[j - 1]]) { int p = q[pos]; if(a[p] < mxa)tt.insert(c[p]); pos--; } } if(a[to] >= mxa || b[v] >= mxb) { //cout << "fail" << endl; continue; } if(!tt.empty()) { ll val = *(tt.rbegin()); if(val > max(c[v],c[to]))ans = max(ans,mxa + mxb + val); //cout << val << " "; } //cout << ans << endl; } //cout << ans << endl; } cout << ans; } int main() { boos(); solve(); }

컴파일 시 표준 에러 (stderr) 메시지

team.cpp: In function 'void solve()':
team.cpp:36:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |   for(int j = 0;j < q.size();j++) {
      |                 ~~^~~~~~~~~~
#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...