답안 #653325

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
653325	2022-10-26T14:27:58 Z	someone	Team Contest (JOI22_team)	C++14	0 / 100	1 ms	340 KB

team

#include <bits/stdc++.h>
#define int long long
using namespace std;

struct Val {
    int val, id;
};

const int N = 2e5 + 42, INF = 1e18 + 42;

int n;
bool b[N];
deque<Val> v[3];

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    cin >> n;
    for(int i = 0; i < n; i++)
        for(int j = 0; j < 3; j++) {
            int val; cin >> val;
            v[j].push_back({val, i});
        }
    for(int i = 0; i < 3; i++)
        sort(v[i].begin(), v[i].end(),
        [](Val a, Val b) {
            return a.val < b.val;
        });
    while(!v[0].empty() && !v[1].empty() && !v[2].empty()) {
        if(v[0].back().id == v[1].back().id || v[0].back().id == v[2].back().id)
            b[v[0].back().id] = true;
        if(v[1].back().id == v[2].back().id)
            b[v[1].back().id] = true;
        if(v[0].back().id != v[1].back().id && v[0].back().id != v[2].back().id && v[1].back().id != v[2].back().id)
            break;
        for(int i = 0; i < 3; i++)
            while(!v[i].empty() && b[v[i].back().id])
                v[i].pop_back();
    }
    if(v[0].empty() || v[1].empty() || v[2].empty())
        cout << -1;
    else
        cout << v[0].back().val + v[1].back().val + v[2].back().val;
}

Subtask #1

0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	328 KB	Output is correct
10	Incorrect	1 ms	212 KB	Output isn't correct
11	Halted	0 ms	0 KB	-

Subtask #2

0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	328 KB	Output is correct
10	Incorrect	1 ms	212 KB	Output isn't correct
11	Halted	0 ms	0 KB	-

Subtask #3

0 / 9.0

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

Subtask #4

0 / 9.0

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

Subtask #5

0 / 9.0

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

Subtask #6

0 / 9.0

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

Subtask #7

0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	332 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	328 KB	Output is correct
10	Incorrect	1 ms	212 KB	Output isn't correct
11	Halted	0 ms	0 KB	-