oj.uz

답안 #52087

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
52087 2018-06-23T20:20:27 Z Angelos 여행하는 상인 (APIO17_merchant) C++14
21 / 100
 223 ms 5056 KB 
#include <iostream>
#include <cstring>
#define MAXN 103
#define MAXK 1003
const long long INF = 1e10;
using namespace std;
typedef long long ll;
int N , M , K , T[MAXN][MAXN] ;
long long profit[MAXN][MAXN] , adj[MAXN][MAXN] , B[MAXN][MAXN] , S[MAXN][MAXN] , dist[MAXN][MAXN];

bool check(int x){
    for(int i=1; i<=N; i++){
        for(int j=1; j<=N; j++){
            if(i == j || dist[i][j] == INF){adj[i][j] = -INF; continue;}
            adj[i][j] = (ll)profit[i][j] - (ll)dist[i][j]*x;
            adj[i][j] = max(-INF, adj[i][j]);
        }
    }



    for(int k=1; k<=N; k++)
        for(int i=1; i<=N; i++)
            for(int j=1; j<=N; j++){
                adj[i][j] = max(adj[i][j] , adj[i][k] + adj[k][j]);

                if(adj[i][i] >= 0) return true;
            }


    /*cout << endl;

    for(int i=1; i<=N; i++){
        for(int j=1; j<=N; j++)
            cout << adj[i][j] << " " ;
        cout << endl;
    }

    cout << endl;*/

    for(int k=1; k<=N; k++)
        for(int i=1; i<=N; i++)
            for(int j=1; j<=N; j++)
                if(adj[i][k] + adj[k][j] + adj[j][i] >= 0) return true;

    return false;
}

int main(){
    cin >> N >> M >> K;


    for(int i=1; i<=N; i++)
        for(int k=0; k<K; k++)  cin >> B[i][k] >> S[i][k];


    for(int i=0; i<=N; i++)
        for(int j=0; j<=N; j++) dist[i][j] = INF;

    for(int i=1; i<=N; i++)    dist[i][i] = 0;

    for(int i=0; i<M; i++){
        int u,v; cin >> u >> v;

        cin >> dist[u][v];
    }



    for(int k=1; k<=N; k++)
        for(int i=1; i<=N; i++)
            for(int j=1; j<=N; j++)
                    dist[i][j] = min(dist[i][j] , dist[i][k] + dist[k][j]);


    for(int i=1; i<=N; i++)
        for(int j=1; j<=N; j++){
            profit[i][j] = 0;
            for(int k=0; k<K; k++){
                if(B[i][k] == -1 || S[j][k] == -1) continue;
                profit[i][j] = max(profit[i][j] , S[j][k] - B[i][k]);
            }
        }


    /*for(int i=1; i<=N; i++){
        for(int j=1; j<=N; j++)
            cout << dist[i][j] << " " ;
        cout << endl;
    }*/

    long long low = 0 , high = 1e9 + 1 , ANS = 0;


    while(low <= high){
        ll mid = (low + high)/2;

        //cout << low << " " << mid << " " << high << endl;

        if(check(mid)) {ANS = max(ANS , mid); low = mid + 1;}
        else    high = mid - 1;
    }

    cout << ANS << endl;



    return 0;
}

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 155 ms 2040 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 2140 KB Output is correct
2 Correct 11 ms 2140 KB Output is correct
3 Correct 13 ms 2140 KB Output is correct
4 Correct 13 ms 2140 KB Output is correct
5 Correct 15 ms 2140 KB Output is correct
6 Correct 2 ms 2140 KB Output is correct
7 Correct 12 ms 2256 KB Output is correct
8 Correct 14 ms 2256 KB Output is correct
9 Correct 14 ms 2376 KB Output is correct
10 Correct 11 ms 2376 KB Output is correct
11 Correct 12 ms 2440 KB Output is correct
12 Correct 17 ms 2492 KB Output is correct
13 Correct 19 ms 2492 KB Output is correct
14 Correct 18 ms 2588 KB Output is correct
15 Correct 22 ms 2588 KB Output is correct
16 Correct 11 ms 2628 KB Output is correct
17 Correct 14 ms 2628 KB Output is correct
18 Correct 2 ms 2628 KB Output is correct
19 Correct 11 ms 2628 KB Output is correct
20 Correct 12 ms 2768 KB Output is correct
21 Correct 13 ms 2812 KB Output is correct
22 Correct 10 ms 2812 KB Output is correct
23 Correct 9 ms 2812 KB Output is correct
24 Correct 13 ms 2812 KB Output is correct
25 Correct 13 ms 2812 KB Output is correct
26 Correct 2 ms 2812 KB Output is correct
27 Correct 10 ms 2812 KB Output is correct
28 Correct 11 ms 2816 KB Output is correct
29 Correct 8 ms 2824 KB Output is correct
30 Correct 3 ms 2824 KB Output is correct
31 Correct 16 ms 2832 KB Output is correct

Subtask #3
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 92 ms 3252 KB Output is correct
2 Incorrect 223 ms 5056 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 2140 KB Output is correct
2 Correct 11 ms 2140 KB Output is correct
3 Correct 13 ms 2140 KB Output is correct
4 Correct 13 ms 2140 KB Output is correct
5 Correct 15 ms 2140 KB Output is correct
6 Correct 2 ms 2140 KB Output is correct
7 Correct 12 ms 2256 KB Output is correct
8 Correct 14 ms 2256 KB Output is correct
9 Correct 14 ms 2376 KB Output is correct
10 Correct 11 ms 2376 KB Output is correct
11 Correct 12 ms 2440 KB Output is correct
12 Correct 17 ms 2492 KB Output is correct
13 Correct 19 ms 2492 KB Output is correct
14 Correct 18 ms 2588 KB Output is correct
15 Correct 22 ms 2588 KB Output is correct
16 Correct 11 ms 2628 KB Output is correct
17 Correct 92 ms 3252 KB Output is correct
18 Incorrect 223 ms 5056 KB Output isn't correct
19 Halted 0 ms 0 KB -