Submission #1360114

#	Time	Username	Problem	Language	Result	Execution time	Memory
1360114		SulA	Grid Coloring (JOI25_ho_t1)	C++20	25 / 100	2097 ms	26812 KiB

Main

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

/*
 * 2 1 1 2
 * 1 1 1 2
 * 2 2 2 2
 * 1 2 2 2
 */

int main() {
    int n; cin >> n;
    int A[n+1], B[n+1];
    for (int i = 0; i < n; cin >> A[i++]);
    for (int i = 0; i < n; cin >> B[i++]);
    map<int, long long> frq;
    frq[A[0]]++;
    for (int i = 1; i < n; i++) {
        frq[A[i]]++, frq[B[i]]++;
    }
    for (int i = 1; i < n-1; i++) {
        A[i + 1] = max(A[i], A[i + 1]);
        B[i + 1] = max(B[i], B[i + 1]);
    }
    for (int i = 1; i < n; i++) {
        for (int j = 1; j < n; j++) {
            frq[max(A[i], B[j])] ++;
        }
    }

    int mx = 0, col = 0;
    for (auto [x, cnt] : frq) {
        if (cnt >= mx) {
            mx = cnt;
            col = x;
        }
    }
    cout << col << " " << mx;
}

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