제출 #57333

#제출 시각아이디문제언어결과실행 시간메모리
57333gabrielsimoesTravelling Merchant (APIO17_merchant)C++17
0 / 100
87 ms2168 KiB
#include <bits/stdc++.h> using namespace std; typedef pair<int, int> pii; typedef long long ll; const int MAXN = 101, MAXM = 9901, MAXK = 1001; // const ll INF = 1e12; const ll INF = 1000; int N, M, K; vector<pii> g[MAXN]; ll buy[MAXN][MAXK]; ll sell[MAXN][MAXK]; ll d[MAXN][MAXN]; ll gain[MAXN][MAXN]; ll dist[MAXN]; bool testPosCycle(ll x) { dist[1] = 0; for (int i = 2; i <= N; i++) dist[i] = -INF; for (int cnt = 0; cnt <= N; cnt++) { for (int i = 1; i <= N; i++) { for (int j = 1; j <= N; j++) { dist[j] = max(dist[j], dist[i] + gain[i][j] - x*d[i][j]); if (i != 1 && j == 1 && dist[i] + gain[i][j] - x*d[i][j] >= 0) return true; } } } return false; } int main() { scanf("%d%d%d", &N, &M, &K); for (int i = 1; i <= N; i++) { for (int k = 1; k <= K; k++) { scanf("%lld%lld", &buy[i][k], &sell[i][k]); } } for (int i = 1; i <= N; i++) { for (int k = 1; k <= N; k++) { d[i][k] = INF; } d[i][i] = 0; } for (int i = 1,a,b,c; i <= M; i++) { scanf("%d%d%d", &a, &b, &c); g[a].push_back({b, c}); d[a][b] = c; } for (int k = 1; k <= N; k++) { for (int i = 1; i <= N; i++) { for (int j = 1; j <= N; j++) { d[i][j] = min(d[i][j], d[i][k] + d[k][j]); } } } for (int i = 1; i <= N; i++) { for (int j = 1; j <= N; j++) { for (int k = 1; k <= K; k++) { if (buy[i][k] != -1 && sell[j][k] != -1) { gain[i][j] = max(gain[i][j], -buy[i][k] + sell[j][k]); } } } } ll l = 0, r = INF; while (l < r) { ll m = (l + r + 1LL) >> 1; if (testPosCycle(m)) l = m; else r = m-1; } printf("%lld\n", l); }

컴파일 시 표준 에러 (stderr) 메시지

merchant.cpp: In function 'int main()':
merchant.cpp:37:10: 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:40:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%lld%lld", &buy[i][k], &sell[i][k]);
             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:52:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d", &a, &b, &c);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...