oj.uz

Submission #101119

# Submission time Handle Problem Language Result Execution time Memory
101119 2019-03-16T17:20:23 Z ae04071 Travelling Merchant (APIO17_merchant) C++11
12 / 100
 54 ms 3068 KB 
#include <bits/stdc++.h>
using namespace std;
using lli=long long;

int n,m,k;
lli adj[101][101], car[101][101], dist[100];
int s[100][1000],b[100][1000];

bool check(int C, bool f=false) {
    fill(dist, dist+n, 0);
    for(int t=0;t<n;t++) {
        int chg=0;
        for(int i=0;i<n;i++) for(int j=0;j<n;j++) if(adj[i][j]) {
            if(dist[j] > dist[i] + C*adj[i][j] - car[i][j]) {
                chg=1;
                dist[j] = dist[i] + C*adj[i][j] - car[i][j];
            }
        }
        if(!chg) break;
        if(t==n-1) return true;
    }
    if(f) {
        for(int i=0;i<n;i++)for(int j=0;j<n;j++) if(adj[i][j] && adj[j][i]){ 
            if(dist[i] + C*(adj[i][j]+adj[j][i]) - (car[i][j]+car[j][i]) == 0) return true;
        }
        return false;
    } else return false;
}
int main() {
    scanf("%d%d%d",&n,&m,&k);
    for(int i=0;i<n;i++) {
        for(int j=0;j<k;j++) scanf("%d%d",&b[i][j], &s[i][j]);
    }
    for(int i=0;i<m;i++) {
        int a,b;
        lli c;
        scanf("%d%d%lld",&a,&b,&c);
        a--;b--; adj[a][b] = c;
    }

    for(int k=0;k<n;k++) for(int i=0;i<n;i++) for(int j=0;j<n;j++) {
        if(adj[i][k] && adj[k][j] && (!adj[i][j] || adj[i][j] > adj[i][k]+adj[k][j])) {
            adj[i][j] = adj[i][k]+adj[k][j];
        }
    }
    
    for(int i=0;i<n;i++)for(int j=0;j<n;j++) if(adj[i][j]) {
        int ad=0;
        for(int t=0;t<k;t++) if(s[j][t]!=-1 && b[i][t]!=-1) {
            ad=max(ad,s[j][t]-b[i][t]);
        }
        car[i][j] = ad;
    }

    int lo=-1,up=1000000000;
    while(up-lo>1) {
        int md=(lo+up)>>1;
        if(check(md)) lo=md;
        else up=md;
    }
    if(check(lo+1, true)) lo++;
    printf("%d\n",lo);
    
    return 0;
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:30:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d",&n,&m,&k);
     ~~~~~^~~~~~~~~~~~~~~~~~~
merchant.cpp:32:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         for(int j=0;j<k;j++) scanf("%d%d",&b[i][j], &s[i][j]);
                              ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:37:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%lld",&a,&b,&c);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 2424 KB Output is correct
2 Correct 6 ms 1152 KB Output is correct
3 Correct 24 ms 1280 KB Output is correct
4 Correct 3 ms 768 KB Output is correct
5 Correct 4 ms 768 KB Output is correct
6 Correct 4 ms 768 KB Output is correct
7 Correct 6 ms 768 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 6 ms 768 KB Output is correct
10 Correct 7 ms 768 KB Output is correct
11 Correct 5 ms 768 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 4 ms 768 KB Output is correct

Subtask #2
0 / 21.0

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

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 1300 KB Output is correct
2 Correct 54 ms 3068 KB Output is correct
3 Correct 24 ms 1280 KB Output is correct
4 Correct 16 ms 1408 KB Output is correct
5 Incorrect 51 ms 1528 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 34.0

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