oj.uz

답안 #889607

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
889607 2023-12-20T03:48:43 Z vjudge1 Council (JOI23_council) C++17
16 / 100
 1940 ms 5652 KB 
#include <bits/stdc++.h>
#define int long long
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define pb push_back
using namespace std;
signed main(){
    ios_base::sync_with_stdio();
    cin.tie(0);
    int n,m;
    cin>>n>>m;
    int a[n][m];
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            cin>>a[i][j];
        }
    }
    
    vector <int> cnt;
    for(int i=0;i<m;i++){
        int kol=0;
        for(int j=0;j<n;j++){
            if(a[j][i]==1)kol++;
        }
        cnt.pb(kol);
    }
    if(n<=3000){
        for(int i=0;i<n;i++){
            for(int k=0;k<m;k++){
                if(a[i][k]==1)cnt[k]--;
            }
            int mx=0;
            for(int j=0;j<n;j++){
                if(i!=j){
                    int kol=0;
                    for(int k=0;k<m;k++){
                        if(a[j][k]==1)cnt[k]--;
                    }
                    for(int k=0;k<m;k++){
                        if(cnt[k]>=n/2)kol++;
                    }
                    for(int k=0;k<m;k++){
                        if(a[j][k]==1)cnt[k]++;
                    }
                    mx=max(mx,kol);
                }
            }
            cout<<mx<<"\n";
            for(int k=0;k<m;k++){
                if(a[i][k]==1)cnt[k]++;
            }
        }
        return 0;
    }
    if(m==2){
        map <pair <int,int> ,int> mp;
        for(int i=0;i<n;i++){
            mp[{a[i][0],a[i][1]}]++;
        }
        
        for(int i=0;i<n;i++){
            int mx=0;
            mp[{a[i][0],a[i][1]}]--;
            for(int k=0;k<m;k++){
                if(a[i][k]==1)cnt[k]--;
            }
            if(mp[{0,0}]>0){
                int kol=0;
                for(int k=0;k<m;k++){
                    if(cnt[k]>=n/2)kol++;
                }
                mx=max(mx,kol);
            }
            if(mp[{1,0}]>0){
                int kol=0;
                cnt[0]--;
                for(int k=0;k<m;k++){
                    if(cnt[k]>=n/2)kol++;
                }
                cnt[0]++;
                mx=max(mx,kol);
            }
            if(mp[{0,1}]>0){
                int kol=0;
                cnt[1]--;
                for(int k=0;k<m;k++){
                    if(cnt[k]>=n/2)kol++;
                }
                cnt[1]++;
                mx=max(mx,kol);
            }
            if(mp[{1,1}]>0){
                int kol=0;
                cnt[1]--;cnt[0]--;
                for(int k=0;k<m;k++){
                    if(cnt[k]>=n/2)kol++;
                }
                cnt[1]++;cnt[0]--;
                mx=max(mx,kol);
            }
            mp[{a[i][0],a[i][1]}]++;
            for(int k=0;k<m;k++){
                if(a[i][k]==1)cnt[k]++;
            }
            cout<<mx<<"\n";
        }
    }
    else if(m==1){
        map <int,int> mp;
        for(int i=0;i<n;i++){
            mp[a[i][0]]++;
        }
        for(int i=0;i<n;i++){
            int mx=0;
            mp[a[i][0]]--;
            for(int k=0;k<m;k++){
                if(a[i][k]==1)cnt[k]--;
            }
            
            if(mp[0]>0){
                int kol=0;
                for(int k=0;k<m;k++){
                    if(cnt[k]>=n/2)kol++;
                }
                mx=max(mx,kol);
            }
            if(mp[1]>0){
                int kol=0;
                cnt[0]--;
                for(int k=0;k<m;k++){
                    if(cnt[k]>=n/2)kol++;
                }
                cnt[0]++;
                mx=max(mx,kol);
            }
            cout<<mx<<"\n";
            for(int k=0;k<m;k++){
                if(a[i][k]==1)cnt[k]++;
            }
            mp[a[i][0]]++;
        }
    }
}

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 17 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 17 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 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 0 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 4 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 5 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 321 ms 1112 KB Output is correct
52 Correct 430 ms 896 KB Output is correct
53 Correct 1940 ms 884 KB Output is correct
54 Correct 1930 ms 896 KB Output is correct
55 Correct 72 ms 348 KB Output is correct
56 Correct 1681 ms 1060 KB Output is correct

Subtask #3
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 89 ms 5652 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 89 ms 5652 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 89 ms 5652 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 89 ms 5652 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 17 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 17 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 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 0 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 4 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 5 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 321 ms 1112 KB Output is correct
52 Correct 430 ms 896 KB Output is correct
53 Correct 1940 ms 884 KB Output is correct
54 Correct 1930 ms 896 KB Output is correct
55 Correct 72 ms 348 KB Output is correct
56 Correct 1681 ms 1060 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Incorrect 89 ms 5652 KB Output isn't correct
59 Halted 0 ms 0 KB -