Submission #940835

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
940835	2024-03-07T17:55:04 Z	velislavgarkov	Council (JOI23_council)	C++14	16 / 100	4000 ms	4660 KB

council

#include <iostream>
using namespace std;
const int MAXN=3e5+10;
const int MAXM=(1<<20);
struct Answer {
    int ans1, ind1;
    int ans2, ind2;
};
int n, m;
int a[MAXN], cnt[32];
Answer dp[MAXM][25];
bool fbit(int x, int bit) {
    return (x & (1<<bit));
}
Answer find_dp(int mask, int m) {
    Answer res={0,0,0,0};
    for (int i=1;i<=n;i++) {
        int s=__builtin_popcount((~a[i])&mask);
        if (s>res.ans1) {
            res.ans2=res.ans1;
            res.ind2=res.ind2;
            res.ans1=s;
            res.ind1=i;
        } else if (s>res.ans2) {
            res.ans2=s;
            res.ind2=i;
        }
    }
    return res;
}
int main () {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n >> m;
    int bit;
    for (int i=1;i<=n;i++) {
        for (int j=0;j<m;j++) {
            cin >> bit;
            a[i]+=(bit<<j);
            cnt[j]+=bit;
        }
    }
    for (int i=1;i<=n;i++) {
        int ans=0, mask=0;
        for (int j=0;j<m;j++) {
            if (cnt[j]>=n/2+2) ans++;
            else if (cnt[j]==n/2+1) {
                if (!fbit(a[i],j)) ans++;
                else mask+=(1<<j);
            } else if (cnt[j]==n/2 && !fbit(a[i],j)) mask+=(1<<j);
        }
        Answer res=find_dp(mask,m-1);
        if (res.ind1!=i) ans+=res.ans1;
        else ans+=res.ans2;
        cout << ans << endl;
    }
    return 0;
}

Subtask #1
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2392 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2392 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2392 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2392 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2392 KB	Output is correct
21	Correct	1 ms	2396 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	1 ms	2392 KB	Output is correct
29	Correct	1 ms	2392 KB	Output is correct
30	Correct	1 ms	2396 KB	Output is correct
31	Correct	2 ms	2396 KB	Output is correct
32	Correct	1 ms	2396 KB	Output is correct
33	Correct	1 ms	2396 KB	Output is correct
34	Correct	1 ms	2396 KB	Output is correct
35	Correct	1 ms	2396 KB	Output is correct
36	Correct	1 ms	2396 KB	Output is correct
37	Correct	1 ms	2396 KB	Output is correct
38	Correct	1 ms	2396 KB	Output is correct
39	Correct	1 ms	2396 KB	Output is correct
40	Correct	1 ms	2396 KB	Output is correct
41	Correct	1 ms	2396 KB	Output is correct
42	Correct	1 ms	2396 KB	Output is correct
43	Correct	1 ms	2392 KB	Output is correct
44	Correct	1 ms	2396 KB	Output is correct
45	Correct	1 ms	2392 KB	Output is correct
46	Correct	1 ms	2392 KB	Output is correct
47	Correct	1 ms	2396 KB	Output is correct
48	Correct	1 ms	2652 KB	Output is correct
49	Correct	1 ms	2396 KB	Output is correct
50	Correct	1 ms	2396 KB	Output is correct

Subtask #2
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2392 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2392 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2392 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2392 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2392 KB	Output is correct
21	Correct	1 ms	2396 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	1 ms	2392 KB	Output is correct
29	Correct	1 ms	2392 KB	Output is correct
30	Correct	1 ms	2396 KB	Output is correct
31	Correct	2 ms	2396 KB	Output is correct
32	Correct	1 ms	2396 KB	Output is correct
33	Correct	1 ms	2396 KB	Output is correct
34	Correct	1 ms	2396 KB	Output is correct
35	Correct	1 ms	2396 KB	Output is correct
36	Correct	1 ms	2396 KB	Output is correct
37	Correct	1 ms	2396 KB	Output is correct
38	Correct	1 ms	2396 KB	Output is correct
39	Correct	1 ms	2396 KB	Output is correct
40	Correct	1 ms	2396 KB	Output is correct
41	Correct	1 ms	2396 KB	Output is correct
42	Correct	1 ms	2396 KB	Output is correct
43	Correct	1 ms	2392 KB	Output is correct
44	Correct	1 ms	2396 KB	Output is correct
45	Correct	1 ms	2392 KB	Output is correct
46	Correct	1 ms	2392 KB	Output is correct
47	Correct	1 ms	2396 KB	Output is correct
48	Correct	1 ms	2652 KB	Output is correct
49	Correct	1 ms	2396 KB	Output is correct
50	Correct	1 ms	2396 KB	Output is correct
51	Correct	30 ms	2636 KB	Output is correct
52	Correct	29 ms	2392 KB	Output is correct
53	Correct	30 ms	2396 KB	Output is correct
54	Correct	30 ms	2396 KB	Output is correct
55	Correct	28 ms	2392 KB	Output is correct
56	Correct	30 ms	2396 KB	Output is correct

Subtask #3
0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Execution timed out	4075 ms	4660 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #4
0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Execution timed out	4075 ms	4660 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #5
0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Execution timed out	4075 ms	4660 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #6
0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Execution timed out	4075 ms	4660 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #7
0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2392 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2392 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2392 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2392 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2392 KB	Output is correct
21	Correct	1 ms	2396 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	1 ms	2392 KB	Output is correct
29	Correct	1 ms	2392 KB	Output is correct
30	Correct	1 ms	2396 KB	Output is correct
31	Correct	2 ms	2396 KB	Output is correct
32	Correct	1 ms	2396 KB	Output is correct
33	Correct	1 ms	2396 KB	Output is correct
34	Correct	1 ms	2396 KB	Output is correct
35	Correct	1 ms	2396 KB	Output is correct
36	Correct	1 ms	2396 KB	Output is correct
37	Correct	1 ms	2396 KB	Output is correct
38	Correct	1 ms	2396 KB	Output is correct
39	Correct	1 ms	2396 KB	Output is correct
40	Correct	1 ms	2396 KB	Output is correct
41	Correct	1 ms	2396 KB	Output is correct
42	Correct	1 ms	2396 KB	Output is correct
43	Correct	1 ms	2392 KB	Output is correct
44	Correct	1 ms	2396 KB	Output is correct
45	Correct	1 ms	2392 KB	Output is correct
46	Correct	1 ms	2392 KB	Output is correct
47	Correct	1 ms	2396 KB	Output is correct
48	Correct	1 ms	2652 KB	Output is correct
49	Correct	1 ms	2396 KB	Output is correct
50	Correct	1 ms	2396 KB	Output is correct
51	Correct	30 ms	2636 KB	Output is correct
52	Correct	29 ms	2392 KB	Output is correct
53	Correct	30 ms	2396 KB	Output is correct
54	Correct	30 ms	2396 KB	Output is correct
55	Correct	28 ms	2392 KB	Output is correct
56	Correct	30 ms	2396 KB	Output is correct
57	Correct	1 ms	2392 KB	Output is correct
58	Execution timed out	4075 ms	4660 KB	Time limit exceeded
59	Halted	0 ms	0 KB	-

Submission #940835

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 8.0 / 8.0

Subtask #3 0 / 6.0

Subtask #4 0 / 19.0

Subtask #5 0 / 15.0

Subtask #6 0 / 22.0

Subtask #7 0 / 22.0

Subtask #1
8.0 / 8.0

Subtask #2
8.0 / 8.0

Subtask #3
0 / 6.0

Subtask #4
0 / 19.0

Subtask #5
0 / 15.0

Subtask #6
0 / 22.0

Subtask #7
0 / 22.0