oj.uz

Submission #499996

# Submission time Handle Problem Language Result Execution time Memory
499996 2021-12-30T08:43:00 Z Karliver Travelling Merchant (APIO17_merchant) C++17
12 / 100
 15 ms 1100 KB 
    
#include <bits/stdc++.h>

#define FIXED_FLOAT(x)  std::fixed <<std::setprecision(20) << (x)
#define all(v) (v).begin(), (v).end()
using namespace  std;
#define forn(i,n) for (int i = 0; i < (n); ++i)
#define rforn(i, n) for(int i = (n) - 1;i >= 0;--i)
#define sz(x) (int)x.size()
#define ff first
#define se second
#define mp make_pair
using ll = long long;
int mod = (ll)1e9 + 7;
const int INF = 1e9 + 1;
const int N = 2e5 + 100;
const double eps = 1e-7;

template <class T> using V = vector<T>;  
template <class T> using VV = V<V<T>>;  
template<class T, size_t SZ> using AR = array<T, SZ>;
template<class T> using PR = pair<T, T>;
template <typename XPAX>
bool ckma(XPAX &x, XPAX y) {
    return (x < y ? x = y, 1 : 0);
}
template <typename XPAX>
bool ckmi(XPAX &x, XPAX y) {
    return (x > y ? x = y, 1 : 0);
}
const ll inf = (ll)1e17;
ll dis[101][101];
V<PR<int>> g[101];
int n, m, k;
void calc_dis(int x) {
    priority_queue<pair<ll,int>> q;
    q.push({0, x});
    forn(i, n)dis[x][i] = inf;
    dis[x][x] = 0;
    while(sz(q)) {
        auto [s, v] = q.top();
        s = -s;
        q.pop();
        if(s != dis[x][v])continue;
        for(auto [c,w] : g[v]) {
            if(s + w < dis[x][c]) {
                dis[x][c] = s+w;
                q.push({-dis[x][c], c});
            }
        }
    }
}
void solve() {


    
    
    cin >> n >> m >> k;

    VV<int> b(n,V<int>(k));
    auto s =b;
    forn(i, n) forn(j, k) {
        cin >> b[i][j] >> s[i][j];
    }
    forn(i, m) {
        int a, b, c;
        cin >> a >> b >> c;
        --a;--b;
        g[a].emplace_back(b,c);
    }

    forn(i, n) calc_dis(i);
    ll ret = 0;
    for(int i = 1;i < n;++i) for(int j = 0;j < k;++j) {
        if(b[0][j] == -1 || s[i][j] == -1)continue;
        ckma(ret, 1ll*(s[i][j]-b[0][j])/(dis[0][i]+dis[i][0]));
    }
    cout << ret << '\n';



}
void test_case() {
    int t;
    cin >> t;
    forn(p, t) {

        //cout << "Case #" << p + 1 << ": ";
        solve();
    }
}
int main() {

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

    solve();

}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 1100 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 376 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 332 KB Output is correct

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 376 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Incorrect 1 ms 332 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 460 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -