oj.uz

답안 #475393

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
475393 2021-09-22T09:13:59 Z Ahmed57 Izbori (COCI17_izbori) C++14
76 / 80
 139 ms 204 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
    int n,m,k;
    cin>>n>>m>>k;
    int arr[n][m];
    for(int i = 0;i<n;i++)for(int j = 0;j<m;j++)cin>>arr[i][j];
    for(int i=0;i<m;i++){
        map<int,int>mp;
        for(int j = 0;j<n;j++){
            mp[arr[j][i]]++;
        }
        if(i==0){
        long long ans = 0;
        int ma=0;
        for(auto j:mp){
            ma = max(ma,j.second);
        }
        for(auto j:mp){
            if(j.second==ma){
                ans=j.first;
                break;
            }
        }
        cout<<ans<<endl;
        }
    }
    int ans2=m;
    for(int mm=1;mm<(1<<m);mm++){
        int s[m+1]={0};
        int c=0;
        for(int i=0;i<m;i++){
            int a=(1<<i)&mm;
            if(a)s[i+1]=1;
            else c++;
        }
        int w=m;
        int ma=0;
        vector<int>temp;
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                if(s[arr[i][j]]) {
                    temp.push_back(arr[i][j]);
                    break;
                }
            }
        }
        map<int,int>f;
        for(auto i:temp){
            f[i]++;
        }
        for(int i=1;i<=m;i++){
            ma = max(ma,f[temp[i]]);
        }
        for(int i=1;i<=m;i++){
            if(f[i]==ma){
                w=i;
                break;
            }
        }
        if(w==k){
            ans2=min(ans2,c);
        }
    }
    cout<<ans2<<endl;
    return 0;
}

Subtask #1
76.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 204 KB Output is correct
2 Correct 46 ms 204 KB Output is correct
3 Correct 4 ms 204 KB Output is correct
4 Correct 28 ms 204 KB Output is correct
5 Correct 7 ms 204 KB Output is correct
6 Correct 4 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 50 ms 204 KB Output is correct
9 Correct 17 ms 204 KB Output is correct
10 Correct 3 ms 204 KB Output is correct
11 Correct 14 ms 204 KB Output is correct
12 Partially correct 60 ms 204 KB Partially correct
13 Correct 124 ms 204 KB Output is correct
14 Correct 61 ms 204 KB Output is correct
15 Correct 15 ms 204 KB Output is correct
16 Correct 139 ms 204 KB Output is correct
17 Correct 62 ms 204 KB Output is correct
18 Partially correct 133 ms 204 KB Partially correct
19 Correct 139 ms 204 KB Output is correct
20 Correct 137 ms 204 KB Output is correct