Submission #1213696

#TimeUsernameProblemLanguageResultExecution timeMemory
1213696FatonimBrought Down the Grading Server? (CEOI23_balance)C++20
0 / 100
50 ms8516 KiB
#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(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...