# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
520013 | KoD | Političari (COCI20_politicari) | C++17 | 51 ms | 61132 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using std::vector;
using std::array;
using std::pair;
using std::tuple;
using ll = long long;
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
int N;
ll K;
std::cin >> N >> K;
vector A(N, vector(N, 0));
for (auto& v : A) {
for (auto& x : v) {
std::cin >> x;
x -= 1;
}
}
array<vector<int>, 60> to;
to[0] = vector(N * N, 0);
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
if (i != j) {
to[0][i * N + j] = A[i][j] * N + i;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |