Submission #1334706

#	Time	Username	Problem	Language	Result	Execution time	Memory
1334706		gohchingjayk	Council (JOI23_council)	C++20	Compilation error	0 ms	0 KiB

council

#pragma GCC optimize("O3,inline")
#include <bits/stdc++.h>
 
using namespace std;
 
using ll = long long;

using ii = pair<int, int>;
using iii = pair<int, ii>;
using pvii = pair<vector<int>, ii>;
 
constexpr int MAXN = 300000 + 5;
constexpr int INF = 1e18 + 5;
constexpr int LOG = 20;

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

	int N, M; cin >> N >> M;
	vector<int> mask(N);
	vector<int> counts(M);
	
	for (int i = 0; i < N; ++i) {
		for (int j = 0; j < M; ++j) {
			int x; cin >> x;
			counts[j] += x;
			mask[i] |= x << j;
		}
	}
	
	vector<int> mask_cnt(1 << M);
	for (int i = 0; i < N; ++i) mask_cnt[mask[i]]++;
	for (int i = 0; i < N; ++i) mask_cnt[mask[i]] = min(mask_cnt[mask[i]], 2ll);
	
	vector<int> augmented;
	for (int i = 0; i < (1 << M); ++i) {
		for (int j = 0; j < mask_cnt[i]; ++j) {
			augmented.emplace_back(i);
		}
	}
	
	vector<int> mask_ans(1 << M);
	for (int i = 0; i < augmented.size(); ++i) {
		
		int antimask = 0;
		for (int m = 0; m < M; ++m) {
			if (counts[m] - ((augmented[i] >> m) & 1) == N / 2) antimask |= 1 << m;
		}
		
		int best_idx = !i;
		for (int j = 0; j < augmented.size(); ++j) {
			if (i == j) continue;
			
			if (__builtin_popcount(~augmented[j] & antimask) > __builtin_popcount(~augmented[best_idx] & antimask)) {
				best_idx = j;
			}
		}
		
		int ans = 0;
		for (int m = 0; m < M; ++m) {
			if (counts[m] - ((augmented[i] >> m) & 1) - ((augmented[best_idx] >> m) & 1) >= N / 2) ans++;
		}
		
		mask_ans[augmented[i]] = ans;
	}
	
	for (int i = 0; i < N; ++i) {
		cout << mask_ans[mask[i]] << '\n';
	}
}

Compilation message (stderr)

council.cpp:13:26: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   13 | constexpr int INF = 1e18 + 5;
      |                     ~~~~~^~~
council.cpp:13:28: error: overflow in constant expression [-fpermissive]
   13 | constexpr int INF = 1e18 + 5;
      |                            ^
council.cpp:13:28: error: overflow in constant expression [-fpermissive]
council.cpp: In function 'int main()':
council.cpp:33:60: error: no matching function for call to 'min(__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type&, long long int)'
   33 |         for (int i = 0; i < N; ++i) mask_cnt[mask[i]] = min(mask_cnt[mask[i]], 2ll);
      |                                                         ~~~^~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:51,
                 from council.cpp:2:
/usr/include/c++/13/bits/stl_algobase.h:233:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::min(const _Tp&, const _Tp&)'
  233 |     min(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/13/bits/stl_algobase.h:233:5: note:   template argument deduction/substitution failed:
council.cpp:33:60: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'long long int')
   33 |         for (int i = 0; i < N; ++i) mask_cnt[mask[i]] = min(mask_cnt[mask[i]], 2ll);
      |                                                         ~~~^~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algobase.h:281:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare)'
  281 |     min(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/13/bits/stl_algobase.h:281:5: note:   template argument deduction/substitution failed:
council.cpp:33:60: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'long long int')
   33 |         for (int i = 0; i < N; ++i) mask_cnt[mask[i]] = min(mask_cnt[mask[i]], 2ll);
      |                                                         ~~~^~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:61:
/usr/include/c++/13/bits/stl_algo.h:5775:5: note: candidate: 'template<class _Tp> constexpr _Tp std::min(initializer_list<_Tp>)'
 5775 |     min(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/13/bits/stl_algo.h:5775:5: note:   template argument deduction/substitution failed:
council.cpp:33:60: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   33 |         for (int i = 0; i < N; ++i) mask_cnt[mask[i]] = min(mask_cnt[mask[i]], 2ll);
      |                                                         ~~~^~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:5785:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::min(initializer_list<_Tp>, _Compare)'
 5785 |     min(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/13/bits/stl_algo.h:5785:5: note:   template argument deduction/substitution failed:
council.cpp:33:60: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   33 |         for (int i = 0; i < N; ++i) mask_cnt[mask[i]] = min(mask_cnt[mask[i]], 2ll);
      |                                                         ~~~^~~~~~~~~~~~~~~~~~~~~~~~