oj.uz

Submission #95782

# Submission time Handle Problem Language Result Execution time Memory
95782 2019-02-02T14:45:55 Z Bodo171 Travelling Merchant (APIO17_merchant) C++14
33 / 100
 84 ms 4088 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];
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();
        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];
                viz[nxt]++;
                if(viz[nxt]>=n)
                    return 1;
            }
        }
    }
    return 0;
}
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;
        cost[a][b]=min(cost[a][b],1LL*c);
    }
    int kt;
    for(kt=1; kt<=n; kt++)
        for(i=1; i<=n; i++)
            for(j=1; j<=n; j++)
                if(cost[i][kt]+cost[kt][j]<cost[i][j])
                    cost[i][j]=cost[i][kt]+cost[kt][j];
    for(p=30; p>=0; p--)
        if(check(ans+(1LL<<p)))
            ans+=(1LL<<p);
    cout<<ans;
    return 0;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 2016 KB Output is correct
2 Incorrect 4 ms 1276 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 888 KB Output is correct
2 Correct 3 ms 760 KB Output is correct
3 Correct 4 ms 888 KB Output is correct
4 Correct 3 ms 888 KB Output is correct
5 Correct 7 ms 888 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 3 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 4 ms 888 KB Output is correct
11 Correct 6 ms 888 KB Output is correct
12 Correct 8 ms 888 KB Output is correct
13 Correct 7 ms 892 KB Output is correct
14 Correct 4 ms 888 KB Output is correct
15 Correct 6 ms 888 KB Output is correct
16 Correct 3 ms 888 KB Output is correct
17 Correct 5 ms 888 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 11 ms 1016 KB Output is correct
20 Correct 7 ms 1016 KB Output is correct
21 Correct 8 ms 888 KB Output is correct
22 Correct 5 ms 888 KB Output is correct
23 Correct 4 ms 888 KB Output is correct
24 Correct 3 ms 760 KB Output is correct
25 Incorrect 3 ms 888 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 1528 KB Output is correct
2 Correct 84 ms 3832 KB Output is correct
3 Correct 34 ms 1556 KB Output is correct
4 Correct 17 ms 1660 KB Output is correct
5 Correct 67 ms 1656 KB Output is correct
6 Correct 27 ms 1528 KB Output is correct
7 Correct 5 ms 888 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 11 ms 1016 KB Output is correct
10 Correct 7 ms 1016 KB Output is correct
11 Correct 8 ms 888 KB Output is correct
12 Correct 5 ms 888 KB Output is correct
13 Correct 4 ms 888 KB Output is correct

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 888 KB Output is correct
2 Correct 3 ms 760 KB Output is correct
3 Correct 4 ms 888 KB Output is correct
4 Correct 3 ms 888 KB Output is correct
5 Correct 7 ms 888 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 3 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 4 ms 888 KB Output is correct
11 Correct 6 ms 888 KB Output is correct
12 Correct 8 ms 888 KB Output is correct
13 Correct 7 ms 892 KB Output is correct
14 Correct 4 ms 888 KB Output is correct
15 Correct 6 ms 888 KB Output is correct
16 Correct 3 ms 888 KB Output is correct
17 Correct 18 ms 1528 KB Output is correct
18 Correct 84 ms 3832 KB Output is correct
19 Correct 34 ms 1556 KB Output is correct
20 Correct 17 ms 1660 KB Output is correct
21 Correct 67 ms 1656 KB Output is correct
22 Correct 27 ms 1528 KB Output is correct
23 Correct 5 ms 888 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 11 ms 1016 KB Output is correct
26 Correct 7 ms 1016 KB Output is correct
27 Correct 8 ms 888 KB Output is correct
28 Correct 5 ms 888 KB Output is correct
29 Correct 4 ms 888 KB Output is correct
30 Correct 7 ms 1400 KB Output is correct
31 Correct 8 ms 1528 KB Output is correct
32 Correct 25 ms 2680 KB Output is correct
33 Correct 24 ms 1624 KB Output is correct
34 Correct 17 ms 1528 KB Output is correct
35 Correct 16 ms 1528 KB Output is correct
36 Correct 60 ms 4088 KB Output is correct
37 Incorrect 2 ms 504 KB Output isn't correct
38 Halted 0 ms 0 KB -