oj.uz

답안 #1087368

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1087368 2024-09-12T14:42:42 Z idk__ Izbori (COCI17_izbori) C++14
44 / 80
 1 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long



signed main() {
    int n, m, k;
    cin >> n >> m >> k;
    int a[n+50][m+50] = {};
    for(int i = 0;i < n; i++){
        for(int j = 0;j < m ;j++){
            cin >> a[i][j];
        }
    }
    
    int poi[n] = {}, ans = 0;
    while(true){
        int count=-1, num=-1;
        int cnt[16]={};
        for(int i = 0;i < 16; i++)cnt[i] = 0;
        for(int i = 0;i < n; i++){
        while(true){
            if(a[i][poi[i]]==-5)poi[i]++;
            else break;
        }
        if(poi[i]==m)continue;
        int& curr = a[i][poi[i]];
        


        cnt[curr]++;
        if(cnt[curr] > count){
            num = curr;
            count=cnt[curr];
        }
        else if(cnt[curr] == count and curr > num){
                num = curr;
                count = cnt[curr];
        }
        
        }
        if(ans==0)cout << num << endl;
        if(num == k)break;
       
       
        for(int i = 0;i < n; i++){
            for(int j = 0;j < m; j++){
                if(a[i][j]==num)a[i][j]=-5;
            }
        }
        
        ans++;
        
    }
  cout << ans << endl;
    
    
    }

Subtask #1
44.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Partially correct 0 ms 348 KB Partially correct
3 Partially correct 0 ms 348 KB Partially correct
4 Partially correct 0 ms 348 KB Partially correct
5 Partially correct 0 ms 348 KB Partially correct
6 Incorrect 1 ms 348 KB Output isn't correct
7 Partially correct 0 ms 348 KB Partially correct
8 Correct 0 ms 348 KB Output is correct
9 Partially correct 0 ms 348 KB Partially correct
10 Partially correct 0 ms 348 KB Partially correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Partially correct 0 ms 348 KB Partially correct
14 Partially correct 0 ms 348 KB Partially correct
15 Partially correct 0 ms 344 KB Partially correct
16 Partially correct 1 ms 348 KB Partially correct
17 Partially correct 1 ms 348 KB Partially correct
18 Incorrect 0 ms 348 KB Output isn't correct
19 Partially correct 0 ms 348 KB Partially correct
20 Partially correct 1 ms 344 KB Partially correct