# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
934222 | oblantis | Travelling Merchant (APIO17_merchant) | C++17 | 115 ms | 3032 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.
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define pb push_back
#define ss second
#define ff first
#define vt vector
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int inf = 2e9;
const int mod = 1e9+7;
const int maxn = 100 + 1;
int to[maxn][maxn];
void solve() {
int n, m, k;
cin >> n >> m >> k;
int b[n][k], s[n][k];
int p[n][n], dist[n][n];
vt<pii> g[n];
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++)p[i][j] = -1, dist[i][j] = inf;
for(int j = 0; j < k; j++){
cin >> b[i][j] >> s[i][j];
}
}
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
for(int o = 0; o < k; o++){
# | 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... |