답안 #768844

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
768844	2023-06-28T18:15:37 Z	danikoynov	Council (JOI23_council)	C++14	16 / 100	4000 ms	7464 KB

council

/**
 ____ ____ ____ ____ ____ ____
||l |||e |||i |||n |||a |||d ||
||__|||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|/__\|

**/

#include<bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

const int maxn = 3e5 + 10, maxm = 21;
int n, m, imp[maxm], cnt[maxm];
bool a[maxn][maxm];
void solve()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i ++)
        for (int j = 0; j < m; j ++)
        cin >> a[i][j], cnt[j] += a[i][j];

    for (int i = 1; i <= n; i ++)
    {
        int base = 0;
        for (int j = 0; j < m; j ++)
        {
            int cur = cnt[j] - a[i][j];
            if (cur >= n / 2)
            {
                if ((cur - 1) < n / 2)
                imp[j] = 1;
                else
                    imp[j] = 0, base ++;
            }
            else
            {
                imp[j] = 0;
            }

        }

        /**cout << "----" << endl;
        cout << i << endl;
        for (int bit = 0; bit < m; bit ++)
            cout << imp[bit] << " ";
        cout << endl;*/
        int best = -m;
        for (int p = 1; p <= n; p ++)
        {
            if (p == i)
                continue;
                int sum = 0;
            for (int bit = 0; bit < m; bit ++)
            {
                if (imp[bit] == 1)
                {
                    if (a[p][bit] == 0)
                        sum ++;
                }
            }

            best = max(best, sum);
        }

        cout << base + best << endl;


    }
}

int main()
{
    speed();
    solve();
    return 0;
}

Compilation message

council.cpp: In function 'void solve()':
council.cpp:60:13: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   60 |             if (p == i)
      |             ^~
council.cpp:62:17: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   62 |                 int sum = 0;
      |                 ^~~

Subtask #1
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	2 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	2 ms	336 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	3 ms	340 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	328 KB	Output is correct
18	Correct	0 ms	328 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	1 ms	324 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	1 ms	212 KB	Output is correct
34	Correct	1 ms	212 KB	Output is correct
35	Correct	1 ms	212 KB	Output is correct
36	Correct	0 ms	212 KB	Output is correct
37	Correct	1 ms	212 KB	Output is correct
38	Correct	1 ms	332 KB	Output is correct
39	Correct	0 ms	212 KB	Output is correct
40	Correct	2 ms	340 KB	Output is correct
41	Correct	0 ms	212 KB	Output is correct
42	Correct	0 ms	212 KB	Output is correct
43	Correct	0 ms	212 KB	Output is correct
44	Correct	0 ms	212 KB	Output is correct
45	Correct	0 ms	212 KB	Output is correct
46	Correct	1 ms	340 KB	Output is correct
47	Correct	1 ms	212 KB	Output is correct
48	Correct	1 ms	212 KB	Output is correct
49	Correct	1 ms	212 KB	Output is correct
50	Correct	1 ms	212 KB	Output is correct

Subtask #2
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	2 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	2 ms	336 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	3 ms	340 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	328 KB	Output is correct
18	Correct	0 ms	328 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	1 ms	324 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	1 ms	212 KB	Output is correct
34	Correct	1 ms	212 KB	Output is correct
35	Correct	1 ms	212 KB	Output is correct
36	Correct	0 ms	212 KB	Output is correct
37	Correct	1 ms	212 KB	Output is correct
38	Correct	1 ms	332 KB	Output is correct
39	Correct	0 ms	212 KB	Output is correct
40	Correct	2 ms	340 KB	Output is correct
41	Correct	0 ms	212 KB	Output is correct
42	Correct	0 ms	212 KB	Output is correct
43	Correct	0 ms	212 KB	Output is correct
44	Correct	0 ms	212 KB	Output is correct
45	Correct	0 ms	212 KB	Output is correct
46	Correct	1 ms	340 KB	Output is correct
47	Correct	1 ms	212 KB	Output is correct
48	Correct	1 ms	212 KB	Output is correct
49	Correct	1 ms	212 KB	Output is correct
50	Correct	1 ms	212 KB	Output is correct
51	Correct	126 ms	492 KB	Output is correct
52	Correct	124 ms	468 KB	Output is correct
53	Correct	128 ms	496 KB	Output is correct
54	Correct	182 ms	496 KB	Output is correct
55	Correct	14 ms	340 KB	Output is correct
56	Correct	154 ms	468 KB	Output is correct

Subtask #3
0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	320 KB	Output is correct
2	Execution timed out	4051 ms	7464 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #4
0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	320 KB	Output is correct
2	Execution timed out	4051 ms	7464 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #5
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	320 KB	Output is correct
2	Execution timed out	4051 ms	7464 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #6
0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	320 KB	Output is correct
2	Execution timed out	4051 ms	7464 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #7
0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	2 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	2 ms	336 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	3 ms	340 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	328 KB	Output is correct
18	Correct	0 ms	328 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	1 ms	324 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	1 ms	212 KB	Output is correct
34	Correct	1 ms	212 KB	Output is correct
35	Correct	1 ms	212 KB	Output is correct
36	Correct	0 ms	212 KB	Output is correct
37	Correct	1 ms	212 KB	Output is correct
38	Correct	1 ms	332 KB	Output is correct
39	Correct	0 ms	212 KB	Output is correct
40	Correct	2 ms	340 KB	Output is correct
41	Correct	0 ms	212 KB	Output is correct
42	Correct	0 ms	212 KB	Output is correct
43	Correct	0 ms	212 KB	Output is correct
44	Correct	0 ms	212 KB	Output is correct
45	Correct	0 ms	212 KB	Output is correct
46	Correct	1 ms	340 KB	Output is correct
47	Correct	1 ms	212 KB	Output is correct
48	Correct	1 ms	212 KB	Output is correct
49	Correct	1 ms	212 KB	Output is correct
50	Correct	1 ms	212 KB	Output is correct
51	Correct	126 ms	492 KB	Output is correct
52	Correct	124 ms	468 KB	Output is correct
53	Correct	128 ms	496 KB	Output is correct
54	Correct	182 ms	496 KB	Output is correct
55	Correct	14 ms	340 KB	Output is correct
56	Correct	154 ms	468 KB	Output is correct
57	Correct	1 ms	320 KB	Output is correct
58	Execution timed out	4051 ms	7464 KB	Time limit exceeded
59	Halted	0 ms	0 KB	-

답안 #768844

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