oj.uz

Submission #591877

# Submission time Handle Problem Language Result Execution time Memory
591877 2022-07-08T05:36:08 Z Cross_Ratio Team Contest (JOI22_team) C++14
0 / 100
 1 ms 212 KB 
#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

team.cpp: In function 'int main()':
team.cpp:27:9: warning: unused variable 'y' [-Wunused-variable]
   27 |     int y = Q[1].top().second;
      |         ^
team.cpp:29:9: warning: unused variable 'z' [-Wunused-variable]
   29 |     int z = Q[2].top().second;
      |         ^

Subtask #1
0 / 8.0

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

Subtask #2
0 / 29.0

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

Subtask #3
0 / 9.0

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

Subtask #4
0 / 9.0

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

Subtask #5
0 / 9.0

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

Subtask #6
0 / 9.0

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

Subtask #7
0 / 27.0

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