Submission #979118

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
979118	2024-05-10T09:15:17 Z	sleepntsheep	Council (JOI23_council)	C	6 / 100	63 ms	11184 KB

council

#include<stdio.h>
#include<string.h>

#define N 300000
#define M 20

int a[N], n, m, cc[M], f[1<<M][2], g[1<<M][2];

int count(int x) { return x ? 1 + count(x&x-1) : 0; }

void put(int i, int v)
{
    if (v>f[i][0])
        f[i][1]=f[i][0],f[i][0]=v;
    else if(v>f[i][1])
        f[i][1]=v;
}

void put_(int i, int v)
{
    if (v > f[i][0])
        f[i][1]=f[i][0],f[i][0]=v;
    else if(v>f[i][1])
        f[i][1]=v;
}

int main()
{
    memset(f,0,sizeof f);
    scanf("%d%d",&n,&m);
    for(int i=0;i<n;++i)
    {
        for(int x,j=0;j<m;++j)
            scanf("%d",&x),a[i]|=x<<j, cc[j]+=x;

        int b=((1<<m)-1)&~a[i];
        put(b, count(b));
    }

    /* need to find max count(b[i] & S)
     * SOS dp :question: 
     *
     */

    for(int i=0;i<m;++i)
        for(int j=0;j<(1<<m);++j)
            if(1==((j>>i)&1))
                put(j^(1<<i), f[j][1]-1), put(j^(1<<i), f[j][0]-1);

    for(int i=0;i<m;++i)
        for(int j=0;j<(1<<m);++j)
            if(0==(j&(1<<i)))
                put_(j^(1<<i), f[j][1]), put_(j^(1<<i), f[i][0]);

    for(int i=0;i<n;++i)
    {
        int S=0,ans=0;
        for(int j=0;j<m;++j)
        {
            int c=cc[j]-((a[i]>>j)&1);
            if (c>n/2)
                ++ans;
            else if(c==n/2)
                S|=1<<j;
        }
        int b=((1<<m)-1)&~a[i];
        if (count(S&b) == f[S][0])
            ans += f[S][1];
        else
            ans += f[S][0];

        printf("%d\n", ans);
    }

}

Compilation message

council.c: In function 'count':
council.c:9:44: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
    9 | int count(int x) { return x ? 1 + count(x&x-1) : 0; }
      |                                           ~^~
council.c: In function 'main':
council.c:30:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     scanf("%d%d",&n,&m);
      |     ^~~~~~~~~~~~~~~~~~~
council.c:34:13: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |             scanf("%d",&x),a[i]|=x<<j, cc[j]+=x;
      |             ^~~~~~~~~~~~~~

Subtask #1

0 / 8.0

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

Subtask #2

0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	10588 KB	Output is correct
2	Incorrect	2 ms	10588 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	10588 KB	Output is correct
2	Correct	59 ms	11096 KB	Output is correct
3	Correct	61 ms	11064 KB	Output is correct
4	Correct	42 ms	11168 KB	Output is correct
5	Correct	61 ms	11184 KB	Output is correct
6	Correct	43 ms	11092 KB	Output is correct
7	Correct	63 ms	11184 KB	Output is correct
8	Correct	2 ms	10840 KB	Output is correct
9	Correct	1 ms	10588 KB	Output is correct
10	Correct	1 ms	10588 KB	Output is correct
11	Correct	2 ms	10588 KB	Output is correct
12	Correct	1 ms	10584 KB	Output is correct
13	Correct	2 ms	10588 KB	Output is correct
14	Correct	1 ms	10588 KB	Output is correct
15	Correct	2 ms	10584 KB	Output is correct
16	Correct	2 ms	10588 KB	Output is correct
17	Correct	2 ms	10588 KB	Output is correct

Subtask #4

0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	10588 KB	Output is correct
2	Correct	59 ms	11096 KB	Output is correct
3	Correct	61 ms	11064 KB	Output is correct
4	Correct	42 ms	11168 KB	Output is correct
5	Correct	61 ms	11184 KB	Output is correct
6	Correct	43 ms	11092 KB	Output is correct
7	Correct	63 ms	11184 KB	Output is correct
8	Correct	2 ms	10840 KB	Output is correct
9	Correct	1 ms	10588 KB	Output is correct
10	Correct	1 ms	10588 KB	Output is correct
11	Correct	2 ms	10588 KB	Output is correct
12	Correct	1 ms	10584 KB	Output is correct
13	Correct	2 ms	10588 KB	Output is correct
14	Correct	1 ms	10588 KB	Output is correct
15	Correct	2 ms	10584 KB	Output is correct
16	Correct	2 ms	10588 KB	Output is correct
17	Correct	2 ms	10588 KB	Output is correct
18	Correct	2 ms	10840 KB	Output is correct
19	Incorrect	1 ms	10588 KB	Output isn't correct
20	Halted	0 ms	0 KB	-

Subtask #5

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	10588 KB	Output is correct
2	Correct	59 ms	11096 KB	Output is correct
3	Correct	61 ms	11064 KB	Output is correct
4	Correct	42 ms	11168 KB	Output is correct
5	Correct	61 ms	11184 KB	Output is correct
6	Correct	43 ms	11092 KB	Output is correct
7	Correct	63 ms	11184 KB	Output is correct
8	Correct	2 ms	10840 KB	Output is correct
9	Correct	1 ms	10588 KB	Output is correct
10	Correct	1 ms	10588 KB	Output is correct
11	Correct	2 ms	10588 KB	Output is correct
12	Correct	1 ms	10584 KB	Output is correct
13	Correct	2 ms	10588 KB	Output is correct
14	Correct	1 ms	10588 KB	Output is correct
15	Correct	2 ms	10584 KB	Output is correct
16	Correct	2 ms	10588 KB	Output is correct
17	Correct	2 ms	10588 KB	Output is correct
18	Correct	2 ms	10840 KB	Output is correct
19	Incorrect	1 ms	10588 KB	Output isn't correct
20	Halted	0 ms	0 KB	-

Subtask #6

0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	10588 KB	Output is correct
2	Correct	59 ms	11096 KB	Output is correct
3	Correct	61 ms	11064 KB	Output is correct
4	Correct	42 ms	11168 KB	Output is correct
5	Correct	61 ms	11184 KB	Output is correct
6	Correct	43 ms	11092 KB	Output is correct
7	Correct	63 ms	11184 KB	Output is correct
8	Correct	2 ms	10840 KB	Output is correct
9	Correct	1 ms	10588 KB	Output is correct
10	Correct	1 ms	10588 KB	Output is correct
11	Correct	2 ms	10588 KB	Output is correct
12	Correct	1 ms	10584 KB	Output is correct
13	Correct	2 ms	10588 KB	Output is correct
14	Correct	1 ms	10588 KB	Output is correct
15	Correct	2 ms	10584 KB	Output is correct
16	Correct	2 ms	10588 KB	Output is correct
17	Correct	2 ms	10588 KB	Output is correct
18	Correct	2 ms	10840 KB	Output is correct
19	Incorrect	1 ms	10588 KB	Output isn't correct
20	Halted	0 ms	0 KB	-

Subtask #7

0 / 22.0

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