# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
934433 | ind1v | Paths (BOI18_paths) | C++11 | 218 ms | 73812 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 namespace std;
const int N = 3e5 + 5;
const int K = 6;
int n, m, k;
int c[N];
int a[N], b[N];
vector<int> g[N];
int adj[N][K], adjadj[N][K][K];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m >> k;
for (int i = 1; i <= n; i++) {
cin >> c[i];
}
for (int i = 1; i <= m; i++) {
cin >> a[i] >> b[i];
adj[a[i]][c[b[i]]]++;
adj[b[i]][c[a[i]]]++;
g[a[i]].emplace_back(b[i]);
g[b[i]].emplace_back(a[i]);
}
for (int i = 1; i <= n; i++) {
for (int &j : g[i]) {
for (int cc = 1; cc <= k; cc++) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |