oj.uz

답안 #403343

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
403343 2021-05-13T04:57:13 Z Haruto810198 여행하는 상인 (APIO17_merchant) C++17
100 / 100
 112 ms 4240 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define double long double

#define FOR(i,l,r,d) for(int i=(l);i<=(r);i+=(d))
#define szof(x) ((x).size())

#define vi vector<int>
#define pii pair<int,int>

#define F first
#define S second

#define pb push_back
#define eb emplace_back
#define mkp make_pair

const int INF = 1e18;
const int MOD = 1000000007;
const int mod = 998244353;
const double eps = 1e-12;

//#pragma GCC optimize("Ofast")

const int NMAX = 101;
const int MMAX = 9901;
const int CMAX = 1001;
/// c = n. of items

int n, m, c;
int buy[NMAX][CMAX], sell[NMAX][CMAX];
/// buy[i][j] : buy item j at market i

int dt[NMAX][NMAX], profit[NMAX][NMAX], weight[NMAX][NMAX];
int sp[NMAX][NMAX];

int res;

bool has_non_pos_cyc(int T){

    /// check if the graph has a non-positive cycle

    /// init
    FOR(i,1,n,1){
        FOR(j,1,n,1){
            sp[i][j] = weight[i][j];
        }
    }

    /// shortest path
    FOR(k,1,n,1){
        FOR(i,1,n,1){
            FOR(j,1,n,1){
                sp[i][j] = min(sp[i][j], sp[i][k] + sp[k][j]);
                if(sp[i][j]<-INF){ /// prevent overflow
                    return 1;
                }
            }
        }
    }

    /// check if cycle(i->j->i)<=0 for all i!=j
    FOR(i,1,n,1){
        FOR(j,1,n,1){
            if(i!=j and sp[i][j]+sp[j][i]<=0){
                return 1;
            }
        }
    }

    return 0;

}

bool check(int T){

    /// check if new graph has a non-negative cycle
    /// negate all edges -> check if the graph has a non-positive cycle
    FOR(i,1,n,1){
        FOR(j,1,n,1){
            if(dt[i][j]!=INF){
                weight[i][j] = -profit[i][j] + T*dt[i][j];
            }
            else{
                weight[i][j] = INF;
            }
        }
    }

    return (has_non_pos_cyc(T));

}

signed main(){

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

    /// input
    cin>>n>>m>>c;

    FOR(i,1,n,1){
        FOR(j,1,c,1){
            cin>>buy[i][j]>>sell[i][j];
        }
    }

    /// dt, profit

    FOR(i,1,n,1){
        FOR(j,1,n,1){
            dt[i][j] = INF; /// dt = INF : no edge
        }
        dt[i][i] = 0;
    }

    FOR(i,1,m,1){
        int u, v, w;
        cin>>u>>v>>w;
        dt[u][v] = w;
    }

    FOR(k,1,n,1){
        FOR(i,1,n,1){
            FOR(j,1,n,1){
                dt[i][j] = min(dt[i][j], dt[i][k] + dt[k][j]);
            }
        }
    }

    FOR(i,1,n,1){
        FOR(j,1,n,1){
            profit[i][j] = 0;
            FOR(k,1,c,1){
                if(buy[i][k]!=-1 and sell[j][k]!=-1){
                    profit[i][j] = max(profit[i][j], -buy[i][k] + sell[j][k]);
                }
            }
        }
        profit[i][i] = 0;
    }

    /// BS for the answer
    int L=0, R=1e9+1, mid;
    while(L<R){
        mid = (L+R+1) / 2;
        if(check(mid)){
            L = mid;
        }
        else{
            R = mid-1;
        }
    }

    res = L;

    cout<<res<<'\n';

    return 0;

}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 72 ms 2280 KB Output is correct
2 Correct 43 ms 1356 KB Output is correct
3 Correct 29 ms 1440 KB Output is correct
4 Correct 7 ms 844 KB Output is correct
5 Correct 7 ms 844 KB Output is correct
6 Correct 7 ms 844 KB Output is correct
7 Correct 8 ms 932 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 6 ms 844 KB Output is correct
10 Correct 7 ms 900 KB Output is correct
11 Correct 8 ms 900 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 8 ms 936 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 844 KB Output is correct
2 Correct 8 ms 932 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 6 ms 844 KB Output is correct
5 Correct 7 ms 900 KB Output is correct
6 Correct 8 ms 900 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 8 ms 936 KB Output is correct
9 Correct 7 ms 844 KB Output is correct
10 Correct 7 ms 844 KB Output is correct
11 Correct 9 ms 956 KB Output is correct
12 Correct 7 ms 844 KB Output is correct
13 Correct 10 ms 916 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 7 ms 844 KB Output is correct
16 Correct 8 ms 844 KB Output is correct
17 Correct 7 ms 844 KB Output is correct
18 Correct 8 ms 844 KB Output is correct
19 Correct 8 ms 1032 KB Output is correct
20 Correct 8 ms 912 KB Output is correct
21 Correct 8 ms 844 KB Output is correct
22 Correct 8 ms 844 KB Output is correct
23 Correct 9 ms 972 KB Output is correct
24 Correct 7 ms 844 KB Output is correct
25 Correct 8 ms 972 KB Output is correct
26 Correct 1 ms 320 KB Output is correct
27 Correct 8 ms 972 KB Output is correct
28 Correct 9 ms 940 KB Output is correct
29 Correct 8 ms 984 KB Output is correct
30 Correct 8 ms 844 KB Output is correct
31 Correct 7 ms 828 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 972 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 8 ms 972 KB Output is correct
4 Correct 9 ms 940 KB Output is correct
5 Correct 8 ms 984 KB Output is correct
6 Correct 8 ms 844 KB Output is correct
7 Correct 7 ms 828 KB Output is correct
8 Correct 46 ms 1708 KB Output is correct
9 Correct 99 ms 2244 KB Output is correct
10 Correct 49 ms 1568 KB Output is correct
11 Correct 51 ms 1736 KB Output is correct
12 Correct 51 ms 1792 KB Output is correct
13 Correct 46 ms 1604 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 844 KB Output is correct
2 Correct 7 ms 844 KB Output is correct
3 Correct 9 ms 956 KB Output is correct
4 Correct 7 ms 844 KB Output is correct
5 Correct 10 ms 916 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 7 ms 844 KB Output is correct
8 Correct 8 ms 844 KB Output is correct
9 Correct 7 ms 844 KB Output is correct
10 Correct 8 ms 844 KB Output is correct
11 Correct 8 ms 1032 KB Output is correct
12 Correct 8 ms 912 KB Output is correct
13 Correct 8 ms 844 KB Output is correct
14 Correct 8 ms 844 KB Output is correct
15 Correct 9 ms 972 KB Output is correct
16 Correct 7 ms 844 KB Output is correct
17 Correct 46 ms 1708 KB Output is correct
18 Correct 99 ms 2244 KB Output is correct
19 Correct 49 ms 1568 KB Output is correct
20 Correct 51 ms 1736 KB Output is correct
21 Correct 51 ms 1792 KB Output is correct
22 Correct 46 ms 1604 KB Output is correct
23 Correct 8 ms 972 KB Output is correct
24 Correct 1 ms 320 KB Output is correct
25 Correct 8 ms 972 KB Output is correct
26 Correct 9 ms 940 KB Output is correct
27 Correct 8 ms 984 KB Output is correct
28 Correct 8 ms 844 KB Output is correct
29 Correct 7 ms 828 KB Output is correct
30 Correct 72 ms 2280 KB Output is correct
31 Correct 43 ms 1356 KB Output is correct
32 Correct 29 ms 1440 KB Output is correct
33 Correct 7 ms 844 KB Output is correct
34 Correct 7 ms 844 KB Output is correct
35 Correct 7 ms 844 KB Output is correct
36 Correct 8 ms 932 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 6 ms 844 KB Output is correct
39 Correct 7 ms 900 KB Output is correct
40 Correct 8 ms 900 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 8 ms 936 KB Output is correct
43 Correct 44 ms 1480 KB Output is correct
44 Correct 43 ms 1612 KB Output is correct
45 Correct 72 ms 2628 KB Output is correct
46 Correct 48 ms 1640 KB Output is correct
47 Correct 45 ms 1612 KB Output is correct
48 Correct 48 ms 1612 KB Output is correct
49 Correct 107 ms 4036 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 43 ms 1456 KB Output is correct
53 Correct 48 ms 1468 KB Output is correct
54 Correct 44 ms 1484 KB Output is correct
55 Correct 43 ms 1484 KB Output is correct
56 Correct 45 ms 1456 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 9 ms 1076 KB Output is correct
59 Correct 9 ms 1024 KB Output is correct
60 Correct 10 ms 972 KB Output is correct
61 Correct 109 ms 4164 KB Output is correct
62 Correct 112 ms 4240 KB Output is correct
63 Correct 1 ms 316 KB Output is correct