Submission #1086920

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1086920	2024-09-11T17:49:33 Z	daoquanglinh2007	Council (JOI23_council)	C++17	6 / 100	76 ms	7072 KB

council

#include <bits/stdc++.h>
using namespace std;
 
const int NM = 3e5, MM = 20;
 
int N, M, msk[NM+5], occ[(1<<MM)+5], cnt[MM+5];
int f[(1<<MM)+5], g[(1<<MM)+5];
 
void optimize(int i, int x){
    if (f[i] == -1 || __builtin_popcount(x&i) < __builtin_popcount(f[i]&i)){
        g[i] = f[i];
        f[i] = x;
        return;
    }
    //if (x == f[i]) return;
    if (g[i] == -1 || __builtin_popcount(x&i) < __builtin_popcount(g[i]&i)){
        g[i] = x;
    }
}
 
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
 
    cin >> N >> M;
    for (int i = 1; i <= N; i++){
        for (int j = 0; j < M; j++){
            char ch; cin >> ch;
            if (ch == '1'){
                msk[i] += 1<<j;
                cnt[j]++;
            }
        }
        occ[msk[i]]++;
    }
    for (int i = 0; i < (1<<M); i++){
        f[i] = (occ[i] > 0 ? i : -1);
        g[i] = -1;
    }
    for (int j = 0; j < M; j++)
        for (int i = (1<<M)-1; i >= 0; i--)
            if ((i>>j)&1){
                if (f[i-(1<<j)] != -1) optimize(i, f[i-(1<<j)]);
                if (g[i-(1<<j)] != -1) optimize(i, g[i-(1<<j)]);
            }
    for (int i = (1<<M)-1; i >= 0; i--)
        for (int j = 0; j < M; j++)
            if (((i>>j)&1) == 0){
                optimize(i, f[i+(1<<j)]);
                optimize(i, g[i+(1<<j)]);
            }
    for (int i = 1; i <= N; i++){
        int tmp = 0, res = 0;
        for (int j = 0; j < M; j++){
            if (cnt[j]-((msk[i]>>j)&1) >= N/2) res++;
            if (cnt[j]-((msk[i]>>j)&1) == N/2) tmp += (1<<j);
        }
        if (f[tmp] == msk[i] && occ[msk[i]] == 1) res -= __builtin_popcount(g[tmp]&tmp);
        else res -= __builtin_popcount(f[tmp]&tmp);
 
        cout << res << '\n';
    }
    return 0;
}

Subtask #1

0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Incorrect	1 ms	348 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #2

0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Incorrect	1 ms	348 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #3

6.0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	21 ms	3404 KB	Output is correct
3	Correct	21 ms	2168 KB	Output is correct
4	Correct	22 ms	2652 KB	Output is correct
5	Correct	25 ms	3360 KB	Output is correct
6	Correct	22 ms	2652 KB	Output is correct
7	Correct	28 ms	3416 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct

Subtask #4

0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	21 ms	3404 KB	Output is correct
3	Correct	21 ms	2168 KB	Output is correct
4	Correct	22 ms	2652 KB	Output is correct
5	Correct	25 ms	3360 KB	Output is correct
6	Correct	22 ms	2652 KB	Output is correct
7	Correct	28 ms	3416 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	76 ms	7072 KB	Output is correct
21	Correct	71 ms	6424 KB	Output is correct
22	Incorrect	61 ms	6484 KB	Output isn't correct
23	Halted	0 ms	0 KB	-

Subtask #5

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	21 ms	3404 KB	Output is correct
3	Correct	21 ms	2168 KB	Output is correct
4	Correct	22 ms	2652 KB	Output is correct
5	Correct	25 ms	3360 KB	Output is correct
6	Correct	22 ms	2652 KB	Output is correct
7	Correct	28 ms	3416 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	76 ms	7072 KB	Output is correct
21	Correct	71 ms	6424 KB	Output is correct
22	Incorrect	61 ms	6484 KB	Output isn't correct
23	Halted	0 ms	0 KB	-

Subtask #6

0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	21 ms	3404 KB	Output is correct
3	Correct	21 ms	2168 KB	Output is correct
4	Correct	22 ms	2652 KB	Output is correct
5	Correct	25 ms	3360 KB	Output is correct
6	Correct	22 ms	2652 KB	Output is correct
7	Correct	28 ms	3416 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	76 ms	7072 KB	Output is correct
21	Correct	71 ms	6424 KB	Output is correct
22	Incorrect	61 ms	6484 KB	Output isn't correct
23	Halted	0 ms	0 KB	-

Subtask #7

0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Incorrect	1 ms	348 KB	Output isn't correct
3	Halted	0 ms	0 KB	-