답안 #773079

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
773079	2023-07-04T14:47:55 Z	marvinthang	Council (JOI23_council)	C++17	22 / 100	661 ms	185112 KB

council

/*************************************
*    author: marvinthang             *
*    created: 04.07.2023 20:59:38    *
*************************************/

#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_N = 3e5 + 5;
const int MAX_M = 20;

int N, M, A[MAX_N], cnt[MAX_M];

void init(void) {
	cin >> N >> M;
	REP(i, N) {
		REP(j, M) {
			int v; cin >> v;
			if (v) {
				A[i] ^= MASK(j);
				++cnt[j];
			}
		}
	}
}

pair <int, int> max_bit[MASK(MAX_M)];
long long cnt_mask[MASK(MAX_M)][MAX_M + 1];
int num_bit[MASK(MAX_M)];

void process(void) {
	int mask_zero = 0, mask_one = 0, cnt_two = 0;
	REP(i, M) {
		if (cnt[i] >= N / 2 + 2) ++cnt_two;
		else if (cnt[i] == N / 2 + 1) mask_one ^= MASK(i);
		else if (cnt[i] == N / 2) mask_zero ^= MASK(i);
	}

	REP(i, MASK(M)) num_bit[i] = __builtin_popcount(i);

	REP(i, N) {
		int v = (MASK(M) - 1) ^ A[i];
		++cnt_mask[v][num_bit[v]];
	}
	REP(i, M) REP(mask, MASK(M)) if (BIT(mask, i)) 
		cnt_mask[mask ^ MASK(i)][num_bit[mask] - 1] += cnt_mask[mask][num_bit[mask]];
	REP(i, M) REP(mask, MASK(M)) if (BIT(mask, i)) 
		REP(j, M + 1) cnt_mask[mask][j] += cnt_mask[mask ^ MASK(i)][j];
	REP(mask, MASK(M)) {
		REP(i, M) cnt_mask[mask][i] -= (i + 1) * cnt_mask[mask][i + 1];
		REP(i, M + 1) if (cnt_mask[mask][i]) {
			if (cnt_mask[mask][i] == 1) {
				max_bit[mask].se = max_bit[mask].fi;
				max_bit[mask].fi = i;
			} else max_bit[mask].fi = max_bit[mask].se = i;
		}
	}

	REP(i, N) {
		int rem_zero = (mask_zero & ((MASK(M) - 1) ^ A[i])) ^ (mask_one & A[i]);
		int res = cnt_two + num_bit[mask_one & ((MASK(M) - 1) ^ A[i])];
		res += max_bit[rem_zero].fi == num_bit[rem_zero & ((MASK(M) - 1) ^ A[i])] ? max_bit[rem_zero].se : max_bit[rem_zero].fi;
		cout << res << '\n';
	}
}

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

Compilation message

council.cpp: In function 'int main()':
council.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); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
council.cpp:107:2: note: in expansion of macro 'file'
  107 |  file("council");
      |  ^~~~
council.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); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
council.cpp:107:2: note: in expansion of macro 'file'
  107 |  file("council");
      |  ^~~~

Subtask #1
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	980 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	623 ms	184976 KB	Output is correct
6	Correct	620 ms	184960 KB	Output is correct
7	Correct	647 ms	184876 KB	Output is correct
8	Correct	623 ms	184984 KB	Output is correct
9	Correct	637 ms	185032 KB	Output is correct
10	Correct	642 ms	184976 KB	Output is correct
11	Correct	643 ms	184980 KB	Output is correct
12	Correct	629 ms	184988 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	1 ms	324 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	1 ms	340 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	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	404 KB	Output is correct
30	Correct	1 ms	468 KB	Output is correct
31	Correct	1 ms	468 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct
34	Correct	0 ms	340 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	1 ms	324 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	1 ms	340 KB	Output is correct
39	Correct	1 ms	468 KB	Output is correct
40	Correct	1 ms	464 KB	Output is correct
41	Correct	4 ms	3156 KB	Output is correct
42	Correct	4 ms	3156 KB	Output is correct
43	Correct	4 ms	3156 KB	Output is correct
44	Correct	4 ms	3156 KB	Output is correct
45	Correct	4 ms	3156 KB	Output is correct
46	Correct	65 ms	23416 KB	Output is correct
47	Correct	66 ms	23404 KB	Output is correct
48	Correct	78 ms	23408 KB	Output is correct
49	Correct	68 ms	23412 KB	Output is correct
50	Correct	64 ms	23356 KB	Output is correct

Subtask #2
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	980 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	623 ms	184976 KB	Output is correct
6	Correct	620 ms	184960 KB	Output is correct
7	Correct	647 ms	184876 KB	Output is correct
8	Correct	623 ms	184984 KB	Output is correct
9	Correct	637 ms	185032 KB	Output is correct
10	Correct	642 ms	184976 KB	Output is correct
11	Correct	643 ms	184980 KB	Output is correct
12	Correct	629 ms	184988 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	1 ms	324 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	1 ms	340 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	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	404 KB	Output is correct
30	Correct	1 ms	468 KB	Output is correct
31	Correct	1 ms	468 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct
34	Correct	0 ms	340 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	1 ms	324 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	1 ms	340 KB	Output is correct
39	Correct	1 ms	468 KB	Output is correct
40	Correct	1 ms	464 KB	Output is correct
41	Correct	4 ms	3156 KB	Output is correct
42	Correct	4 ms	3156 KB	Output is correct
43	Correct	4 ms	3156 KB	Output is correct
44	Correct	4 ms	3156 KB	Output is correct
45	Correct	4 ms	3156 KB	Output is correct
46	Correct	65 ms	23416 KB	Output is correct
47	Correct	66 ms	23404 KB	Output is correct
48	Correct	78 ms	23408 KB	Output is correct
49	Correct	68 ms	23412 KB	Output is correct
50	Correct	64 ms	23356 KB	Output is correct
51	Correct	612 ms	185112 KB	Output is correct
52	Correct	633 ms	185052 KB	Output is correct
53	Correct	661 ms	185104 KB	Output is correct
54	Correct	623 ms	185068 KB	Output is correct
55	Correct	1 ms	340 KB	Output is correct
56	Correct	77 ms	23524 KB	Output is correct

Subtask #3
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	45 ms	3156 KB	Output is correct
3	Correct	37 ms	1996 KB	Output is correct
4	Correct	28 ms	2644 KB	Output is correct
5	Correct	41 ms	3224 KB	Output is correct
6	Correct	32 ms	2608 KB	Output is correct
7	Correct	46 ms	3144 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	328 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	328 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct

Subtask #4
0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	45 ms	3156 KB	Output is correct
3	Correct	37 ms	1996 KB	Output is correct
4	Correct	28 ms	2644 KB	Output is correct
5	Correct	41 ms	3224 KB	Output is correct
6	Correct	32 ms	2608 KB	Output is correct
7	Correct	46 ms	3144 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	328 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	328 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Incorrect	161 ms	5748 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #5
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	45 ms	3156 KB	Output is correct
3	Correct	37 ms	1996 KB	Output is correct
4	Correct	28 ms	2644 KB	Output is correct
5	Correct	41 ms	3224 KB	Output is correct
6	Correct	32 ms	2608 KB	Output is correct
7	Correct	46 ms	3144 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	328 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	328 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Incorrect	161 ms	5748 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #6
0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	45 ms	3156 KB	Output is correct
3	Correct	37 ms	1996 KB	Output is correct
4	Correct	28 ms	2644 KB	Output is correct
5	Correct	41 ms	3224 KB	Output is correct
6	Correct	32 ms	2608 KB	Output is correct
7	Correct	46 ms	3144 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	328 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	328 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Incorrect	161 ms	5748 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #7
0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	980 KB	Output is correct
3	Correct	0 ms	332 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	623 ms	184976 KB	Output is correct
6	Correct	620 ms	184960 KB	Output is correct
7	Correct	647 ms	184876 KB	Output is correct
8	Correct	623 ms	184984 KB	Output is correct
9	Correct	637 ms	185032 KB	Output is correct
10	Correct	642 ms	184976 KB	Output is correct
11	Correct	643 ms	184980 KB	Output is correct
12	Correct	629 ms	184988 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	0 ms	340 KB	Output is correct
16	Correct	1 ms	324 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	0 ms	340 KB	Output is correct
19	Correct	1 ms	340 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	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	404 KB	Output is correct
30	Correct	1 ms	468 KB	Output is correct
31	Correct	1 ms	468 KB	Output is correct
32	Correct	1 ms	340 KB	Output is correct
33	Correct	1 ms	332 KB	Output is correct
34	Correct	0 ms	340 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	1 ms	324 KB	Output is correct
37	Correct	1 ms	340 KB	Output is correct
38	Correct	1 ms	340 KB	Output is correct
39	Correct	1 ms	468 KB	Output is correct
40	Correct	1 ms	464 KB	Output is correct
41	Correct	4 ms	3156 KB	Output is correct
42	Correct	4 ms	3156 KB	Output is correct
43	Correct	4 ms	3156 KB	Output is correct
44	Correct	4 ms	3156 KB	Output is correct
45	Correct	4 ms	3156 KB	Output is correct
46	Correct	65 ms	23416 KB	Output is correct
47	Correct	66 ms	23404 KB	Output is correct
48	Correct	78 ms	23408 KB	Output is correct
49	Correct	68 ms	23412 KB	Output is correct
50	Correct	64 ms	23356 KB	Output is correct
51	Correct	612 ms	185112 KB	Output is correct
52	Correct	633 ms	185052 KB	Output is correct
53	Correct	661 ms	185104 KB	Output is correct
54	Correct	623 ms	185068 KB	Output is correct
55	Correct	1 ms	340 KB	Output is correct
56	Correct	77 ms	23524 KB	Output is correct
57	Correct	1 ms	340 KB	Output is correct
58	Correct	45 ms	3156 KB	Output is correct
59	Correct	37 ms	1996 KB	Output is correct
60	Correct	28 ms	2644 KB	Output is correct
61	Correct	41 ms	3224 KB	Output is correct
62	Correct	32 ms	2608 KB	Output is correct
63	Correct	46 ms	3144 KB	Output is correct
64	Correct	1 ms	340 KB	Output is correct
65	Correct	0 ms	340 KB	Output is correct
66	Correct	0 ms	340 KB	Output is correct
67	Correct	1 ms	340 KB	Output is correct
68	Correct	1 ms	328 KB	Output is correct
69	Correct	1 ms	340 KB	Output is correct
70	Correct	1 ms	340 KB	Output is correct
71	Correct	1 ms	328 KB	Output is correct
72	Correct	0 ms	340 KB	Output is correct
73	Correct	1 ms	340 KB	Output is correct
74	Correct	0 ms	340 KB	Output is correct
75	Correct	1 ms	340 KB	Output is correct
76	Incorrect	161 ms	5748 KB	Output isn't correct
77	Halted	0 ms	0 KB	-

답안 #773079

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 8.0 / 8.0

Subtask #3 6.0 / 6.0

Subtask #4 0 / 19.0

Subtask #5 0 / 15.0

Subtask #6 0 / 22.0

Subtask #7 0 / 22.0

Subtask #1
8.0 / 8.0

Subtask #2
8.0 / 8.0

Subtask #3
6.0 / 6.0

Subtask #4
0 / 19.0

Subtask #5
0 / 15.0

Subtask #6
0 / 22.0

Subtask #7
0 / 22.0