# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45084 | nibnalin | Cities (BOI16_cities) | C++17 | 3924 ms | 45124 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 <iostream>
#include <cstdio>
#include <vector>
#include <set>
#include <queue>
using namespace std;
typedef long long int lli;
const int maxn = lli(1e5)+5, maxk = 6;
const lli inf = lli(1e17)+5;
int n, A[maxk];
lli dp[(1<<maxk)][maxn];
vector<pair<int, int>> graph[maxn];
int main(void)
{
int k, m, u, v, w;
scanf("%d%d%d", &n, &k, &m);
for(int i = 0;i < k;i++)
{
scanf("%d", &A[i]);
A[i]--;
}
for(int i = 0;i < m;i++)
{
scanf("%d%d%d", &u, &v, &w);
u--, v--;
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |