답안 #933798

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
933798	2024-02-26T10:47:06 Z	velislavgarkov	Team Contest (JOI22_team)	C++14	0 / 100	64 ms	6584 KB

team

#include <iostream>
#include <algorithm>
using namespace std;
struct Player {
    long long a;
    int ind;
    bool friend operator < (Player x, Player y) {
        return x.a<y.a;
    }
};
const int MAXN=1e5+5e4+10;
long long x[MAXN], y[MAXN], z[MAXN];
int posx[MAXN], posy[MAXN], posz[MAXN];
bool used[MAXN];
bool cmpx (int i, int j) {
    return x[i]<x[j];
}
bool cmpy (int i, int j) {
    return y[i]<y[j];
}
bool cmpz (int i, int j) {
    return z[i]<z[j];
}
int main ()  {
    int n;
    cin >> n;
    for (int i=0;i<n;i++) {
        cin >> x[i] >> y[i] >> z[i];
        posx[i]=posy[i]=posz[i]=i;
    }
    sort(posx,posx+n,cmpx);
    sort(posy,posy+n,cmpy);
    sort(posz,posz+n,cmpz);
    int ix, iy, iz;
    ix=iy=iz=n-1;
    while (ix>=0 && iy>=0 && iz>=0) {
        if (used[posx[ix]]) {
            ix--;
            continue;
        }
        if (used[posy[iy]]) {
            iy--;
            continue;
        }
        if (used[posz[iz]]) {
            iz--;
            continue;
        }
        if (x[posx[ix]]==x[posy[iy]] || x[posx[ix]]==x[posz[iz]]) {
            used[posx[ix]]=true;
            ix--;
            continue;
        }
        if (y[posy[iy]]==y[posx[ix]] || y[posy[iy]]==y[posz[iz]]) {
            used[posy[iy]]=true;
            iy--;
            continue;
        }
        if (z[posz[iz]]==z[posx[ix]] || z[posz[iz]]==z[posy[iy]]) {
            used[posz[iz]]=true;
            iz--;
            continue;
        }
        cout << x[posx[ix]]+y[posy[iy]]+z[posz[iz]] << endl;
        return 0;
    }
    cout << -1 << endl;
}

Subtask #1

0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4444 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4536 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	1 ms	4544 KB	Output is correct
11	Correct	1 ms	4508 KB	Output is correct
12	Correct	1 ms	4536 KB	Output is correct
13	Correct	1 ms	4444 KB	Output is correct
14	Correct	1 ms	4444 KB	Output is correct
15	Incorrect	1 ms	4444 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #2

0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4444 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4536 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	1 ms	4544 KB	Output is correct
11	Correct	1 ms	4508 KB	Output is correct
12	Correct	1 ms	4536 KB	Output is correct
13	Correct	1 ms	4444 KB	Output is correct
14	Correct	1 ms	4444 KB	Output is correct
15	Incorrect	1 ms	4444 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #3

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4444 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4440 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4444 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	1 ms	4440 KB	Output is correct
11	Correct	64 ms	6584 KB	Output is correct
12	Incorrect	46 ms	6240 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #4

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4444 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4440 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4444 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	1 ms	4440 KB	Output is correct
11	Correct	64 ms	6584 KB	Output is correct
12	Incorrect	46 ms	6240 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4444 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4440 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4444 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	1 ms	4440 KB	Output is correct
11	Correct	64 ms	6584 KB	Output is correct
12	Incorrect	46 ms	6240 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #6

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4444 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4440 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4444 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	1 ms	4440 KB	Output is correct
11	Correct	64 ms	6584 KB	Output is correct
12	Incorrect	46 ms	6240 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #7

0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	4444 KB	Output is correct
2	Correct	1 ms	4444 KB	Output is correct
3	Correct	1 ms	4444 KB	Output is correct
4	Correct	1 ms	4444 KB	Output is correct
5	Correct	1 ms	4444 KB	Output is correct
6	Correct	1 ms	4444 KB	Output is correct
7	Correct	1 ms	4444 KB	Output is correct
8	Correct	1 ms	4536 KB	Output is correct
9	Correct	1 ms	4444 KB	Output is correct
10	Correct	1 ms	4544 KB	Output is correct
11	Correct	1 ms	4508 KB	Output is correct
12	Correct	1 ms	4536 KB	Output is correct
13	Correct	1 ms	4444 KB	Output is correct
14	Correct	1 ms	4444 KB	Output is correct
15	Incorrect	1 ms	4444 KB	Output isn't correct
16	Halted	0 ms	0 KB	-