oj.uz

Submission #239104

# Submission time Handle Problem Language Result Execution time Memory
239104 2020-06-14T11:54:02 Z urd05 Travelling Merchant (APIO17_merchant) C++14
0 / 100
 31 ms 1152 KB 
#include <bits/stdc++.h>
using namespace std;

int buy[100][1000];
int sell[100][1000];
typedef pair<int,int> P;
vector<P> adj[100];
vector<P> rev[100];
long long dist[100];
long long rist[100];
const long long INF=1e15;

int main(void) {
    int n,m,k;
    scanf("%d %d %d",&n,&m,&k);
    for(int i=0;i<n;i++) {
        dist[i]=INF;
        rist[i]=INF;
        for(int j=0;j<k;j++) {
            scanf("%d %d",&buy[i][j],&sell[i][j]);
        }
    }
    for(int i=0;i<m;i++) {
        int u,v,w;
        scanf("%d %d %d",&u,&v,&w);
        u--;
        v--;
        adj[u].push_back(P(v,w));
        rev[v].push_back(P(u,w));
    }
    for(int i=0;i<adj[0].size();i++) {
        int nt=adj[0][i].first;
        dist[nt]=adj[0][i].second;
    }
    for(int i=0;i<n;i++) {
        for(int j=0;j<n;j++) {
            for(int k=0;k<adj[j].size();k++) {
                int nt=adj[j][k].first;
                dist[nt]=min(dist[nt],dist[j]+adj[j][k].second);
            }
        }
    }
    rist[0]=0;
    for(int i=0;i<n;i++) {
        for(int j=0;j<n;j++) {
            for(int k=0;k<adj[j].size();k++) {
                int nt=adj[j][k].first;
                dist[nt]=min(dist[nt],dist[j]+adj[j][k].second);
            }
        }
    }
    long long ret=0;
    for(int i=0;i<n;i++) {
        for(int j=0;j<k;j++) {
            if (sell[i][j]!=-1&&buy[0][j]!=-1)
                ret=max(ret,(sell[i][j]-buy[0][j])/(rist[i]+dist[i]));
        }
    }
    printf("%lld",ret);
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:31:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<adj[0].size();i++) {
                 ~^~~~~~~~~~~~~~
merchant.cpp:37:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int k=0;k<adj[j].size();k++) {
                         ~^~~~~~~~~~~~~~
merchant.cpp:46:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int k=0;k<adj[j].size();k++) {
                         ~^~~~~~~~~~~~~~
merchant.cpp:15: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:20:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d %d",&buy[i][j],&sell[i][j]);
             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:25:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d",&u,&v,&w);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 12.0

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

Subtask #2
0 / 21.0

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

Subtask #3
0 / 33.0

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

Subtask #4
0 / 34.0

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