Submission #773111

#	Time	Username	Problem	Language	Result	Execution time	Memory
773111		marvinthang	Council (JOI23_council)	C++17	100 / 100	964 ms	198772 KiB

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] - (j < M ? cnt_mask[mask][j + 1] : 0);

	REP(mask, MASK(M)) {
		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 (stderr)

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:109:2: note: in expansion of macro 'file'
  109 |  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:109:2: note: in expansion of macro 'file'
  109 |  file("council");
      |  ^~~~

• Subtask 1: 8 / 8
• Subtask 2: 8 / 8
• Subtask 3: 6 / 6
• Subtask 4: 19 / 19
• Subtask 5: 15 / 15
• Subtask 6: 22 / 22
• Subtask 7: 22 / 22