제출 #545933

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
545933	2022-04-05 16:13:11	Monarchuwu	여행하는 상인 (APIO17_merchant)	C++17	33 / 100	109 ms	2948 KiB

merchant

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
using namespace std;
const int N = 100 + 2, M = 9900 + 4, K = 1000 + 3, inf = 1e9 + 7;
const ll inf2 = 2e18;
int n, m, k;
int b[N][K], s[N][K];
ll d[N][N];
int w[N][N];
void prep() {
    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= n; ++j)
            for (int kk = 0; kk < k; ++kk) if (~b[i][kk] && ~s[j][kk])
                w[i][j] = max(w[i][j], s[j][kk] - b[i][kk]);
    for (int kk = 1; kk <= n; ++kk)
        for (int i = 1; i <= n; ++i)
            for (int j = 1; j <= n; ++j) if (d[i][k] && d[k][j])
                d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
ll dist[N][N];
void maxi(ll &a, ll b) { if (a < b) a = b; }
bool check(ll x) {
    for (int i = 1; i <= n; ++i)
        for (int j = 1; j <= n; ++j)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 12
• Subtask 2: 0 / 21
• Subtask 3: 33 / 33
• Subtask 4: 0 / 34