# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
751951 | grogu | Council (JOI23_council) | C++14 | 1310 ms | 110908 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
#define int long long
using namespace std;
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
int a[n][m];
int b[n];
int s[m];
for(int i=0; i<m; i++) s[i] = 0;
for(int i=0; i<n; i++) {
b[i] = 0;
for(int j=0; j<m; j++) {
cin >> a[i][j];
s[j] += a[i][j];
b[i] |= (a[i][j] << j);
}
}
int cnt[(1<<m)];
int ans[(1<<m)];
for(int i=0; i<(1<<m); i++) cnt[i] = 0, ans[i] = -1;
for(int i=0; i<n; i++) cnt[b[i]]++;
pair<int,int> dp[(1<<m)][2];
for(int i=0; i<(1<<m); i++) for(int j=0; j<2; j++) dp[i][j] = {1e9, -1};
for(int i=0; i<n; i++) {
if(dp[b[i]][0].first == 0) dp[b[i]][1] = {0, i};
else dp[b[i]][0] = {0, i};
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |