oj.uz

답안 #393542

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
393542 2021-04-23T21:30:48 Z osaaateiasavtnl 여행하는 상인 (APIO17_merchant) C++14
100 / 100
 155 ms 4180 KB 
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <fstream>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define x first
#define y second
#define Time (double)clock()/CLOCKS_PER_SEC
#define debug(x) std::cerr << #x << ": " << x << '\n';
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define FORN(i, n) for (int i = 1; i <= n; ++i)
#define pb push_back
#define trav(a, x) for (auto& a : x)
using vi = vector<int>;
template <typename T>
std::istream& operator >>(std::istream& input, std::vector<T>& data)
{
    for (T& x : data)
        input >> x;
    return input;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const pair <T, T> & data)
{
    output << "(" << data.x << "," << data.y << ")";
    return output;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const std::vector<T>& data)
{
    for (const T& x : data)
        output << x << " ";
    return output;
}
ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down 
ll math_mod(ll a, ll b) { return a - b * div_down(a, b); }
#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>; 
tcT> void re(V<T>& x) { 
    trav(a, x)
        cin >> a;
}
tcT> bool ckmin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0; 
} // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0; 
}
ll gcd(ll a, ll b) {
    while (b) {
        tie(a, b) = mp(b, a % b);
    }
    return a;
}

const int N = 107, K = 1007, INF = 1e18;
int n, m, k;
int buy[N][K], sell[N][K];
int dist[N][N], earn[N][N];
int dp[N][N];

signed main() {
    #ifdef LOCAL
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    cin >> n >> m >> k;
    FOR (i, n) {
    	FOR (j, k) {
    		cin >> buy[i][j] >> sell[i][j];
    	}
    }
    FOR (i, n) FOR (j, n) dist[i][j] = INF;
    FOR (i, m) {
    	int u, v, c;
    	cin >> u >> v >> c;
    	u--; v--;
    	ckmin(dist[u][v], c);
    }
    FOR (k, n) {
    	FOR (u, n) {
    		FOR (v, n) {
    			ckmin(dist[u][v], dist[u][k] + dist[k][v]);
    		}
    	}
    }
    FOR (u, n) {
    	FOR (v, n) {
    		FOR (i, k) {
    			if (sell[v][i] != -1 && buy[u][i] != -1) {
    				ckmax(earn[u][v], sell[v][i] - buy[u][i]);
    			}
    		}
    	}
    }
    auto check = [&] (int w) {
    	FOR (u, n) {
    		FOR (v, n) {
    			if (dist[u][v] == INF) {
    				dp[u][v] = INF;
    			}
    			else {
    				dp[u][v] = dist[u][v] * w - earn[u][v];		
    			}
    		}
    	}
    	FOR (k, n) {
    		FOR (u, n) {
    			FOR (v, n) {
    				ckmin(dp[u][v], dp[u][k] + dp[k][v]);
    				if (dp[u][v] < -INF) {
    					return 1;
    				}
    			}
    		}
    	}
    	FOR (u, n) {
    		if (dp[u][u] <= 0) {
    			return 1;
    		}
    	}
    	return 0;
    };
    int l = 0, r = 1e9+7;
    while (l < r - 1) {
    	int m = (l + r) / 2;
    	if (check(m))
    		l = m;
    	else
    		r = m;
    }
    cout << l << endl;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 84 ms 1992 KB Output is correct
2 Correct 50 ms 1228 KB Output is correct
3 Correct 34 ms 1228 KB Output is correct
4 Correct 8 ms 840 KB Output is correct
5 Correct 8 ms 708 KB Output is correct
6 Correct 9 ms 716 KB Output is correct
7 Correct 9 ms 848 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 6 ms 716 KB Output is correct
10 Correct 8 ms 824 KB Output is correct
11 Correct 8 ms 716 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 8 ms 844 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 716 KB Output is correct
2 Correct 9 ms 848 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 6 ms 716 KB Output is correct
5 Correct 8 ms 824 KB Output is correct
6 Correct 8 ms 716 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 8 ms 844 KB Output is correct
9 Correct 9 ms 860 KB Output is correct
10 Correct 8 ms 844 KB Output is correct
11 Correct 9 ms 920 KB Output is correct
12 Correct 7 ms 848 KB Output is correct
13 Correct 14 ms 848 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 8 ms 844 KB Output is correct
16 Correct 10 ms 852 KB Output is correct
17 Correct 8 ms 844 KB Output is correct
18 Correct 9 ms 888 KB Output is correct
19 Correct 10 ms 844 KB Output is correct
20 Correct 10 ms 844 KB Output is correct
21 Correct 8 ms 848 KB Output is correct
22 Correct 9 ms 844 KB Output is correct
23 Correct 10 ms 968 KB Output is correct
24 Correct 8 ms 716 KB Output is correct
25 Correct 16 ms 936 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 20 ms 844 KB Output is correct
28 Correct 14 ms 952 KB Output is correct
29 Correct 14 ms 844 KB Output is correct
30 Correct 11 ms 864 KB Output is correct
31 Correct 10 ms 860 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 936 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 20 ms 844 KB Output is correct
4 Correct 14 ms 952 KB Output is correct
5 Correct 14 ms 844 KB Output is correct
6 Correct 11 ms 864 KB Output is correct
7 Correct 10 ms 860 KB Output is correct
8 Correct 101 ms 1524 KB Output is correct
9 Correct 155 ms 3912 KB Output is correct
10 Correct 96 ms 1520 KB Output is correct
11 Correct 118 ms 1748 KB Output is correct
12 Correct 112 ms 1740 KB Output is correct
13 Correct 81 ms 1508 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 860 KB Output is correct
2 Correct 8 ms 844 KB Output is correct
3 Correct 9 ms 920 KB Output is correct
4 Correct 7 ms 848 KB Output is correct
5 Correct 14 ms 848 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 8 ms 844 KB Output is correct
8 Correct 10 ms 852 KB Output is correct
9 Correct 8 ms 844 KB Output is correct
10 Correct 9 ms 888 KB Output is correct
11 Correct 10 ms 844 KB Output is correct
12 Correct 10 ms 844 KB Output is correct
13 Correct 8 ms 848 KB Output is correct
14 Correct 9 ms 844 KB Output is correct
15 Correct 10 ms 968 KB Output is correct
16 Correct 8 ms 716 KB Output is correct
17 Correct 101 ms 1524 KB Output is correct
18 Correct 155 ms 3912 KB Output is correct
19 Correct 96 ms 1520 KB Output is correct
20 Correct 118 ms 1748 KB Output is correct
21 Correct 112 ms 1740 KB Output is correct
22 Correct 81 ms 1508 KB Output is correct
23 Correct 16 ms 936 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 20 ms 844 KB Output is correct
26 Correct 14 ms 952 KB Output is correct
27 Correct 14 ms 844 KB Output is correct
28 Correct 11 ms 864 KB Output is correct
29 Correct 10 ms 860 KB Output is correct
30 Correct 84 ms 1992 KB Output is correct
31 Correct 50 ms 1228 KB Output is correct
32 Correct 34 ms 1228 KB Output is correct
33 Correct 8 ms 840 KB Output is correct
34 Correct 8 ms 708 KB Output is correct
35 Correct 9 ms 716 KB Output is correct
36 Correct 9 ms 848 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 6 ms 716 KB Output is correct
39 Correct 8 ms 824 KB Output is correct
40 Correct 8 ms 716 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 8 ms 844 KB Output is correct
43 Correct 56 ms 1356 KB Output is correct
44 Correct 54 ms 1616 KB Output is correct
45 Correct 83 ms 2596 KB Output is correct
46 Correct 52 ms 1588 KB Output is correct
47 Correct 53 ms 1612 KB Output is correct
48 Correct 53 ms 1612 KB Output is correct
49 Correct 117 ms 4084 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 51 ms 1228 KB Output is correct
53 Correct 69 ms 1344 KB Output is correct
54 Correct 52 ms 1356 KB Output is correct
55 Correct 51 ms 1356 KB Output is correct
56 Correct 52 ms 1316 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 11 ms 1040 KB Output is correct
59 Correct 11 ms 1100 KB Output is correct
60 Correct 10 ms 972 KB Output is correct
61 Correct 101 ms 4180 KB Output is correct
62 Correct 103 ms 4136 KB Output is correct
63 Correct 1 ms 332 KB Output is correct