Submission #1213694

#	Time	Username	Problem	Language	Result	Execution time	Memory
1213694		Fatonim	Bring Down the Grading Server (CEOI23_gradingserver)	C++20	0 / 100	67 ms	4160 KiB

gradingserver

#include <bits/stdc++.h>

using namespace std;

#define all(a) a.begin(), a.end()
#define sz(a) ((int)(a.size()))
#define int long long
#define ll long long
#define pi pair<int, int>

const int maxn = 1e5 + 7;

void solve() {
    int n, s, t;
    cin >> n >> s >> t;

    vector<vector<int>> a(n, vector<int>(s));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < s; ++j) {
            cin >> a[i][j];
            --a[i][j];
        }
    }

    vector<int> cnt1(t, 0), cnt2(t, 0);
    for (int i = 0; i < n; ++i) {
        if (cnt1[a[i][0]] > cnt2[a[i][0]]) {
            swap(a[i][0], a[i][1]);
        }
        else if (cnt1[a[i][0]] == cnt2[a[i][0]]) {
            if (cnt1[a[i][1]] < cnt2[a[i][1]]) {
                swap(a[i][0], a[i][1]);
            }
        }
        ++cnt1[a[i][0]];
        ++cnt2[a[i][1]];
    }

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < s; ++j) {
            cout << a[i][j] + 1 << " ";
        } cout << "\n";
    }
}

signed main() {
    solve();
}

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