oj.uz

Submission #751385

# Submission time Handle Problem Language Result Execution time Memory
751385 2023-05-31T13:21:54 Z czauderna Team Contest (JOI22_team) C++17
0 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>
using namespace std;
struct zaw{
    long long x;
    long long y;
    long long z;
    int i;
};
const int N = 15e4+3;
zaw arrX[N], arrY[N], arrZ[N];
int used[N];
bool compX(zaw fs, zaw sc){
    return fs.x < sc.x;
}
bool compY(zaw fs, zaw sc){
    return fs.y < sc.y;
}
bool compZ(zaw fs, zaw sc) {
    return fs.z < sc.z;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, x, y, z;
    bool stp=false;
    cin >> n;
    for(int i=0; i<n; i++){
        cin >> arrX[i].x >> arrX[i].y >> arrX[i].z;
        arrX[i].i=i;
        arrY[i]=arrX[i];
        arrZ[i]=arrX[i];
    }
    sort(arrX, arrX+n, compX);
    sort(arrY, arrY+n, compY);
    sort(arrZ, arrZ+n, compZ);
    x=y=z=n-1;
    while(arrX[x].i==arrY[y].i || arrY[y].i==arrZ[z].i || arrZ[z].i==arrX[x].i){
        if(arrX[x].i==arrY[y].i){
            used[arrX[x].i]++;
            x--;
            y--;
        }
        if(arrZ[z].i==arrY[y].i){
            used[arrZ[z].i]++;
            z--;
            y--;
        }
        if(arrX[x].i==arrZ[z].i){
            used[arrX[x].i]++;
            x--;
            z--;
        }
        if(x<0 || y<0 || z<0){
            stp=true;
            break;
        }

        if(used[arrX[x].i]!=0) x--;
        if(used[arrY[y].i]!=0) y--;
        if(used[arrZ[z].i]!=0) z--;    
        if(x<0 || y<0 || z<0){
            stp=true;
            break;
        }
    }
    if(stp) cout << "-1";
    else cout << arrX[x].x+arrY[y].y+arrZ[z].z;
    return 0;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Incorrect 1 ms 340 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Incorrect 1 ms 340 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Incorrect 0 ms 340 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Incorrect 0 ms 340 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Incorrect 0 ms 340 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Incorrect 0 ms 340 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Incorrect 1 ms 340 KB Output isn't correct
11 Halted 0 ms 0 KB -