# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
848326 | KN200711 | Voting Cities (NOI22_votingcity) | C++14 | 171 ms | 10696 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>
# define ll long long
# define fi first
# define se second
using namespace std;
int N, E, K;
vector<int> T;
vector< pair<int, ll> > edge[5001];
ll dp[32][5001];
bool vis[32][5001];
int main() {
scanf("%d %d %d", &N, &E, &K);
T.resize(K);
for(int i=0;i<K;i++) {
scanf("%d", &T[i]);
}
for(int i=0;i<E;i++) {
int a, b;
ll c;
scanf("%d %d %lld", &a, &b, &c);
edge[b].push_back(make_pair(a, c));
}
for(int i=0;i<32;i++) {
for(int k=0;k<N;k++) dp[i][k] = -1;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |