# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1160548 | jus_teng | Travelling Merchant (APIO17_merchant) | C++20 | 1123 ms | 1114112 KiB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double ld;
const ll maxN = 100;
const ll maxK = 1000;
const ld inf = 1e18;
const ld eps = 1e-9;
ll n, m, k;
vector<vector<pair<ll, ll>>> adj;
vector<vector<ll>> b, s;
bool check(ld lambda) {
ll v = n * (k + 1);
vector<vector<ld>> dist(v, vector<ld>(v, -inf));
// Initialize self-loops and starting states
for (ll u = 0; u < n; u++) {
ll uNoItem = u * (k + 1);
dist[uNoItem][uNoItem] = 0; // No item state
}
// Build edges
for (ll u = 0; u < n; u++) {
ll uNoItem = u * (k + 1);
// Buy transitions
for (ll j = 0; j < k; 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... |