oj.uz

답안 #795291

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
795291 2023-07-27T08:09:36 Z vjudge1 Council (JOI23_council) C++17
22 / 100
 4000 ms 65740 KB 

// Author : حسن

#include <bits/stdc++.h>



using namespace std;

#define TL ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define rall(s) s.rbegin(),s.rend()
#define all(s) s.begin(),s.end()
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ld long double
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define yes cout<<"yes\n"
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define no cout<<"no\n"


const int N = 3e5 + 9 , mod = 1e9 + 7;
ll c[N] = {} , d[N] = {} , a[N][22] = {}, b[N] = {}  , us[N] , dp[N * 4] = {};


void solve(){
    ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
    cin>>n>>m;
    //cout<<pow(2 , 8)<<"\n";
    for(i = 1;i  <= n; i++)
        for(j = 1; j <= m; j++)
            cin>>a[i][j] , b[j] += a[i][j];
    y = n/ 2;
    for(j = 1; j <= m; j++)
        s += b[j] >= y;
   // cout<<s<<"\n";
   //cout<<pow(2 , 5)<<"\n";
    if(n <= 3000){
        for(i = 1; i <= n; i++){
            mx = 0;
            for(j = 1; j <= m; j++){
                b[j] -= a[i][j];
                if(a[i][j] == 1 && b[j] == y - 1)
                    s--;
            }
            for(x = 1; x <= n; x++){
                if(x == i)
                continue;
                for(j = 1; j <= m; j++){
                        b[j] -= a[x][j];
                if(a[x][j] == 1 && b[j] == y - 1)
                    s--;
                }
                mx = max(mx , s);
                for(j = 1; j <= m; j++){
                        b[j] += a[x][j];
                if(a[x][j] == 1 && b[j] == y)
                    s++;
                }
            }

                for(j = 1; j <= m; j++){
                        b[j] += a[i][j];
                if(a[i][j] == 1 && b[j] == y)
                    s++;
                }
             //   cout<<s<<"\n";
           cout<<mx<<"\n";
        }
    }else {
        set<int>st;
        for(i = 1; i <= n; i++){
            for(j = 1; j <= m; j++){
                b[j] -= a[i][j];
                if(a[i][j] == 1 && b[j] == y - 1)
                    s--;
            }
            c[i] = s;
            x = 0;
            for(j = 1; j <= m; j++)
                if(b[j] == y)
                    x += (1 << j);
            us[i] =  x;
            st.insert(x);
            for(j = 1; j <= m; j++){
                        b[j] += a[i][j];
                if(a[i][j] == 1 && b[j] == y)
                    s++;
                }
        }
        //cout<<c[1]<<" "<<us[1]<<"\n";
        for(auto it : st)
            dp[it] = 1e9;
        for(i = 1; i <= n; i++)
            b[i] = 0;
        for(i = 1; i <= n; i++){
            if(i != 1)
            b[i] =  c[i] - dp[us[i]];
            for(auto it : st){
                    s = 0;
                for(j = 1; j <= m; j++){
                    if((((1 << j) & it) != 0) && a[i][j])
                        s++;
                }
                dp[it] = min(dp[it] , s);
            }
        }
        for(auto it : st)
            dp[it] = 1e9;
        for(i = n; i >= 1; i--){
            //if(i == 1)
            //    b[i] = c[i] - dp[us[i]];
            //if(i != n)
            b[i]=  max(b[i] ,  c[i] - dp[us[i]]);
            for(auto it : st){
                    s = 0;
                for(j = 1; j <= m; j++){
                    if((((1 << j) & it) != 0) && a[i][j])
                        s++;
                }
                dp[it] = min(dp[it] , s);
            }
        }
        for(i = 1; i <= n; i++)
            cout<<b[i]<<"\n";
    }
}

int main(){

     TL;
     /*
     #ifndef ONLINE_JUDGE
     freopen("input.txt", "r", stdin);
     freopen("output.txt", "w", stdout);
     #endif
     */
int t = 1;
//cin>>t;

while(t--)
     {
     solve();
     }

}
// Author : حسن

Compilation message

council.cpp: In function 'void solve()':
council.cpp:32:8: warning: unused variable 'q' [-Wunused-variable]
   32 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |        ^
council.cpp:32:28: warning: unused variable 'z' [-Wunused-variable]
   32 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                            ^
council.cpp:32:40: warning: unused variable 'f' [-Wunused-variable]
   32 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                        ^
council.cpp:32:43: warning: unused variable 'l' [-Wunused-variable]
   32 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                           ^
council.cpp:32:47: warning: unused variable 'r' [-Wunused-variable]
   32 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                               ^
council.cpp:32:51: warning: unused variable 'k' [-Wunused-variable]
   32 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                   ^
council.cpp:32:63: warning: unused variable 'mn' [-Wunused-variable]
   32 |     ll q , i , j , m , n , z , s  = 0, f, l , r , k , x , y , mn  = 1e18 , mx = 0;
      |                                                               ^~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 6 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 10 ms 284 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 13 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 5 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 2 ms 284 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 7 ms 392 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 340 KB Output is correct
45 Correct 0 ms 340 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 0 ms 340 KB Output is correct
50 Correct 0 ms 212 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 6 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 10 ms 284 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 13 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 5 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 2 ms 284 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 7 ms 392 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 340 KB Output is correct
45 Correct 0 ms 340 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 0 ms 340 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 365 ms 860 KB Output is correct
52 Correct 405 ms 852 KB Output is correct
53 Correct 1064 ms 852 KB Output is correct
54 Correct 1166 ms 852 KB Output is correct
55 Correct 111 ms 852 KB Output is correct
56 Correct 987 ms 852 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 67 ms 59544 KB Output is correct
3 Correct 66 ms 59568 KB Output is correct
4 Correct 57 ms 59516 KB Output is correct
5 Correct 72 ms 59612 KB Output is correct
6 Correct 64 ms 59556 KB Output is correct
7 Correct 84 ms 59580 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 284 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 112 ms 852 KB Output is correct

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 67 ms 59544 KB Output is correct
3 Correct 66 ms 59568 KB Output is correct
4 Correct 57 ms 59516 KB Output is correct
5 Correct 72 ms 59612 KB Output is correct
6 Correct 64 ms 59556 KB Output is correct
7 Correct 84 ms 59580 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 284 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 112 ms 852 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 2672 ms 59564 KB Output is correct
21 Correct 1401 ms 64820 KB Output is correct
22 Correct 1425 ms 64960 KB Output is correct
23 Correct 162 ms 65740 KB Output is correct
24 Correct 161 ms 65480 KB Output is correct
25 Correct 188 ms 65464 KB Output is correct
26 Execution timed out 4067 ms 64836 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 67 ms 59544 KB Output is correct
3 Correct 66 ms 59568 KB Output is correct
4 Correct 57 ms 59516 KB Output is correct
5 Correct 72 ms 59612 KB Output is correct
6 Correct 64 ms 59556 KB Output is correct
7 Correct 84 ms 59580 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 284 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 112 ms 852 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 2672 ms 59564 KB Output is correct
21 Correct 1401 ms 64820 KB Output is correct
22 Correct 1425 ms 64960 KB Output is correct
23 Correct 162 ms 65740 KB Output is correct
24 Correct 161 ms 65480 KB Output is correct
25 Correct 188 ms 65464 KB Output is correct
26 Execution timed out 4067 ms 64836 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 67 ms 59544 KB Output is correct
3 Correct 66 ms 59568 KB Output is correct
4 Correct 57 ms 59516 KB Output is correct
5 Correct 72 ms 59612 KB Output is correct
6 Correct 64 ms 59556 KB Output is correct
7 Correct 84 ms 59580 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 284 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 112 ms 852 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 2672 ms 59564 KB Output is correct
21 Correct 1401 ms 64820 KB Output is correct
22 Correct 1425 ms 64960 KB Output is correct
23 Correct 162 ms 65740 KB Output is correct
24 Correct 161 ms 65480 KB Output is correct
25 Correct 188 ms 65464 KB Output is correct
26 Execution timed out 4067 ms 64836 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 6 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 10 ms 284 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 13 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 5 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 340 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 2 ms 284 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 7 ms 392 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 340 KB Output is correct
45 Correct 0 ms 340 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 0 ms 340 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 365 ms 860 KB Output is correct
52 Correct 405 ms 852 KB Output is correct
53 Correct 1064 ms 852 KB Output is correct
54 Correct 1166 ms 852 KB Output is correct
55 Correct 111 ms 852 KB Output is correct
56 Correct 987 ms 852 KB Output is correct
57 Correct 0 ms 340 KB Output is correct
58 Correct 67 ms 59544 KB Output is correct
59 Correct 66 ms 59568 KB Output is correct
60 Correct 57 ms 59516 KB Output is correct
61 Correct 72 ms 59612 KB Output is correct
62 Correct 64 ms 59556 KB Output is correct
63 Correct 84 ms 59580 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 0 ms 340 KB Output is correct
66 Correct 0 ms 340 KB Output is correct
67 Correct 0 ms 212 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 0 ms 284 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 0 ms 340 KB Output is correct
72 Correct 1 ms 340 KB Output is correct
73 Correct 112 ms 852 KB Output is correct
74 Correct 0 ms 340 KB Output is correct
75 Correct 0 ms 212 KB Output is correct
76 Correct 2672 ms 59564 KB Output is correct
77 Correct 1401 ms 64820 KB Output is correct
78 Correct 1425 ms 64960 KB Output is correct
79 Correct 162 ms 65740 KB Output is correct
80 Correct 161 ms 65480 KB Output is correct
81 Correct 188 ms 65464 KB Output is correct
82 Execution timed out 4067 ms 64836 KB Time limit exceeded
83 Halted 0 ms 0 KB -