제출 #937753

#제출 시각아이디문제언어결과실행 시간메모리
937753Baizho여행하는 상인 (APIO17_merchant)C++14
33 / 100
74 ms8020 KiB
#include <bits/stdc++.h> using namespace std; #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; #define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update> // #pragma GCC optimize("Ofast,unroll-loops,fast-math") // #pragma GCC target("popcnt,sse3,avx") typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<ll,ll> pll; #define sz size() #define ff first #define ss second #define all(a) a.begin(),a.end() #define pb push_back const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6 const ll MOD = 998244353; // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod const int N = ll(2e5)+100; const int M = ll(2e5) + 100; const long long inf = 2e18; //const long double eps = 1e-15L; ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; } ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;} void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); } int n, m, k1, b[105][1005], s[105][1005]; long long dis[1005][1005], profit[1005][1005], dis1[1005][1005]; void Baizho() { cin>>n>>m>>k1; for(int i = 1; i <= n; i ++) { for(int j = 1; j <= k1; j ++) { cin>>b[i][j]>>s[i][j]; } } for(int i = 1; i <= n; i ++) { for(int j = 1; j <= n; j ++) { dis[i][j] = inf; } } for(int i = 1; i <= m; i ++) { int a, b, w; cin>>a>>b>>w; dis[a][b] = w; } for(int i = 1; i <= n; i ++) { for(int j = 1; j <= n; j ++) { for(int k = 1; k <= k1; k ++) { if(b[i][k] != -1 && s[j][k] != -1) profit[i][j] = max(profit[i][j], 1LL * s[j][k] - b[i][k]); } } } for(int i = 1; i <= n; i ++) { for(int j = 1; j <= n; j ++) { for(int k = 1; k <= n; k ++) { dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]); } } } ll l = 1, r = 2e9; while(l <= r) { ll x = (l + r) / 2; for(int i = 1; i <= n; i ++) { for(int j = 1; j <= n; j ++) { if(x <= inf / dis[i][j]) dis1[i][j] = x * dis[i][j] - profit[i][j]; else dis1[i][j] = inf; } } for(int i = 1; i <= n; i ++) { for(int j = 1; j <= n; j ++) { for(int k = 1; k <= n; k ++) { dis1[i][j] = min(dis1[i][j], dis1[i][k] + dis1[k][j]); } } } bool ok = 0; for(int i = 1; i <= n; i ++) ok |= (dis1[i][i] <= 0); if(ok) l = x + 1; else r = x - 1; } cout<<l - 1<<"\n"; } signed main() { // Freopen("nondec"); ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0); // precalc(); int ttt = 1; // cin>>ttt; for(int i=1; i<=ttt; i++) {Baizho(); } }

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

merchant.cpp: In function 'void Freopen(std::string)':
merchant.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                           ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
      |                                                                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...