Submission #635825

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
635825	2022-08-27T05:48:11 Z	Mahdi	Team Contest (JOI22_team)	C++17	0 / 100	123 ms	7192 KB

team

#include<bits/stdc++.h>
#pragma GCC optimize ("Ofast")
using namespace std;
#define all(v) v.begin(), v.end()
#define F first
#define S second
typedef long long ll;
typedef pair<int, int> pii;
const int N=15e4+5;
int n, x[N], y[N], z[N];
bool mk[N];

int main(){
    cin>>n;
    for(int i=0;i<n;++i)
        cin>>x[i]>>y[i]>>z[i];
    priority_queue<pii>a, b, c;
    for(int i=0;i<n;++i){
        a.push({x[i], i});
        b.push({y[i], i});
        c.push({z[i], i});
    }
    memset(mk, 1, sizeof(mk));
    while(!a.empty()){
        while(!a.empty() && !mk[a.top().S])
            a.pop();
        while(!b.empty() && !mk[b.top().S])
            b.pop();
        while(!c.empty() && !mk[c.top().S])
            c.pop();
        int i=a.top().S, j=b.top().S, k=c.top().S;
        if(y[i]==y[j] || z[i]==z[k]){
            mk[i]=0;
            a.pop();
            continue;
        }
        if(x[j]==x[i] || z[j]==z[k]){
            mk[j]=0;
            b.pop();
            continue;
        }
        if(x[k]==x[i] || y[k]==y[j]){
            mk[k]=0;
            c.pop();
            continue;
        }
        cout<<x[i]+y[j]+z[k]<<'\n';
        return 0;
    }
    cout<<-1<<'\n';
}

Subtask #1

0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	468 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	468 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	468 KB	Output is correct
14	Correct	1 ms	468 KB	Output is correct
15	Correct	1 ms	444 KB	Output is correct
16	Correct	1 ms	436 KB	Output is correct
17	Incorrect	1 ms	468 KB	Output isn't correct
18	Halted	0 ms	0 KB	-

Subtask #2

0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	468 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	468 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	468 KB	Output is correct
14	Correct	1 ms	468 KB	Output is correct
15	Correct	1 ms	444 KB	Output is correct
16	Correct	1 ms	436 KB	Output is correct
17	Incorrect	1 ms	468 KB	Output isn't correct
18	Halted	0 ms	0 KB	-

Subtask #3

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	468 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	468 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	440 KB	Output is correct
9	Correct	1 ms	432 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	75 ms	7096 KB	Output is correct
12	Correct	67 ms	4636 KB	Output is correct
13	Correct	60 ms	5584 KB	Output is correct
14	Incorrect	123 ms	7192 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #4

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	468 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	468 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	440 KB	Output is correct
9	Correct	1 ms	432 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	75 ms	7096 KB	Output is correct
12	Correct	67 ms	4636 KB	Output is correct
13	Correct	60 ms	5584 KB	Output is correct
14	Incorrect	123 ms	7192 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	468 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	468 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	440 KB	Output is correct
9	Correct	1 ms	432 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	75 ms	7096 KB	Output is correct
12	Correct	67 ms	4636 KB	Output is correct
13	Correct	60 ms	5584 KB	Output is correct
14	Incorrect	123 ms	7192 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #6

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	468 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	468 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	440 KB	Output is correct
9	Correct	1 ms	432 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	75 ms	7096 KB	Output is correct
12	Correct	67 ms	4636 KB	Output is correct
13	Correct	60 ms	5584 KB	Output is correct
14	Incorrect	123 ms	7192 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #7

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	468 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	468 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	468 KB	Output is correct
14	Correct	1 ms	468 KB	Output is correct
15	Correct	1 ms	444 KB	Output is correct
16	Correct	1 ms	436 KB	Output is correct
17	Incorrect	1 ms	468 KB	Output isn't correct
18	Halted	0 ms	0 KB	-