oj.uz

답안 #776302

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
776302 2023-07-07T15:40:41 Z marvinthang Team Contest (JOI22_team) C++17
100 / 100
 867 ms 80260 KB 
/*************************************
*    author: marvinthang             *
*    created: 07.07.2023 22:15:45    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }

// end of template

const int MAX = 1.5e5 + 5;

int N, A[MAX][3];
map <pair <int, int>, vector <int>> mp[3];
multiset <int> s[3];

void init(void) {
	cin >> N;
	REP(i, N) {
		REP(j, 3) cin >> A[i][j];
		REP(j, 3) {
			s[j].insert(A[i][j]);
			mp[j][make_pair(A[i][j], A[i][(j + 1) % 3])].push_back(i);
		}
	}
}

void process(void) {
	while (!s[0].empty()) {
		int a[3];
		REP(i, 3) a[i] = *s[i].rbegin();
		bool ok = true;
		REP(i, 3) for (int v: mp[i][make_pair(a[i], a[(i + 1) % 3])]) {
			if (A[v][0] == -1) continue;
			ok = false;
			REP(i, 3) s[i].erase(s[i].find(A[v][i]));
			A[v][0] = -1;
		}
		if (ok) return void(cout << a[0] + a[1] + a[2] << '\n');
	}
	cout << "-1\n";
}

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
	file("team");
	init();
	process();
	cerr << "Time elapsed: " << TIME << " s.\n";
	return (0^0);
}

Compilation message

team.cpp: In function 'int main()':
team.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
team.cpp:82:2: note: in expansion of macro 'file'
   82 |  file("team");
      |  ^~~~
team.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
team.cpp:82:2: note: in expansion of macro 'file'
   82 |  file("team");
      |  ^~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct

Subtask #2
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 6 ms 2324 KB Output is correct
27 Correct 7 ms 2260 KB Output is correct
28 Correct 7 ms 2388 KB Output is correct
29 Correct 8 ms 2396 KB Output is correct
30 Correct 8 ms 1748 KB Output is correct
31 Correct 6 ms 2252 KB Output is correct
32 Correct 7 ms 1836 KB Output is correct
33 Correct 6 ms 1624 KB Output is correct
34 Correct 7 ms 2260 KB Output is correct
35 Correct 1 ms 596 KB Output is correct
36 Correct 1 ms 596 KB Output is correct
37 Correct 4 ms 1748 KB Output is correct
38 Correct 7 ms 1876 KB Output is correct
39 Correct 2 ms 732 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 340 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 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 165 ms 26192 KB Output is correct
12 Correct 106 ms 17476 KB Output is correct
13 Correct 106 ms 21460 KB Output is correct
14 Correct 179 ms 26092 KB Output is correct
15 Correct 145 ms 25984 KB Output is correct
16 Correct 117 ms 25876 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 340 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 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 165 ms 26192 KB Output is correct
12 Correct 106 ms 17476 KB Output is correct
13 Correct 106 ms 21460 KB Output is correct
14 Correct 179 ms 26092 KB Output is correct
15 Correct 145 ms 25984 KB Output is correct
16 Correct 117 ms 25876 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 724 KB Output is correct
22 Correct 190 ms 26924 KB Output is correct
23 Correct 200 ms 25748 KB Output is correct
24 Correct 152 ms 19472 KB Output is correct
25 Correct 208 ms 26828 KB Output is correct
26 Correct 160 ms 26096 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 340 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 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 165 ms 26192 KB Output is correct
12 Correct 106 ms 17476 KB Output is correct
13 Correct 106 ms 21460 KB Output is correct
14 Correct 179 ms 26092 KB Output is correct
15 Correct 145 ms 25984 KB Output is correct
16 Correct 117 ms 25876 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 724 KB Output is correct
22 Correct 190 ms 26924 KB Output is correct
23 Correct 200 ms 25748 KB Output is correct
24 Correct 152 ms 19472 KB Output is correct
25 Correct 208 ms 26828 KB Output is correct
26 Correct 160 ms 26096 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 7 ms 1876 KB Output is correct
32 Correct 1 ms 596 KB Output is correct
33 Correct 1 ms 600 KB Output is correct
34 Correct 565 ms 47180 KB Output is correct
35 Correct 520 ms 40204 KB Output is correct
36 Correct 606 ms 40876 KB Output is correct
37 Correct 525 ms 39888 KB Output is correct
38 Correct 185 ms 26624 KB Output is correct
39 Correct 134 ms 26188 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 340 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 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 165 ms 26192 KB Output is correct
12 Correct 106 ms 17476 KB Output is correct
13 Correct 106 ms 21460 KB Output is correct
14 Correct 179 ms 26092 KB Output is correct
15 Correct 145 ms 25984 KB Output is correct
16 Correct 117 ms 25876 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 724 KB Output is correct
22 Correct 190 ms 26924 KB Output is correct
23 Correct 200 ms 25748 KB Output is correct
24 Correct 152 ms 19472 KB Output is correct
25 Correct 208 ms 26828 KB Output is correct
26 Correct 160 ms 26096 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 7 ms 1876 KB Output is correct
32 Correct 1 ms 596 KB Output is correct
33 Correct 1 ms 600 KB Output is correct
34 Correct 565 ms 47180 KB Output is correct
35 Correct 520 ms 40204 KB Output is correct
36 Correct 606 ms 40876 KB Output is correct
37 Correct 525 ms 39888 KB Output is correct
38 Correct 185 ms 26624 KB Output is correct
39 Correct 134 ms 26188 KB Output is correct
40 Correct 5 ms 1748 KB Output is correct
41 Correct 6 ms 2264 KB Output is correct
42 Correct 5 ms 1876 KB Output is correct
43 Correct 5 ms 1876 KB Output is correct
44 Correct 820 ms 74340 KB Output is correct
45 Correct 812 ms 61108 KB Output is correct
46 Correct 867 ms 65296 KB Output is correct
47 Correct 821 ms 59932 KB Output is correct
48 Correct 235 ms 28828 KB Output is correct

Subtask #7
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 460 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 6 ms 2324 KB Output is correct
27 Correct 7 ms 2260 KB Output is correct
28 Correct 7 ms 2388 KB Output is correct
29 Correct 8 ms 2396 KB Output is correct
30 Correct 8 ms 1748 KB Output is correct
31 Correct 6 ms 2252 KB Output is correct
32 Correct 7 ms 1836 KB Output is correct
33 Correct 6 ms 1624 KB Output is correct
34 Correct 7 ms 2260 KB Output is correct
35 Correct 1 ms 596 KB Output is correct
36 Correct 1 ms 596 KB Output is correct
37 Correct 4 ms 1748 KB Output is correct
38 Correct 7 ms 1876 KB Output is correct
39 Correct 2 ms 732 KB Output is correct
40 Correct 1 ms 328 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 0 ms 340 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 165 ms 26192 KB Output is correct
51 Correct 106 ms 17476 KB Output is correct
52 Correct 106 ms 21460 KB Output is correct
53 Correct 179 ms 26092 KB Output is correct
54 Correct 145 ms 25984 KB Output is correct
55 Correct 117 ms 25876 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 2 ms 724 KB Output is correct
61 Correct 190 ms 26924 KB Output is correct
62 Correct 200 ms 25748 KB Output is correct
63 Correct 152 ms 19472 KB Output is correct
64 Correct 208 ms 26828 KB Output is correct
65 Correct 160 ms 26096 KB Output is correct
66 Correct 1 ms 460 KB Output is correct
67 Correct 1 ms 468 KB Output is correct
68 Correct 1 ms 332 KB Output is correct
69 Correct 1 ms 340 KB Output is correct
70 Correct 7 ms 1876 KB Output is correct
71 Correct 1 ms 596 KB Output is correct
72 Correct 1 ms 600 KB Output is correct
73 Correct 565 ms 47180 KB Output is correct
74 Correct 520 ms 40204 KB Output is correct
75 Correct 606 ms 40876 KB Output is correct
76 Correct 525 ms 39888 KB Output is correct
77 Correct 185 ms 26624 KB Output is correct
78 Correct 134 ms 26188 KB Output is correct
79 Correct 5 ms 1748 KB Output is correct
80 Correct 6 ms 2264 KB Output is correct
81 Correct 5 ms 1876 KB Output is correct
82 Correct 5 ms 1876 KB Output is correct
83 Correct 820 ms 74340 KB Output is correct
84 Correct 812 ms 61108 KB Output is correct
85 Correct 867 ms 65296 KB Output is correct
86 Correct 821 ms 59932 KB Output is correct
87 Correct 235 ms 28828 KB Output is correct
88 Correct 554 ms 76376 KB Output is correct
89 Correct 722 ms 78780 KB Output is correct
90 Correct 630 ms 76792 KB Output is correct
91 Correct 763 ms 80076 KB Output is correct
92 Correct 757 ms 74504 KB Output is correct
93 Correct 810 ms 80260 KB Output is correct
94 Correct 818 ms 72832 KB Output is correct
95 Correct 367 ms 52308 KB Output is correct
96 Correct 390 ms 76420 KB Output is correct
97 Correct 131 ms 28924 KB Output is correct
98 Correct 246 ms 58580 KB Output is correct
99 Correct 263 ms 58712 KB Output is correct