oj.uz

Submission #796362

# Submission time Handle Problem Language Result Execution time Memory
796362 2023-07-28T10:20:36 Z vjudge1 Team Contest (JOI22_team) C++14
0 / 100
 1 ms 212 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
#define ll long long
using namespace std ;
const ll N = 2e5 ;
ll n, ans = -1, x[N + 1], y[N + 1], z[N + 1] ;
set<pair<ll, ll>> vx, vy, vz ;
signed main()
{
    ios_base::sync_with_stdio( 0 ) ;
    cin.tie( 0 ) ;
    cout.tie( 0 ) ;
    cin >> n ;
    for(ll i = 1 ; i <= n ; i++)
    {
        cin >> x[i] >> y[i] >> z[i] ;
        vx.insert({x[i], i}) ;
        vy.insert({y[i], i}) ;
        vz.insert({z[i], i}) ;
    }
    while(vx.size())
    {
        ll px = (*vx.rbegin()).se, py = (*vy.rbegin()).se, pz = (*vz.rbegin()).se ;
        if(y[px] == y[py] || z[px] == z[pz])
        {
            vx.erase({x[px], px}) ;
            vy.erase({y[px], px}) ;
            vz.erase({z[px], px}) ;
            continue ;
        }
        if(x[py] == x[py] || z[py] == z[pz])
        {
            vx.erase({x[py], py}) ;
            vy.erase({y[py], py}) ;
            vz.erase({z[py], py}) ;
            continue ;
        }
        if(x[pz] == x[px] || y[pz] == y[py])
        {
            vx.erase({x[pz], pz}) ;
            vy.erase({y[pz], pz}) ;
            vz.erase({z[pz], pz}) ;
            continue ;
        }
        ans = x[px] + y[py] + z[pz] ;
        break ;
    }
    cout << ans ;
    return 0 ;
}
//3 1 1
//2 4 2
//2 1 5
//10 10 10

Compilation message

team.cpp: In function 'int main()':
team.cpp:32:18: warning: self-comparison always evaluates to true [-Wtautological-compare]
   32 |         if(x[py] == x[py] || z[py] == z[pz])
      |            ~~~~~ ^~ ~~~~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -