oj.uz

Submission #252233

# Submission time Handle Problem Language Result Execution time Memory
252233 2020-07-24T23:35:15 Z super_j6 Ceste (COCI17_ceste) C++14
32 / 160
 2500 ms 768 KB 
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<ll, ll>
#define f first
#define s second
 
const int inf = 0x3f3f3f3f;
const int mxn = 2000;
int n, m;
int u[mxn], v[mxn], a[mxn], b[mxn];
pi d[mxn];
set<pi> pq;
vector<int> g[mxn];
 
pi djk(ll x, ll y, int z){
	for(int i = 1; i < n; i++) d[i] = {inf, inf};
	pq.clear();
	pq.insert({0, 0});
	while(!pq.empty()){
		int c = pq.begin()->s;
		pq.erase(pq.begin());
		if(c == z) break;
		for(int i : g[c]){
			int j = c ^ u[i] ^ v[i];
			ll dj = d[j].f * x + d[j].s * y, dc = (d[c].f + a[i]) * x + (d[c].s + b[i]) * y;
			if(dj > dc){
				pq.erase({dj, j});
				d[j] = {d[c].f + a[i], d[c].s + b[i]};
				pq.insert({dc, j});
			}
		}
	}
	return d[z];
}

ll f(pi x){
	return x.f * x.s;
}
 
pi ff(pi x, pi y){
	return f(x) < f(y) ? x : y;
}
 
pi sol(pi l, pi r, int x){
	pi p = djk(r.s - l.s, l.f - r.f, x);
	if((p.f - l.f) * (r.s - l.s) == (p.s - l.s) * (r.f - l.f)) return ff(l, r);
	if(f(djk(p.s - l.s, l.f - p.f, x)) < f(djk(r.s - p.s, p.f - r.f, x))) sol(l, p, x);
	else sol(p, r, x);
}
 
int main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	
	cin >> n >> m;
	
	for(int i = 0; i < m; i++){
		cin >> u[i] >> v[i] >> a[i] >> b[i];
		g[--u[i]].push_back(i);
		g[--v[i]].push_back(i);
	}
	
	for(int i = 1; i < n; i++){
		pi ret = sol(djk(0, 1, i), djk(1, 0, i), i);
		cout << (ret.f != inf ? ret.f * ret.s : -1) << endl;
	}
	
	return 0;
}

Compilation message

ceste.cpp: In function 'std::pair<long long int, long long int> sol(std::pair<long long int, long long int>, std::pair<long long int, long long int>, int)':
ceste.cpp:55:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 384 KB Output isn't correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 384 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Output isn't correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 672 ms 632 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 75 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2562 ms 512 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1985 ms 768 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1901 ms 528 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2586 ms 632 KB Time limit exceeded
2 Halted 0 ms 0 KB -