oj.uz

Submission #95785

# Submission time Handle Problem Language Result Execution time Memory
95785 2019-02-02T14:58:44 Z Bodo171 Travelling Merchant (APIO17_merchant) C++14
100 / 100
 87 ms 4344 KB 
#include <iostream>
#include <fstream>
#include <queue>
#include <climits>
#define mp make_pair
using namespace std;
const int nmax=105;
const int kmax=1005;
queue< int > q;
vector<int> v[nmax];
long long cost[nmax][nmax],wn[nmax][nmax],cc[nmax][nmax];
long long d[nmax],prof[nmax][kmax],pret[nmax][kmax];
int viz[nmax],inq[nmax];
int n,k,m,nod,item,nxt,i,j,a,b,c,ind;
long long p,ans;
bool check(long long x)
{
    while(!q.empty()) q.pop();
    q.push(0);
    for(int i=0;i<=n;i++)
           viz[i]=inq[i]=0;
    for(int i=1;i<=n;i++)
          d[i]=LLONG_MIN;
    while(!q.empty())
    {
        nod=q.front();inq[nod]=0;
        q.pop();
        viz[nod]++;
        if(viz[nod]>=n+2) return 1;
        for(int nxt=1;nxt<=n;nxt++)
            if(nxt!=nod&&cost[nod][nxt]<=1LL*1000*1000*1000)
        {
            if(d[nod]+wn[nod][nxt]-1LL*x*cost[nod][nxt]>=d[nxt])
            {
                if(!inq[nxt])
                {
                    q.push(nxt);
                    inq[nxt]=1;
                }
                d[nxt]=d[nod]+wn[nod][nxt]-1LL*x*cost[nod][nxt];
            }
        }
    }
    return 0;
}
void bf(int s)
{
    q.push(s);
    while(!q.empty())
    {
        nod=q.front();q.pop();
        for(i=0;i<v[nod].size();i++)
        {
            nxt=v[nod][i];
            if(cost[s][nod]+cc[nod][nxt]<cost[s][nxt])
            {
                cost[s][nxt]=cost[s][nod]+cc[nod][nxt];
                q.push(nxt);
            }
        }
    }
}
int main()
{
    //freopen("data.in","r",stdin);
    ios_base::sync_with_stdio(false);
    cin>>n>>m>>k;
    for(i=1;i<=n;i++)
    {
        pret[i][0]=-1,prof[i][0]=-1;
        for(j=1;j<=k;j++)
        {
            cin>>pret[i][j];
            cin>>prof[i][j];
        }
    }
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
          for(ind=1;ind<=k;ind++)
             if(pret[i][ind]!=-1&&prof[j][ind]!=-1)
                wn[i][j]=max(wn[i][j],prof[j][ind]-pret[i][ind]);
    for(i=1;i<=k;i++)
        pret[0][i]=prof[0][i]=-1;
    for(i=1; i<=n; i++)
        for(j=1; j<=n; j++)
            if(i!=j)
                cost[i][j]=1LL*1e16;
    for(i=1; i<=m; i++)
    {
        cin>>a>>b>>c;
        cc[a][b]=c;
        v[a].push_back(b);
    }
    int kt;
    for(int s=1;s<=n;s++)
        bf(s);
    for(p=30; p>=0; p--)
        if(check(ans+(1LL<<p)))
            ans+=(1LL<<p);
    cout<<ans;
    return 0;
}

Compilation message

merchant.cpp: In function 'void bf(int)':
merchant.cpp:52:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(i=0;i<v[nod].size();i++)
                 ~^~~~~~~~~~~~~~
merchant.cpp: In function 'int main()':
merchant.cpp:94:9: warning: unused variable 'kt' [-Wunused-variable]
     int kt;
         ^~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 2168 KB Output is correct
2 Correct 6 ms 1272 KB Output is correct
3 Correct 81 ms 1400 KB Output is correct
4 Correct 4 ms 888 KB Output is correct
5 Correct 3 ms 888 KB Output is correct
6 Correct 2 ms 888 KB Output is correct
7 Correct 9 ms 888 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 11 ms 888 KB Output is correct
10 Correct 4 ms 932 KB Output is correct
11 Correct 7 ms 888 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 3 ms 888 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 888 KB Output is correct
2 Correct 4 ms 888 KB Output is correct
3 Correct 6 ms 888 KB Output is correct
4 Correct 5 ms 888 KB Output is correct
5 Correct 8 ms 1016 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 4 ms 888 KB Output is correct
8 Correct 3 ms 888 KB Output is correct
9 Correct 3 ms 888 KB Output is correct
10 Correct 5 ms 888 KB Output is correct
11 Correct 7 ms 888 KB Output is correct
12 Correct 9 ms 888 KB Output is correct
13 Correct 8 ms 888 KB Output is correct
14 Correct 5 ms 888 KB Output is correct
15 Correct 8 ms 888 KB Output is correct
16 Correct 5 ms 888 KB Output is correct
17 Correct 6 ms 888 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 13 ms 888 KB Output is correct
20 Correct 8 ms 1016 KB Output is correct
21 Correct 8 ms 888 KB Output is correct
22 Correct 6 ms 888 KB Output is correct
23 Correct 5 ms 888 KB Output is correct
24 Correct 2 ms 888 KB Output is correct
25 Correct 9 ms 888 KB Output is correct
26 Correct 2 ms 380 KB Output is correct
27 Correct 11 ms 888 KB Output is correct
28 Correct 4 ms 932 KB Output is correct
29 Correct 7 ms 888 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 3 ms 888 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 1616 KB Output is correct
2 Correct 87 ms 2296 KB Output is correct
3 Correct 44 ms 1400 KB Output is correct
4 Correct 18 ms 1656 KB Output is correct
5 Correct 72 ms 1528 KB Output is correct
6 Correct 30 ms 1524 KB Output is correct
7 Correct 6 ms 888 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 13 ms 888 KB Output is correct
10 Correct 8 ms 1016 KB Output is correct
11 Correct 8 ms 888 KB Output is correct
12 Correct 6 ms 888 KB Output is correct
13 Correct 5 ms 888 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 888 KB Output is correct
2 Correct 4 ms 888 KB Output is correct
3 Correct 6 ms 888 KB Output is correct
4 Correct 5 ms 888 KB Output is correct
5 Correct 8 ms 1016 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 4 ms 888 KB Output is correct
8 Correct 3 ms 888 KB Output is correct
9 Correct 3 ms 888 KB Output is correct
10 Correct 5 ms 888 KB Output is correct
11 Correct 7 ms 888 KB Output is correct
12 Correct 9 ms 888 KB Output is correct
13 Correct 8 ms 888 KB Output is correct
14 Correct 5 ms 888 KB Output is correct
15 Correct 8 ms 888 KB Output is correct
16 Correct 5 ms 888 KB Output is correct
17 Correct 31 ms 1616 KB Output is correct
18 Correct 87 ms 2296 KB Output is correct
19 Correct 44 ms 1400 KB Output is correct
20 Correct 18 ms 1656 KB Output is correct
21 Correct 72 ms 1528 KB Output is correct
22 Correct 30 ms 1524 KB Output is correct
23 Correct 6 ms 888 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 13 ms 888 KB Output is correct
26 Correct 8 ms 1016 KB Output is correct
27 Correct 8 ms 888 KB Output is correct
28 Correct 6 ms 888 KB Output is correct
29 Correct 5 ms 888 KB Output is correct
30 Correct 24 ms 1400 KB Output is correct
31 Correct 38 ms 1528 KB Output is correct
32 Correct 36 ms 2168 KB Output is correct
33 Correct 34 ms 1528 KB Output is correct
34 Correct 35 ms 1528 KB Output is correct
35 Correct 32 ms 1528 KB Output is correct
36 Correct 60 ms 2168 KB Output is correct
37 Correct 2 ms 504 KB Output is correct
38 Correct 2 ms 504 KB Output is correct
39 Correct 20 ms 1528 KB Output is correct
40 Correct 19 ms 1656 KB Output is correct
41 Correct 10 ms 1528 KB Output is correct
42 Correct 35 ms 1400 KB Output is correct
43 Correct 29 ms 1532 KB Output is correct
44 Correct 2 ms 376 KB Output is correct
45 Correct 7 ms 1144 KB Output is correct
46 Correct 6 ms 1144 KB Output is correct
47 Correct 5 ms 1144 KB Output is correct
48 Correct 80 ms 4344 KB Output is correct
49 Correct 83 ms 4344 KB Output is correct
50 Correct 2 ms 404 KB Output is correct
51 Correct 46 ms 2168 KB Output is correct
52 Correct 6 ms 1272 KB Output is correct
53 Correct 81 ms 1400 KB Output is correct
54 Correct 4 ms 888 KB Output is correct
55 Correct 3 ms 888 KB Output is correct
56 Correct 2 ms 888 KB Output is correct
57 Correct 9 ms 888 KB Output is correct
58 Correct 2 ms 380 KB Output is correct
59 Correct 11 ms 888 KB Output is correct
60 Correct 4 ms 932 KB Output is correct
61 Correct 7 ms 888 KB Output is correct
62 Correct 2 ms 376 KB Output is correct
63 Correct 3 ms 888 KB Output is correct