oj.uz

답안 #334075

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
334075 2020-12-08T09:30:51 Z mohamedsobhi777 여행하는 상인 (APIO17_merchant) C++17
100 / 100
 102 ms 4332 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

#pragma GCC optimize("-Ofast")
//#pragma GCC optimize("trapv")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx2,tune=native")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-funroll-loops")

using namespace std;
using namespace __gnu_pbds;

#define vi vector<int>
#define vii vector<pair<int, int>>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define loop(_) for (int __ = 0; __ < (_); ++__)
#define forn(i, n) for (int i = 0; i < n; ++i)
#define pb push_back
#define f first
#define s second
#define sz(_) ((int)_.size())
#define all(_) _.begin(), _.end()
#define uni(_) unique(_)
#define lb lower_bound
#define ub upper_bound
#define si set<int>
#define ms multiset<int>
#define qi queue<int>
#define pq prioriry_queue<int>

using ll = long long;
using ld = long double;

const int N = 1e2 + 7;
const ll mod = 1e9 + 7;
const ll inf = 2e18;

auto ra = [] {char *p = new char ; delete p ; return ll(p) ; };
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count() * (ra() | 1));
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> os;

int n, m, k;
vector<pair<ll, ll>> mrs[N];
ll cost[N][N];
ll d[N][N];

ll g[N][N];

bool check(ll mid)
{
        for (int i = 0; i < n; ++i)
        {
                for (int j = 0; j < n; ++j)
                {
                        if (d[i][j] < 1e15)
                                g[i][j] = cost[i][j] - d[i][j] * mid;
                        else
                                g[i][j] = -1e15;
                }
        }
        for (int k = 0; k < n; ++k)
                for (int i = 0; i < n; ++i)
                        for (int j = 0; j < n; ++j)
                                g[i][j] = max(g[i][j], g[i][k] + g[k][j]);
        for (int i = 0; i < n; ++i)
                if (g[i][i] >= 0)
                        return 1;
        return 0;
}

int main()
{
        ios_base::sync_with_stdio(0);
        cin.tie(0);
        //freopen("in.in", "r", stdin);
        cin >> n >> m >> k;
        for (int i = 0; i < n; ++i)
        {
                for (int j = 0; j < k; ++j)
                {
                        pii v;
                        cin >> v.f >> v.s;
                        mrs[i].pb(v);
                }
        }
        for (int i = 0; i < n; ++i)
                fill(d[i], d[i] + N, 1e15);

        for (int i = 0; i < m; ++i)
        {
                int u, v, w;
                cin >> u >> v >> w;
                --u;
                --v;
                d[u][v] = min(d[u][v], 1ll * w);
        }

        for (int k = 0; k < n; ++k)
        {
                for (int i = 0; i < n; ++i)
                {
                        for (int j = 0; j < n; ++j)
                        {
                                d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
                        }
                }
        }
        
        for (int i = 0; i < n; ++i)
        {
                for (int j = 0; j < n; ++j)
                {
                        for (int r = 0; r < k; ++r)
                        {
                                if (~mrs[i][r].f && ~mrs[j][r].s && d[i][j]<1e15)
                                        cost[i][j] = max(cost[i][j], mrs[j][r].s - mrs[i][r].f);
                        }
                }
        }

        ll lo = 0, hi = 1e9;
        ll ans = 0;
        while (lo <= hi)
        {
                ll mid = (lo + hi) >> 1;
                if (check(mid))
                        lo = mid + 1, ans = mid;
                else
                        hi = mid - 1;
        }
        cout << ans;
        return 0;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 2156 KB Output is correct
2 Correct 35 ms 492 KB Output is correct
3 Correct 35 ms 492 KB Output is correct
4 Correct 6 ms 492 KB Output is correct
5 Correct 5 ms 492 KB Output is correct
6 Correct 5 ms 492 KB Output is correct
7 Correct 6 ms 492 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 6 ms 492 KB Output is correct
10 Correct 8 ms 492 KB Output is correct
11 Correct 5 ms 492 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 6 ms 492 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 492 KB Output is correct
2 Correct 7 ms 492 KB Output is correct
3 Correct 6 ms 492 KB Output is correct
4 Correct 7 ms 492 KB Output is correct
5 Correct 6 ms 620 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 5 ms 492 KB Output is correct
8 Correct 6 ms 492 KB Output is correct
9 Correct 6 ms 492 KB Output is correct
10 Correct 6 ms 492 KB Output is correct
11 Correct 7 ms 620 KB Output is correct
12 Correct 6 ms 620 KB Output is correct
13 Correct 6 ms 492 KB Output is correct
14 Correct 6 ms 492 KB Output is correct
15 Correct 7 ms 620 KB Output is correct
16 Correct 5 ms 492 KB Output is correct
17 Correct 6 ms 492 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 9 ms 620 KB Output is correct
20 Correct 7 ms 620 KB Output is correct
21 Correct 7 ms 620 KB Output is correct
22 Correct 6 ms 492 KB Output is correct
23 Correct 6 ms 492 KB Output is correct
24 Correct 5 ms 492 KB Output is correct
25 Correct 6 ms 492 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 6 ms 492 KB Output is correct
28 Correct 8 ms 492 KB Output is correct
29 Correct 5 ms 492 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 6 ms 492 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 748 KB Output is correct
2 Correct 97 ms 2156 KB Output is correct
3 Correct 38 ms 748 KB Output is correct
4 Correct 41 ms 800 KB Output is correct
5 Correct 43 ms 876 KB Output is correct
6 Correct 39 ms 748 KB Output is correct
7 Correct 6 ms 492 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 9 ms 620 KB Output is correct
10 Correct 7 ms 620 KB Output is correct
11 Correct 7 ms 620 KB Output is correct
12 Correct 6 ms 492 KB Output is correct
13 Correct 6 ms 492 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 492 KB Output is correct
2 Correct 7 ms 492 KB Output is correct
3 Correct 6 ms 492 KB Output is correct
4 Correct 7 ms 492 KB Output is correct
5 Correct 6 ms 620 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 5 ms 492 KB Output is correct
8 Correct 6 ms 492 KB Output is correct
9 Correct 6 ms 492 KB Output is correct
10 Correct 6 ms 492 KB Output is correct
11 Correct 7 ms 620 KB Output is correct
12 Correct 6 ms 620 KB Output is correct
13 Correct 6 ms 492 KB Output is correct
14 Correct 6 ms 492 KB Output is correct
15 Correct 7 ms 620 KB Output is correct
16 Correct 5 ms 492 KB Output is correct
17 Correct 41 ms 748 KB Output is correct
18 Correct 97 ms 2156 KB Output is correct
19 Correct 38 ms 748 KB Output is correct
20 Correct 41 ms 800 KB Output is correct
21 Correct 43 ms 876 KB Output is correct
22 Correct 39 ms 748 KB Output is correct
23 Correct 6 ms 492 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 9 ms 620 KB Output is correct
26 Correct 7 ms 620 KB Output is correct
27 Correct 7 ms 620 KB Output is correct
28 Correct 6 ms 492 KB Output is correct
29 Correct 6 ms 492 KB Output is correct
30 Correct 36 ms 620 KB Output is correct
31 Correct 40 ms 1004 KB Output is correct
32 Correct 60 ms 2796 KB Output is correct
33 Correct 38 ms 876 KB Output is correct
34 Correct 38 ms 1004 KB Output is correct
35 Correct 41 ms 1004 KB Output is correct
36 Correct 98 ms 4204 KB Output is correct
37 Correct 1 ms 512 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 36 ms 748 KB Output is correct
40 Correct 38 ms 748 KB Output is correct
41 Correct 37 ms 748 KB Output is correct
42 Correct 36 ms 620 KB Output is correct
43 Correct 37 ms 620 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 8 ms 620 KB Output is correct
46 Correct 8 ms 620 KB Output is correct
47 Correct 7 ms 620 KB Output is correct
48 Correct 100 ms 4332 KB Output is correct
49 Correct 102 ms 4204 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 64 ms 2156 KB Output is correct
52 Correct 35 ms 492 KB Output is correct
53 Correct 35 ms 492 KB Output is correct
54 Correct 6 ms 492 KB Output is correct
55 Correct 5 ms 492 KB Output is correct
56 Correct 5 ms 492 KB Output is correct
57 Correct 6 ms 492 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 6 ms 492 KB Output is correct
60 Correct 8 ms 492 KB Output is correct
61 Correct 5 ms 492 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 6 ms 492 KB Output is correct