Submission #795025

#TimeUsernameProblemLanguageResultExecution timeMemory
795025vjudge1Council (JOI23_council)C++17
16 / 100
4041 ms1492 KiB
#ifdef Home #define _GLIBCXX_DEBUG #endif // Home #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; const int N = 300300; int arr[N], sum[22]; main() { #ifdef Home freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif // Home ios_base::sync_with_stdio(0); cin.tie(0); int n, m, n2; cin >> n >> m; n2 = n / 2; for(int i = 0, k, t; i < n; ++ i) { k = 0; for(int j = m; j --> 0;) { cin >> t; k <<= 1; k |= t; sum[j] += t; } arr[i] = k; } for(int i = 0, k, ans, mn; i < n; ++ i) { k = ans = 0; mn = m; for(int j = m; j --> 0;) { ans += (sum[j] - (0 != ((1<<j)&arr[i]))) >= n2; k <<= 1; k |= (sum[j] - (0 != ((1<<j)&arr[i]))) == n2; } for(int j = 0; j < n; ++ j) { if(i != j) { mn = min(mn, __builtin_popcount(k&arr[j])); } } cout << ans - mn << '\n'; } }

Compilation message (stderr)

council.cpp:16:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   16 | main() {
      | ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...