답안 #475370

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
475370 2021-09-22T08:42:34 Z HossamHero7 Izbori (COCI17_izbori) C++14
44 / 80
1 ms 332 KB
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define endl '\n'
void solve(){
    int n,m,k;
    cin>>n>>m>>k;
    vector <vector<int>> v(n,vector<int>(m));
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++) cin>>v[i][j];
    }
    for(int i=0;i<m;i++){
        map <int,int> mp;
        for(int j=0;j<n;j++){
            int x = v[j][i];
            mp[x] ++;
        }
        if(i == 0){
        ll ans = 0;
        int mx = 0;
        for(auto j : mp){
            mx = max(mx,j.second);
        }
        for(auto j:mp){
            if(j.second == mx){
                ans = j.first;
                break;
            }
        }
        cout<<ans<<endl;
        }
    }
    cout<<1<<endl;
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);      cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--){
        solve();
    }
    return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 204 KB Partially correct
2 Partially correct 1 ms 312 KB Partially correct
3 Correct 1 ms 204 KB Output is correct
4 Partially correct 1 ms 204 KB Partially correct
5 Partially correct 1 ms 204 KB Partially correct
6 Partially correct 1 ms 204 KB Partially correct
7 Partially correct 1 ms 204 KB Partially correct
8 Partially correct 1 ms 204 KB Partially correct
9 Partially correct 1 ms 204 KB Partially correct
10 Partially correct 1 ms 204 KB Partially correct
11 Partially correct 1 ms 332 KB Partially correct
12 Partially correct 1 ms 204 KB Partially correct
13 Partially correct 1 ms 204 KB Partially correct
14 Partially correct 1 ms 204 KB Partially correct
15 Correct 1 ms 204 KB Output is correct
16 Partially correct 1 ms 204 KB Partially correct
17 Partially correct 1 ms 204 KB Partially correct
18 Partially correct 1 ms 316 KB Partially correct
19 Partially correct 1 ms 204 KB Partially correct
20 Partially correct 1 ms 204 KB Partially correct