제출 #1345754

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1345754		piolk	Grid Coloring (JOI25_ho_t1)	C++20	25 / 100	451 ms	1114112 KiB

Main

#include <bits/stdc++.h>
using namespace std;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n;
    cin>>n;

    vector<vector<int>> grid(n,vector<int>(n));
    for (int i=0;i<n;i++) cin>>grid[i][0];
    for (int i=0;i<n;i++) cin>>grid[0][i];

    for (int i=1;i<n;i++){
        for (int j=1;j<n;j++){
            grid[i][j]=max(grid[i-1][j],grid[i][j-1]);
        }
    }

    unordered_map<int,int> mp;
    int col=0,cnt=0;
    for (int i=0;i<n;i++){
        for (int j=0;j<n;j++){
            int c=grid[i][j];
            mp[c]++;

            if (mp[c]>cnt){
                col=c;
                cnt=mp[c];
            } else if (mp[c]==cnt){
                col=max(col,c);
            }
        }
    }

    cout<<col<<" "<<cnt<<"\n";

    return 0;
}

• Subtask 1: 0 / 0
• Subtask 2: 15 / 15
• Subtask 3: 10 / 10
• Subtask 4: 0 / 20
• Subtask 5: 0 / 25
• Subtask 6: 0 / 30