oj.uz

Submission #147869

# Submission time Handle Problem Language Result Execution time Memory
147869 2019-08-31T03:34:57 Z 12tqian Travelling Merchant (APIO17_merchant) C++14
100 / 100
 190 ms 4316 KB 
#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

const double PI = 4 * atan(1);

#define sz(x) (int)(x).size()
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define vi vector<int>
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define vpi vector<pair<int, int>>
#define vpd vector<pair<double, double>>
#define pd pair<double, double>

#define f0r(i,a) for(int i=0;i<a;i++)
#define f1r(i,a,b) for(int i=a;i<b;i++)
#define trav(a, x) for (auto& a : x)

void fast_io(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
}
void io(string taskname){
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char* FIN = fin.c_str();
    const char* FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
    fast_io();
}
const int MAXN = 1e2 + 5;
const int MAXK = 1e3 + 5;
const ll INF = 1e18;
ll buy[MAXN][MAXK];
ll sell[MAXN][MAXK];
ll dist[MAXN][MAXN];
ll weight[MAXN][MAXN];
ll floyd[MAXN][MAXN];
ll floyd2[MAXN][MAXN];
//ll graph[MAXN][MAXN];
int n, m, k;

int check(ll r){
    f0r(i, n){
        f0r(j, n){
            if(dist[i][j] == INF){
                floyd[i][j] = -INF;
                continue;
            }
            floyd[i][j] = (weight[i][j] - r*dist[i][j]);
          //  if(r == 3)cout << i + 1 << " " << j + 1 << " " << floyd[i][j] << endl;
           // cout << graph[i][j] << endl;
           floyd[i][j] = max(-INF, floyd[i][j]);
        }
        floyd[i][i] = -INF;
    }
    f0r(mid, n){
        f0r(i, n){
            f0r(j, n){
                floyd[i][j] = max(floyd[i][j], floyd[i][mid] + floyd[mid][j]);
                if(floyd[i][i]>= 0) return 1;
                floyd[i][j] = min(floyd[i][j], INF);
                floyd2[i][j] = floyd[i][j];
            }
        }
    }
    f0r(mid, n){
        f0r(i, n){
            f0r(j, n){
                floyd2[i][j] = max(floyd2[i][j], floyd2[i][mid] + floyd2[mid][j]);
                if(floyd2[i][j]>floyd[i][j]) return 1;
            }
        }
    }

    return 0;
}
int main(){
    fast_io();
    cin >> n >> m >> k;
    f0r(i, n){
        f0r(j, k){
            int b, s;
            cin >> b >> s;
            buy[i][j] = b;
            sell[i][j] = s;
        }
    }
    f0r(i, MAXN){
        f0r(j, MAXN){
            dist[i][j] = INF;
        }
    }
    f0r(i, m){
        int u, v;
        ll w;
        cin >> u >> v >> w;
        u--; v--;
        dist[u][v] = min(dist[u][v], w);
    }
    f0r(i, n) dist[i][i] = 0;
    f0r(mid, n){
        f0r(i, n){
            f0r(j, n){
                dist[i][j] = min(dist[i][j], dist[i][mid] + dist[mid][j]);
            }
        }
    }
    f0r(i, n){
        f0r(j, n){
            if(i == j) continue;
            f0r(it, k){
                if(sell[j][it] == -1 || buy[i][it] == -1) continue;
                weight[i][j] = max(weight[i][j], sell[j][it] - buy[i][it]);
            }
        }
    }
    ll lo = 0;
    ll hi = 1e10;
    while(abs(lo - hi)>1){
        ll mid = (lo + hi)/2;
        if(check(mid)){
            lo = mid;
        }
        else{
            hi = mid-1;
        }
    }
    if(lo>hi) swap(lo, hi);
    if(check(hi)) cout << hi << endl;
    else cout << lo << endl;
//    cout << check(3) << endl;
    return 0;
}

Compilation message

merchant.cpp:1:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/stack:200000000")
 
merchant.cpp: In function 'void io(std::__cxx11::string)':
merchant.cpp:47:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen(FIN, "r", stdin);
     ~~~~~~~^~~~~~~~~~~~~~~~~
merchant.cpp:48:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen(FOUT, "w", stdout);
     ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 159 ms 2424 KB Output is correct
2 Correct 127 ms 1400 KB Output is correct
3 Correct 94 ms 1400 KB Output is correct
4 Correct 17 ms 888 KB Output is correct
5 Correct 15 ms 888 KB Output is correct
6 Correct 19 ms 888 KB Output is correct
7 Correct 14 ms 1016 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 15 ms 888 KB Output is correct
10 Correct 14 ms 1016 KB Output is correct
11 Correct 14 ms 888 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 20 ms 1016 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 1016 KB Output is correct
2 Correct 15 ms 1016 KB Output is correct
3 Correct 19 ms 1076 KB Output is correct
4 Correct 17 ms 1016 KB Output is correct
5 Correct 19 ms 1016 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 16 ms 1016 KB Output is correct
8 Correct 18 ms 1016 KB Output is correct
9 Correct 12 ms 1016 KB Output is correct
10 Correct 15 ms 1016 KB Output is correct
11 Correct 18 ms 1016 KB Output is correct
12 Correct 16 ms 1016 KB Output is correct
13 Correct 15 ms 1016 KB Output is correct
14 Correct 17 ms 1016 KB Output is correct
15 Correct 18 ms 1144 KB Output is correct
16 Correct 17 ms 1016 KB Output is correct
17 Correct 18 ms 1016 KB Output is correct
18 Correct 2 ms 504 KB Output is correct
19 Correct 17 ms 1108 KB Output is correct
20 Correct 16 ms 1016 KB Output is correct
21 Correct 18 ms 1016 KB Output is correct
22 Correct 14 ms 1016 KB Output is correct
23 Correct 13 ms 1016 KB Output is correct
24 Correct 19 ms 888 KB Output is correct
25 Correct 14 ms 1016 KB Output is correct
26 Correct 2 ms 504 KB Output is correct
27 Correct 15 ms 888 KB Output is correct
28 Correct 14 ms 1016 KB Output is correct
29 Correct 14 ms 888 KB Output is correct
30 Correct 2 ms 504 KB Output is correct
31 Correct 20 ms 1016 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 1716 KB Output is correct
2 Correct 165 ms 3960 KB Output is correct
3 Correct 112 ms 1656 KB Output is correct
4 Correct 130 ms 1912 KB Output is correct
5 Correct 115 ms 2040 KB Output is correct
6 Correct 110 ms 1656 KB Output is correct
7 Correct 18 ms 1016 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 17 ms 1108 KB Output is correct
10 Correct 16 ms 1016 KB Output is correct
11 Correct 18 ms 1016 KB Output is correct
12 Correct 14 ms 1016 KB Output is correct
13 Correct 13 ms 1016 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 1016 KB Output is correct
2 Correct 15 ms 1016 KB Output is correct
3 Correct 19 ms 1076 KB Output is correct
4 Correct 17 ms 1016 KB Output is correct
5 Correct 19 ms 1016 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 16 ms 1016 KB Output is correct
8 Correct 18 ms 1016 KB Output is correct
9 Correct 12 ms 1016 KB Output is correct
10 Correct 15 ms 1016 KB Output is correct
11 Correct 18 ms 1016 KB Output is correct
12 Correct 16 ms 1016 KB Output is correct
13 Correct 15 ms 1016 KB Output is correct
14 Correct 17 ms 1016 KB Output is correct
15 Correct 18 ms 1144 KB Output is correct
16 Correct 17 ms 1016 KB Output is correct
17 Correct 121 ms 1716 KB Output is correct
18 Correct 165 ms 3960 KB Output is correct
19 Correct 112 ms 1656 KB Output is correct
20 Correct 130 ms 1912 KB Output is correct
21 Correct 115 ms 2040 KB Output is correct
22 Correct 110 ms 1656 KB Output is correct
23 Correct 18 ms 1016 KB Output is correct
24 Correct 2 ms 504 KB Output is correct
25 Correct 17 ms 1108 KB Output is correct
26 Correct 16 ms 1016 KB Output is correct
27 Correct 18 ms 1016 KB Output is correct
28 Correct 14 ms 1016 KB Output is correct
29 Correct 13 ms 1016 KB Output is correct
30 Correct 110 ms 1656 KB Output is correct
31 Correct 109 ms 1796 KB Output is correct
32 Correct 126 ms 2780 KB Output is correct
33 Correct 122 ms 1784 KB Output is correct
34 Correct 120 ms 1784 KB Output is correct
35 Correct 123 ms 1784 KB Output is correct
36 Correct 188 ms 4216 KB Output is correct
37 Correct 2 ms 504 KB Output is correct
38 Correct 2 ms 504 KB Output is correct
39 Correct 122 ms 1520 KB Output is correct
40 Correct 123 ms 1528 KB Output is correct
41 Correct 126 ms 1624 KB Output is correct
42 Correct 111 ms 1528 KB Output is correct
43 Correct 114 ms 1400 KB Output is correct
44 Correct 2 ms 508 KB Output is correct
45 Correct 20 ms 1148 KB Output is correct
46 Correct 20 ms 1144 KB Output is correct
47 Correct 19 ms 1144 KB Output is correct
48 Correct 190 ms 4316 KB Output is correct
49 Correct 178 ms 4276 KB Output is correct
50 Correct 2 ms 504 KB Output is correct
51 Correct 159 ms 2424 KB Output is correct
52 Correct 127 ms 1400 KB Output is correct
53 Correct 94 ms 1400 KB Output is correct
54 Correct 17 ms 888 KB Output is correct
55 Correct 15 ms 888 KB Output is correct
56 Correct 19 ms 888 KB Output is correct
57 Correct 14 ms 1016 KB Output is correct
58 Correct 2 ms 504 KB Output is correct
59 Correct 15 ms 888 KB Output is correct
60 Correct 14 ms 1016 KB Output is correct
61 Correct 14 ms 888 KB Output is correct
62 Correct 2 ms 504 KB Output is correct
63 Correct 20 ms 1016 KB Output is correct