oj.uz

답안 #102002

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
102002 2019-03-21T12:11:58 Z bakpark 여행하는 상인 (APIO17_merchant) C++14
33 / 100
 134 ms 1400 KB 
#include <cstdio>
#include <algorithm>
#include <limits.h>
#include <memory.h>
using namespace std;
#define ll long long

int N,M,K;
int B[101][1001], S[101][1001], T[101][101];
double val[101][101];
int Q[101][101];
ll dist[101][101];
double g(int st,int en,int m,ll d){
	return Q[st][en]-(double)d*m;
}
bool f(int m){
	for(int i=1;i<=N;i++){
		for(int j=1;j<=N;j++){
			if(T[i][j]) {
				dist[i][j] = T[i][j];
				val[i][j] = g(i,j,m,dist[i][j]);
			}
			else {
				dist[i][j] = -1ll;
				val[i][j] = LLONG_MIN;
			}
		}
	}
	for(int mid=1;mid<=N;mid++){
		for(int st=1;st<=N;st++){
			for(int en=1;en<=N;en++){
				if(dist[st][mid]==-1ll||dist[mid][en]==-1ll) continue;
				ll td = dist[st][mid]+dist[mid][en];
				double hval = max(g(st,en,m,td),val[st][mid]+val[mid][en]);
				if(hval>val[st][en]){
					dist[st][en] = td;
					val[st][en] = hval;
				}
			}
		}
		for(int n=1;n<=N;n++){
			if(val[n][n]>=0) return true;
		}
	}
	return false;
}
int main(){
	scanf("%d %d %d",&N,&M,&K);
	for(int i=1;i<=N;i++){
		for(int j=0;j<K+K;j++){
			int tmp;scanf("%d",&tmp);
			if(j&1)	S[i][j/2+1] = tmp;
			else B[i][j/2+1] = tmp;
		}
	}
	for(int i=0;i<M;i++){
		int a,b,c;
		scanf("%d %d %d",&a,&b,&c);
		T[a][b] = c;
	}
	for(int i=1;i<=N;i++){
		for(int j=1;j<=N;j++){
			for(int k=1;k<=K;k++){
				if(i==j) continue;
				if(B[i][k]>0&&S[j][k]>0)
					Q[i][j] = max(Q[i][j],S[j][k]-B[i][k]);
			}
		}
	}
	int l = 0,r = 1000000000,answ=0;
	while(l<=r){
		int m = (l+r)>>1;
		if(f(m)){
			l = m+1;
			answ = m;
		}
		else r = m-1;
	}
	printf("%d",answ);
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:48:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d",&N,&M,&K);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~
merchant.cpp:51:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    int tmp;scanf("%d",&tmp);
            ~~~~~^~~~~~~~~~~
merchant.cpp:58:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d",&a,&b,&c);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 80 ms 1332 KB Output is correct
2 Correct 44 ms 1400 KB Output is correct
3 Correct 47 ms 1280 KB Output is correct
4 Incorrect 11 ms 768 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 768 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 1368 KB Output is correct
2 Correct 134 ms 1400 KB Output is correct
3 Correct 83 ms 1372 KB Output is correct
4 Correct 41 ms 1400 KB Output is correct
5 Correct 37 ms 1400 KB Output is correct
6 Correct 79 ms 1280 KB Output is correct
7 Correct 9 ms 768 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 9 ms 768 KB Output is correct
10 Correct 11 ms 896 KB Output is correct
11 Correct 10 ms 896 KB Output is correct
12 Correct 11 ms 896 KB Output is correct
13 Correct 9 ms 896 KB Output is correct

Subtask #4
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 768 KB Output isn't correct
2 Halted 0 ms 0 KB -