oj.uz

Submission #127163

# Submission time Handle Problem Language Result Execution time Memory
127163 2019-07-09T02:14:42 Z liwi Ceste (COCI17_ceste) C++11
160 / 160
 141 ms 3944 KB 
#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,s;
ll ans[MAXN];
pii lst[MAXN];
map<int,int> dis[MAXN];
vector<pair<int,pii>> connections[MAXN];

inline bool valid(int node, pii nxt){
	if(nxt.first <= lst[node].first) return false;
	if(nxt.second > lst[node].second) return false;
	return true;
}

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);
	for(int i=1; i<=num_nodes; i++)
		lst[i] = mp(INT_MIN,INT_MAX);
	dis[1][0] = 0;
	priority_queue<pair<pii,int>,vector<pair<pii,int>>,greater<pair<pii,int>>> q;
	q.push(mp(mp(0,0),1));
	while(q.size()){
		int node = q.top().second, t = q.top().first.first, c = q.top().first.second; q.pop();
		if(!valid(node,mp(t,c))) continue;
		lst[node] = mp(t,c);
		for(pair<int,pii> check:connections[node]){
			int nxt = check.first, nt = t+check.second.first, nc = c+check.second.second;
			if(nt <= s && valid(nxt,mp(nt,nc))){
				ans[nxt] = min(ans[nxt],1LL*nt*nc);
				q.push(mp(mp(nt,nc),nxt));
			}
		}
	}
	for(int i=2; i<=num_nodes; i++){
		if(ans[i] == 0x3f3f3f3f3f3f3f3f) printf("-1\n");
		else printf("%lld\n",ans[i]);
	}
}

Compilation message

ceste.cpp: In function 'int main()':
ceste.cpp:58: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:60: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);
                ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 4 ms 632 KB Output is correct
3 Correct 4 ms 652 KB Output is correct

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1080 KB Output is correct
2 Correct 14 ms 1080 KB Output is correct
3 Correct 13 ms 1084 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 1524 KB Output is correct
2 Correct 127 ms 3944 KB Output is correct
3 Correct 5 ms 760 KB Output is correct

Subtask #8
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 760 KB Output is correct
2 Correct 124 ms 2288 KB Output is correct
3 Correct 8 ms 760 KB Output is correct

Subtask #9
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 1016 KB Output is correct
2 Correct 117 ms 1524 KB Output is correct
3 Correct 106 ms 1524 KB Output is correct

Subtask #10
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 1520 KB Output is correct
2 Correct 105 ms 1520 KB Output is correct
3 Correct 141 ms 1524 KB Output is correct