Submission #127149

#TimeUsernameProblemLanguageResultExecution timeMemory
127149liwiCeste (COCI17_ceste)C++11
96 / 160
2391 ms16248 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set; #define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0) char _; #define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end()) #define all(a) a.begin(),a.end() #define println printf("\n"); #define readln(x) getline(cin,x); #define pb push_back #define endl "\n" #define INT_INF 0x3f3f3f3f #define LL_INF 0x3f3f3f3f3f3f3f3f #define MOD 1000000007 #define mp make_pair #define fastio cin.tie(0); cin.sync_with_stdio(0); #define MAXN 2005 typedef unsigned long long ull; typedef long long ll; typedef long double ld; typedef unordered_map<int,int> umii; typedef pair<int,int> pii; typedef pair<double,double> pdd; typedef pair<ll,ll> pll; typedef pair<int,pii> triple; typedef int8_t byte; mt19937 g1(time(0)); int randint(int a, int b){return uniform_int_distribution<int>(a, b)(g1);} ll randlong(ll a,ll b){return uniform_int_distribution<long long>(a, b)(g1);} ll gcd(ll a, ll b){return b == 0 ? a : gcd(b, a % b);} ll lcm(ll a, ll b){return a*b/gcd(a,b);} ll fpow(ll b, ll exp, ll mod){if(exp == 0) return 1;ll t = fpow(b,exp/2,mod);if(exp&1) return t*t%mod*b%mod;return t*t%mod;} ll divmod(ll i, ll j, ll mod){i%=mod,j%=mod;return i*fpow(j,mod-2,mod)%mod;} int num_nodes,num_edges,best[MAXN][MAXN],s; ll ans[MAXN]; vector<pair<int,pii>> connections[MAXN]; int main(){ scanf("%d %d",&num_nodes,&num_edges); for(int i=1; i<=num_edges; i++){ int a,b,t,c; scanf(" %d %d %d %d",&a,&b,&t,&c); connections[a].pb(mp(b,mp(t,c))); connections[b].pb(mp(a,mp(t,c))); s+=t; } memset(ans,0x3f,sizeof ans); memset(best,0x3f,sizeof best); best[1][0] = 0; for(int i=1; i<=20000; i++){ int curr = i%2001; for(int k=1; k<=num_nodes; k++){ for(pair<int,pii> check:connections[k]){ int t = check.second.first, c = check.second.second, nt = (i-t+2001)%2001; if(t > i || best[check.first][nt] == 0x3f3f3f3f) continue; best[k][curr] = min(best[k][curr],best[check.first][nt]+c); ans[k] = min(ans[k],1LL*best[k][curr]*i); } } } memset(best,0x3f,sizeof best); best[1][0] = 0; for(int i=1; i<=20000; i++){ int curr = i%2001; for(int k=1; k<=num_nodes; k++){ for(pair<int,pii> check:connections[k]){ int t = check.second.first, c = check.second.second, nt = (i-c+2001)%2001; if(c > i || best[check.first][nt] == 0x3f3f3f3f) continue; best[k][curr] = min(best[k][curr],best[check.first][nt]+t); ans[k] = min(ans[k],1LL*best[k][curr]*i); } } } for(int i=2; i<=num_nodes; i++){ if(ans[i] == 0x3f3f3f3f3f3f3f3f) printf("-1\n"); else printf("%lld\n",ans[i]); } }

Compilation message (stderr)

ceste.cpp: In function 'int main()':
ceste.cpp:50:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&num_nodes,&num_edges);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ceste.cpp:52:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int a,b,t,c; scanf(" %d %d %d %d",&a,&b,&t,&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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...