oj.uz

Submission #172016

# Submission time Handle Problem Language Result Execution time Memory
172016 2019-12-30T20:20:14 Z Pajaraja Travelling Merchant (APIO17_merchant) C++17
21 / 100
 206 ms 4004 KB 
#include <bits/stdc++.h>
#define MAXN 107
#define MAXK 1007
using namespace std;
long long bp[MAXN][MAXK],sp[MAXN][MAXK],d[MAXN][MAXN],w[MAXN][MAXN],wb[MAXN][MAXN],dist[MAXN],dn[MAXN];
int n,m,a;
void zvonocovek()
{
	for(int i=1;i<=n;i++) 
		for(int j=1;j<=n;j++) if(i!=j)
			dist[j]=min(dist[j],dist[i]+wb[i][j]);
}
bool provera(long long k)
{
	for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) wb[i][j]=n*(d[i][j]*k-w[i][j])-1;
	dist[1]=0; 
	for(int i=2;i<=n;i++) dist[i]=1000000000000000000LL;
	for(int i=2;i<=n;i++) zvonocovek();
	for(int i=1;i<=n;i++) dn[i]=dist[i];
	zvonocovek();
	for(int i=1;i<=n;i++) if(dist[i]!=dn[i]) return true;
	return false;
}
long long binarna(long long l, long long r)
{
	if(l==r) return l;
	long long s=(l+r+1)/2;
	if(provera(s)) return binarna(s,r);
	return binarna(l,s-1);
}
int main()
{
	cin>>n>>m>>a;
	for(int i=1;i<=n;i++) for(int j=1;j<=a;j++) cin>>bp[i][j]>>sp[i][j];
	for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) d[i][j]=1000000000000000000LL;
	for(int i=1;i<=m;i++)
	{
		int t1,t2; long long t3;
		cin>>t1>>t2>>t3;
		d[t1][t2]=min(d[t1][t2],t3);
	}
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
			for(int k=1;k<=n;k++)
				d[j][k]=min(d[j][k],d[j][i]+d[i][k]);
	for(int i=1;i<=n;i++) 
		for(int j=1;j<=n;j++) if(i!=j)
			for(int k=1;k<=a;k++) if(bp[i][k]!=-1 && sp[j][k]!=-1) 
				w[i][j]=max(w[i][j],sp[j][k]-bp[i][k]);
	//for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) if(i!=j) printf("%d %d %lld %lld\n",i,j,d[i][j],w[i][j]);
	printf("%d",binarna(0,2000000000));
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:51:35: warning: format '%d' expects argument of type 'int', but argument 2 has type 'long long int' [-Wformat=]
  printf("%d",binarna(0,2000000000));
              ~~~~~~~~~~~~~~~~~~~~~^

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 159 ms 3320 KB Output is correct
2 Incorrect 45 ms 1272 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1016 KB Output is correct
2 Correct 9 ms 888 KB Output is correct
3 Correct 10 ms 888 KB Output is correct
4 Correct 9 ms 892 KB Output is correct
5 Correct 12 ms 1016 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 9 ms 888 KB Output is correct
8 Correct 10 ms 888 KB Output is correct
9 Correct 9 ms 888 KB Output is correct
10 Correct 10 ms 892 KB Output is correct
11 Correct 13 ms 1016 KB Output is correct
12 Correct 13 ms 1016 KB Output is correct
13 Correct 10 ms 888 KB Output is correct
14 Correct 10 ms 888 KB Output is correct
15 Correct 14 ms 1016 KB Output is correct
16 Correct 9 ms 888 KB Output is correct
17 Correct 11 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 13 ms 1016 KB Output is correct
21 Correct 13 ms 1016 KB Output is correct
22 Correct 11 ms 888 KB Output is correct
23 Correct 9 ms 888 KB Output is correct
24 Correct 8 ms 760 KB Output is correct
25 Correct 11 ms 888 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 8 ms 760 KB Output is correct
28 Correct 9 ms 760 KB Output is correct
29 Correct 9 ms 888 KB Output is correct
30 Correct 2 ms 504 KB Output is correct
31 Correct 11 ms 888 KB Output is correct

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 1704 KB Output is correct
2 Correct 206 ms 4004 KB Output is correct
3 Correct 54 ms 1576 KB Output is correct
4 Incorrect 65 ms 1784 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1016 KB Output is correct
2 Correct 9 ms 888 KB Output is correct
3 Correct 10 ms 888 KB Output is correct
4 Correct 9 ms 892 KB Output is correct
5 Correct 12 ms 1016 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 9 ms 888 KB Output is correct
8 Correct 10 ms 888 KB Output is correct
9 Correct 9 ms 888 KB Output is correct
10 Correct 10 ms 892 KB Output is correct
11 Correct 13 ms 1016 KB Output is correct
12 Correct 13 ms 1016 KB Output is correct
13 Correct 10 ms 888 KB Output is correct
14 Correct 10 ms 888 KB Output is correct
15 Correct 14 ms 1016 KB Output is correct
16 Correct 9 ms 888 KB Output is correct
17 Correct 60 ms 1704 KB Output is correct
18 Correct 206 ms 4004 KB Output is correct
19 Correct 54 ms 1576 KB Output is correct
20 Incorrect 65 ms 1784 KB Output isn't correct
21 Halted 0 ms 0 KB -