# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1167000 | adriannok | Travelling Merchant (APIO17_merchant) | C++20 | 1095 ms | 5696 KiB |
#include <bits/stdc++.h>
#define sooth true
#define untrue false
using namespace std;
const int inf = 1e9 * 2;
int Nbuffer;
struct edge
{
int u, t;
edge(int _u, int _t) : u(_u), t(_t) {}
};
int N, M, K;
vector< vector< vector<int64_t> > > market;
vector< vector<edge> > adj;
vector<bool> beheld;
int64_t dfs ( int i, vector<int> &way, int64_t length, bool cycle = untrue )
{
int64_t maxv = 0;
if( cycle )
{
for(int i = 0; i < K; ++i)
for(int j = 0; j < (int)way.size(); ++j)
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... |