oj.uz

답안 #402140

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
402140 2021-05-11T11:21:59 Z juggernaut 여행하는 상인 (APIO17_merchant) C++17
100 / 100
 115 ms 3392 KB 
#include<bits/stdc++.h>
#define fr first
#define sc second
using namespace std;
void usaco(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
typedef long long ll;
#define USING_ORDERED_SET 0
#if USING_ORDERED_SET
#include<bits/extc++.h>
using namespace __gnu_pbds;
template<class T>using ordered_set=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
#endif
template<class T>void umax(T &a,T b){if(a<b)a=b;}
template<class T>void umin(T &a,T b){if(b<a)a=b;}
#ifdef IOI2021SG
    #define printl(args...)printf(args)
#else
    #define printl(args...)((void)0)
#endif
const ll inf=1e18;
const int N=105;
const int K=1050;
int b[N][K],s[N][K],p[N][N];
ll dist[N][N],work[N][N];
int main(){
    int n,m,k,u,v;
	scanf("%d %d %d",&n,&m,&k);
	for(int i=1;i<=n;i++)for(int j=1;j<=k;j++)scanf("%d %d",&b[i][j],&s[i][j]);
	for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)for(int l=1;l<=k;l++)if(b[i][l]!=-1&&s[j][l]!=-1)p[i][j]=max(p[i][j],s[j][l]-b[i][l]);
	for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)dist[i][j]=inf;
	for(int i=1;i<=m;i++)scanf("%d %d",&u,&v),scanf("%lld",&dist[u][v]);
	for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)for(int l=1;l<=n;l++)dist[j][l]=min(dist[j][l],dist[j][i]+dist[i][l]);
	int r=1e9,l=1,mid,ans=0;
	while(l<=r){
		mid=r+l>>1;
		for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) work[i][j]=(ll)mid*min(dist[i][j],inf/mid)-p[i][j];
		for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) for(int l=1;l<=n;l++) work[j][l]=min(work[j][l],work[j][i]+work[i][l]);
		bool ok=0;for(int i=1;i<=n;i++) ok|=work[i][i]<=0;
		if(ok) ans=mid,l=mid+1;
		else r=mid-1;
	}
	printf("%d",ans);
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:35:8: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   35 |   mid=r+l>>1;
      |       ~^~
merchant.cpp: In function 'void usaco(std::string)':
merchant.cpp:5:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | void usaco(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:5:66: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | void usaco(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
      |                                                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp: In function 'int main()':
merchant.cpp:27:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |  scanf("%d %d %d",&n,&m,&k);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~
merchant.cpp:28:49: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |  for(int i=1;i<=n;i++)for(int j=1;j<=k;j++)scanf("%d %d",&b[i][j],&s[i][j]);
      |                                            ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:31:28: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |  for(int i=1;i<=m;i++)scanf("%d %d",&u,&v),scanf("%lld",&dist[u][v]);
      |                       ~~~~~^~~~~~~~~~~~~~~
merchant.cpp:31:49: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |  for(int i=1;i<=m;i++)scanf("%d %d",&u,&v),scanf("%lld",&dist[u][v]);
      |                                            ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 77 ms 2492 KB Output is correct
2 Correct 39 ms 1196 KB Output is correct
3 Correct 39 ms 1228 KB Output is correct
4 Correct 6 ms 716 KB Output is correct
5 Correct 6 ms 716 KB Output is correct
6 Correct 6 ms 716 KB Output is correct
7 Correct 7 ms 832 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 6 ms 716 KB Output is correct
10 Correct 7 ms 708 KB Output is correct
11 Correct 7 ms 716 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 7 ms 828 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 716 KB Output is correct
2 Correct 7 ms 832 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 6 ms 716 KB Output is correct
5 Correct 7 ms 708 KB Output is correct
6 Correct 7 ms 716 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 7 ms 828 KB Output is correct
9 Correct 7 ms 716 KB Output is correct
10 Correct 9 ms 808 KB Output is correct
11 Correct 7 ms 832 KB Output is correct
12 Correct 6 ms 696 KB Output is correct
13 Correct 7 ms 864 KB Output is correct
14 Correct 1 ms 288 KB Output is correct
15 Correct 7 ms 812 KB Output is correct
16 Correct 9 ms 716 KB Output is correct
17 Correct 7 ms 716 KB Output is correct
18 Correct 7 ms 716 KB Output is correct
19 Correct 7 ms 872 KB Output is correct
20 Correct 8 ms 844 KB Output is correct
21 Correct 7 ms 716 KB Output is correct
22 Correct 7 ms 836 KB Output is correct
23 Correct 9 ms 864 KB Output is correct
24 Correct 6 ms 716 KB Output is correct
25 Correct 7 ms 848 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 8 ms 864 KB Output is correct
28 Correct 16 ms 868 KB Output is correct
29 Correct 7 ms 844 KB Output is correct
30 Correct 7 ms 828 KB Output is correct
31 Correct 9 ms 808 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 848 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 8 ms 864 KB Output is correct
4 Correct 16 ms 868 KB Output is correct
5 Correct 7 ms 844 KB Output is correct
6 Correct 7 ms 828 KB Output is correct
7 Correct 9 ms 808 KB Output is correct
8 Correct 45 ms 1332 KB Output is correct
9 Correct 102 ms 3036 KB Output is correct
10 Correct 60 ms 1356 KB Output is correct
11 Correct 45 ms 1484 KB Output is correct
12 Correct 45 ms 1484 KB Output is correct
13 Correct 42 ms 1400 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 716 KB Output is correct
2 Correct 9 ms 808 KB Output is correct
3 Correct 7 ms 832 KB Output is correct
4 Correct 6 ms 696 KB Output is correct
5 Correct 7 ms 864 KB Output is correct
6 Correct 1 ms 288 KB Output is correct
7 Correct 7 ms 812 KB Output is correct
8 Correct 9 ms 716 KB Output is correct
9 Correct 7 ms 716 KB Output is correct
10 Correct 7 ms 716 KB Output is correct
11 Correct 7 ms 872 KB Output is correct
12 Correct 8 ms 844 KB Output is correct
13 Correct 7 ms 716 KB Output is correct
14 Correct 7 ms 836 KB Output is correct
15 Correct 9 ms 864 KB Output is correct
16 Correct 6 ms 716 KB Output is correct
17 Correct 45 ms 1332 KB Output is correct
18 Correct 102 ms 3036 KB Output is correct
19 Correct 60 ms 1356 KB Output is correct
20 Correct 45 ms 1484 KB Output is correct
21 Correct 45 ms 1484 KB Output is correct
22 Correct 42 ms 1400 KB Output is correct
23 Correct 7 ms 848 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 8 ms 864 KB Output is correct
26 Correct 16 ms 868 KB Output is correct
27 Correct 7 ms 844 KB Output is correct
28 Correct 7 ms 828 KB Output is correct
29 Correct 9 ms 808 KB Output is correct
30 Correct 77 ms 2492 KB Output is correct
31 Correct 39 ms 1196 KB Output is correct
32 Correct 39 ms 1228 KB Output is correct
33 Correct 6 ms 716 KB Output is correct
34 Correct 6 ms 716 KB Output is correct
35 Correct 6 ms 716 KB Output is correct
36 Correct 7 ms 832 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 6 ms 716 KB Output is correct
39 Correct 7 ms 708 KB Output is correct
40 Correct 7 ms 716 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 7 ms 828 KB Output is correct
43 Correct 41 ms 1228 KB Output is correct
44 Correct 42 ms 1332 KB Output is correct
45 Correct 81 ms 1752 KB Output is correct
46 Correct 42 ms 1376 KB Output is correct
47 Correct 42 ms 1384 KB Output is correct
48 Correct 42 ms 1356 KB Output is correct
49 Correct 103 ms 3264 KB Output is correct
50 Correct 1 ms 296 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 40 ms 1228 KB Output is correct
53 Correct 43 ms 1420 KB Output is correct
54 Correct 44 ms 1356 KB Output is correct
55 Correct 45 ms 1328 KB Output is correct
56 Correct 40 ms 1228 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 11 ms 860 KB Output is correct
59 Correct 12 ms 832 KB Output is correct
60 Correct 9 ms 844 KB Output is correct
61 Correct 115 ms 3392 KB Output is correct
62 Correct 113 ms 3300 KB Output is correct
63 Correct 1 ms 332 KB Output is correct