oj.uz

답안 #779954

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
779954 2023-07-12T03:53:18 Z horiiseun 여행하는 상인 (APIO17_merchant) C++17
100 / 100
 74 ms 4188 KB 
#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <random>
#include <string>
#include <bitset>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
using namespace std;
 
#define ll long long
#define f first
#define s second
 
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
 
template<typename A> void __print(const A &x);
template<typename A, typename B> void __print(const pair<A, B> &p);
template<typename... A> void __print(const tuple<A...> &t);
template<typename T> void __print(stack<T> s);
template<typename T> void __print(queue<T> q);
template<typename T, typename... U> void __print(priority_queue<T, U...> q);
 
template<typename A> void __print(const A &x) {
    bool first = true;
    cerr << '{';
    for (const auto &i : x) {
        cerr << (first ? "" : ","), __print(i);
        first = false;
    }
    cerr << '}';
}
 
template<typename A, typename B> void __print(const pair<A, B> &p) {
    cerr << '(';
    __print(p.f);
    cerr << ',';
    __print(p.s);
    cerr << ')';
}
 
template<typename... A> void __print(const tuple<A...> &t) {
    bool first = true;
    cerr << '(';
    apply([&first] (const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t);
    cerr << ')';
}
 
template<typename T> void __print(stack<T> s) {
    vector<T> debugVector;
    while (!s.empty()) {
        T t = s.top();
        debugVector.push_back(t);
        s.pop();
    }
    reverse(debugVector.begin(), debugVector.end());
    __print(debugVector);
}
 
template<typename T> void __print(queue<T> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.front();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
 
template<typename T, typename... U> void __print(priority_queue<T, U...> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.top();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
 
void _print() { cerr << "]\n"; }
 
template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) {
    __print(H);
    if (sizeof...(T)) cerr << ", ";
    _print(T...);
}
 
#ifdef DEBUG
	#define D(...) cerr << "Line: " << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
    #define D(...)
#endif

int n, m, k;
ll b[105][1005], s[105][1005], t[105][105], p[105][105], g[105][105], lf, rh, md;

int main() {

    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> n >> m >> k;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= k; j++) {
            cin >> b[i][j] >> s[i][j];
        }
    }
    fill(&t[0][0], &t[0][0] + sizeof(t) / sizeof(t[0][0]), 1e18);
    for (int i = 0, a, x, c; i < m; i++) {
        cin >> a >> x >> c;
        t[a][x] = c;
    }

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            for (int a = 1; a <= n; a++) {
                t[j][a] = min(t[j][a], t[j][i] + t[i][a]);
            }
            for (int a = 1; a <= k; a++) {
                if (b[i][a] != -1 && s[j][a] != -1) {
                    p[i][j] = max(p[i][j], s[j][a] - b[i][a]);
                }
            }
        }
    }

    lf = 1, rh = 1e9;
    while (lf <= rh) {
        md = (lf + rh) / 2;
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                g[i][j] = md * min(t[i][j], (ll) 1e18 / md) - p[i][j];
            }
        }
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                for (int a = 1; a <= n; a++) {
                    g[j][a] = min(g[j][a], g[j][i] + g[i][a]);
                }
            }
        }
        bool good = false;
        for (int i = 1; i <= n; i++) {
            if (g[i][i] <= 0) {
                good = true;
            }
        }
        if (good) lf = md + 1;
        else rh = md - 1;
    }

    cout << rh << "\n";

}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 2004 KB Output is correct
2 Correct 27 ms 1236 KB Output is correct
3 Correct 27 ms 1304 KB Output is correct
4 Correct 4 ms 860 KB Output is correct
5 Correct 4 ms 852 KB Output is correct
6 Correct 4 ms 852 KB Output is correct
7 Correct 6 ms 852 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 4 ms 852 KB Output is correct
10 Correct 4 ms 852 KB Output is correct
11 Correct 4 ms 860 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 5 ms 904 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 852 KB Output is correct
2 Correct 6 ms 852 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 4 ms 852 KB Output is correct
5 Correct 4 ms 852 KB Output is correct
6 Correct 4 ms 860 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 5 ms 904 KB Output is correct
9 Correct 6 ms 852 KB Output is correct
10 Correct 4 ms 912 KB Output is correct
11 Correct 4 ms 852 KB Output is correct
12 Correct 5 ms 852 KB Output is correct
13 Correct 4 ms 852 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 4 ms 852 KB Output is correct
16 Correct 4 ms 852 KB Output is correct
17 Correct 4 ms 908 KB Output is correct
18 Correct 4 ms 916 KB Output is correct
19 Correct 4 ms 980 KB Output is correct
20 Correct 5 ms 984 KB Output is correct
21 Correct 4 ms 916 KB Output is correct
22 Correct 4 ms 852 KB Output is correct
23 Correct 6 ms 980 KB Output is correct
24 Correct 4 ms 852 KB Output is correct
25 Correct 4 ms 852 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 5 ms 852 KB Output is correct
28 Correct 5 ms 852 KB Output is correct
29 Correct 5 ms 852 KB Output is correct
30 Correct 4 ms 852 KB Output is correct
31 Correct 4 ms 852 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 852 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 5 ms 852 KB Output is correct
4 Correct 5 ms 852 KB Output is correct
5 Correct 5 ms 852 KB Output is correct
6 Correct 4 ms 852 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 30 ms 1492 KB Output is correct
9 Correct 50 ms 2084 KB Output is correct
10 Correct 28 ms 1448 KB Output is correct
11 Correct 30 ms 1424 KB Output is correct
12 Correct 31 ms 1492 KB Output is correct
13 Correct 35 ms 1364 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 852 KB Output is correct
2 Correct 4 ms 912 KB Output is correct
3 Correct 4 ms 852 KB Output is correct
4 Correct 5 ms 852 KB Output is correct
5 Correct 4 ms 852 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 4 ms 852 KB Output is correct
9 Correct 4 ms 908 KB Output is correct
10 Correct 4 ms 916 KB Output is correct
11 Correct 4 ms 980 KB Output is correct
12 Correct 5 ms 984 KB Output is correct
13 Correct 4 ms 916 KB Output is correct
14 Correct 4 ms 852 KB Output is correct
15 Correct 6 ms 980 KB Output is correct
16 Correct 4 ms 852 KB Output is correct
17 Correct 30 ms 1492 KB Output is correct
18 Correct 50 ms 2084 KB Output is correct
19 Correct 28 ms 1448 KB Output is correct
20 Correct 30 ms 1424 KB Output is correct
21 Correct 31 ms 1492 KB Output is correct
22 Correct 35 ms 1364 KB Output is correct
23 Correct 4 ms 852 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 5 ms 852 KB Output is correct
26 Correct 5 ms 852 KB Output is correct
27 Correct 5 ms 852 KB Output is correct
28 Correct 4 ms 852 KB Output is correct
29 Correct 4 ms 852 KB Output is correct
30 Correct 45 ms 2004 KB Output is correct
31 Correct 27 ms 1236 KB Output is correct
32 Correct 27 ms 1304 KB Output is correct
33 Correct 4 ms 860 KB Output is correct
34 Correct 4 ms 852 KB Output is correct
35 Correct 4 ms 852 KB Output is correct
36 Correct 6 ms 852 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 4 ms 852 KB Output is correct
39 Correct 4 ms 852 KB Output is correct
40 Correct 4 ms 860 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 5 ms 904 KB Output is correct
43 Correct 28 ms 1364 KB Output is correct
44 Correct 29 ms 1492 KB Output is correct
45 Correct 43 ms 2628 KB Output is correct
46 Correct 29 ms 1580 KB Output is correct
47 Correct 30 ms 1492 KB Output is correct
48 Correct 30 ms 1488 KB Output is correct
49 Correct 68 ms 3988 KB Output is correct
50 Correct 1 ms 468 KB Output is correct
51 Correct 1 ms 468 KB Output is correct
52 Correct 28 ms 1364 KB Output is correct
53 Correct 30 ms 1488 KB Output is correct
54 Correct 29 ms 1364 KB Output is correct
55 Correct 33 ms 1364 KB Output is correct
56 Correct 31 ms 1360 KB Output is correct
57 Correct 0 ms 340 KB Output is correct
58 Correct 5 ms 1072 KB Output is correct
59 Correct 5 ms 980 KB Output is correct
60 Correct 5 ms 976 KB Output is correct
61 Correct 54 ms 4096 KB Output is correct
62 Correct 74 ms 4188 KB Output is correct
63 Correct 1 ms 340 KB Output is correct