oj.uz

답안 #249764

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
249764 2020-07-15T17:11:18 Z uacoder123 여행하는 상인 (APIO17_merchant) C++14
100 / 100
 203 ms 4600 KB 
 #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
#define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define mp(i,a) make_pair(i,a)
#define pb(a) push_back(a)
#define bit(x,b) (x&(1LL<<b))
 
typedef long long int lli;
typedef pair <lli,lli> ii;
typedef pair <lli,ii> iii;
typedef vector <lli> vi;
lli n,m,k;
void floyd(vector<vi> &al,vector<vi> &dis)
{
  for(lli i=1;i<n+1;++i)
    for(lli j=1;j<n+1;++j)
      dis[i][j]=(10000000000000000);
  for(lli i=1;i<n+1;++i)
    for(lli j=1;j<n+1;++j)
      if(i!=j)
      dis[i][j]=min(al[i][j],dis[i][j]);
    for(lli i=1;i<=n;++i)
      for(lli j=1;j<=n;++j)
        for(lli k=1;k<=n;++k)
          if(i!=k&&i!=j)
          {
            dis[j][k]=min(dis[j][k],dis[j][i]+dis[i][k]);
          }
}
int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  lli test=1;
  for(;test>0;--test)
  {
    cin>>n>>m>>k;
    vi p[n+1];
    for(lli i=1;i<=n;++i)
    {
      for(lli j=0;j<2*k;++j)
      {
        lli f;
        cin>>f;
        p[i].pb(f);
      }
    }
    vector<vi> al(n+1),dis(n+1),adj(n+1),bp(n+1),dis1(n+1);
    for(lli i=0;i<n+1;++i)
      for(lli j=0;j<n+1;++j)
      {
        al[i].pb(1000000000000000000);
        adj[i].pb(1000000000000000000);
        bp[i].pb(0);
        dis1[i].pb(0);
        dis[i].pb(0);
      }
    for(lli i=0;i<m;++i)
    {
      lli f,s,w;
      cin>>f>>s>>w;
      al[f][s]=w;
    }
    floyd(al,dis);
    lli l=0,r=1000000000,ans=1;
    for(lli i=1;i<=n;++i)
      for(lli j=1;j<=n;++j)
        for(lli l=0;l<k;++l)
          if(p[i][2*l]!=-1&&p[j][2*l+1]!=-1)
            bp[i][j]=max(bp[i][j],p[j][2*l+1]-p[i][2*l]);
    for(lli i=1;i<=n;++i)
      dis[i][i]=0;
    while(l<=r)
    {
      lli m=(l+r)/2;
      for(lli i=1;i<=n;++i)
        for(lli j=1;j<=n;++j)
        {
          if(dis[i][j]>100000001000||m*dis[i][j]<0)
            adj[i][j]=10000000000000000;
            else
            adj[i][j]=-(bp[i][j]-m*dis[i][j]);
        }
      floyd(adj,dis1);
      lli x=1;
      for(lli i=1;i<=n;++i)
      {
        x=min(dis1[i][i],x);
      }
      if(x<=0)
      {
        l=m+1;
        ans=m;
      }
      else
      {
        r=m-1;
      }
    }
    cout<<ans<<endl;
  }
  return(0);
}

Compilation message

merchant.cpp: In function 'void floyd(std::vector<std::vector<long long int> >&, std::vector<std::vector<long long int> >&)':
merchant.cpp:23:3: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   for(lli i=1;i<n+1;++i)
   ^~~
merchant.cpp:27:5: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
     for(lli i=1;i<=n;++i)
     ^~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 153 ms 2424 KB Output is correct
2 Correct 121 ms 1016 KB Output is correct
3 Correct 118 ms 896 KB Output is correct
4 Correct 15 ms 512 KB Output is correct
5 Correct 15 ms 512 KB Output is correct
6 Correct 16 ms 512 KB Output is correct
7 Correct 16 ms 512 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 15 ms 512 KB Output is correct
10 Correct 15 ms 512 KB Output is correct
11 Correct 15 ms 512 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 16 ms 512 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 512 KB Output is correct
2 Correct 15 ms 512 KB Output is correct
3 Correct 16 ms 512 KB Output is correct
4 Correct 14 ms 512 KB Output is correct
5 Correct 16 ms 512 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 16 ms 512 KB Output is correct
8 Correct 16 ms 512 KB Output is correct
9 Correct 17 ms 512 KB Output is correct
10 Correct 16 ms 512 KB Output is correct
11 Correct 17 ms 512 KB Output is correct
12 Correct 17 ms 640 KB Output is correct
13 Correct 16 ms 512 KB Output is correct
14 Correct 16 ms 512 KB Output is correct
15 Correct 17 ms 640 KB Output is correct
16 Correct 15 ms 512 KB Output is correct
17 Correct 16 ms 512 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 18 ms 512 KB Output is correct
20 Correct 17 ms 512 KB Output is correct
21 Correct 17 ms 512 KB Output is correct
22 Correct 16 ms 512 KB Output is correct
23 Correct 18 ms 512 KB Output is correct
24 Correct 16 ms 512 KB Output is correct
25 Correct 16 ms 512 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 15 ms 512 KB Output is correct
28 Correct 15 ms 512 KB Output is correct
29 Correct 15 ms 512 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 16 ms 512 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 127 ms 1024 KB Output is correct
2 Correct 188 ms 2516 KB Output is correct
3 Correct 121 ms 1016 KB Output is correct
4 Correct 126 ms 1024 KB Output is correct
5 Correct 126 ms 1116 KB Output is correct
6 Correct 121 ms 1016 KB Output is correct
7 Correct 16 ms 512 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 18 ms 512 KB Output is correct
10 Correct 17 ms 512 KB Output is correct
11 Correct 17 ms 512 KB Output is correct
12 Correct 16 ms 512 KB Output is correct
13 Correct 18 ms 512 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 512 KB Output is correct
2 Correct 15 ms 512 KB Output is correct
3 Correct 16 ms 512 KB Output is correct
4 Correct 14 ms 512 KB Output is correct
5 Correct 16 ms 512 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 16 ms 512 KB Output is correct
8 Correct 16 ms 512 KB Output is correct
9 Correct 17 ms 512 KB Output is correct
10 Correct 16 ms 512 KB Output is correct
11 Correct 17 ms 512 KB Output is correct
12 Correct 17 ms 640 KB Output is correct
13 Correct 16 ms 512 KB Output is correct
14 Correct 16 ms 512 KB Output is correct
15 Correct 17 ms 640 KB Output is correct
16 Correct 15 ms 512 KB Output is correct
17 Correct 127 ms 1024 KB Output is correct
18 Correct 188 ms 2516 KB Output is correct
19 Correct 121 ms 1016 KB Output is correct
20 Correct 126 ms 1024 KB Output is correct
21 Correct 126 ms 1116 KB Output is correct
22 Correct 121 ms 1016 KB Output is correct
23 Correct 16 ms 512 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 18 ms 512 KB Output is correct
26 Correct 17 ms 512 KB Output is correct
27 Correct 17 ms 512 KB Output is correct
28 Correct 16 ms 512 KB Output is correct
29 Correct 18 ms 512 KB Output is correct
30 Correct 119 ms 896 KB Output is correct
31 Correct 122 ms 1152 KB Output is correct
32 Correct 143 ms 2944 KB Output is correct
33 Correct 121 ms 1152 KB Output is correct
34 Correct 121 ms 1152 KB Output is correct
35 Correct 121 ms 1152 KB Output is correct
36 Correct 194 ms 4344 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 118 ms 960 KB Output is correct
40 Correct 116 ms 1024 KB Output is correct
41 Correct 116 ms 1024 KB Output is correct
42 Correct 120 ms 896 KB Output is correct
43 Correct 117 ms 896 KB Output is correct
44 Correct 1 ms 384 KB Output is correct
45 Correct 18 ms 640 KB Output is correct
46 Correct 18 ms 640 KB Output is correct
47 Correct 17 ms 640 KB Output is correct
48 Correct 203 ms 4600 KB Output is correct
49 Correct 198 ms 4472 KB Output is correct
50 Correct 0 ms 384 KB Output is correct
51 Correct 153 ms 2424 KB Output is correct
52 Correct 121 ms 1016 KB Output is correct
53 Correct 118 ms 896 KB Output is correct
54 Correct 15 ms 512 KB Output is correct
55 Correct 15 ms 512 KB Output is correct
56 Correct 16 ms 512 KB Output is correct
57 Correct 16 ms 512 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 15 ms 512 KB Output is correct
60 Correct 15 ms 512 KB Output is correct
61 Correct 15 ms 512 KB Output is correct
62 Correct 0 ms 384 KB Output is correct
63 Correct 16 ms 512 KB Output is correct