oj.uz

답안 #125716

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
125716 2019-07-06T09:20:16 Z abacaba Ceste (COCI17_ceste) C++14
0 / 160
 573 ms 1016 KB 
#include <bits/stdc++.h>
using namespace std;
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define mp make_pair
#define f first
#define se second
#define pb push_back
#define ppb pop_back
#define ll long long
#define ull unsigned long long
#define cntbit(x) __builtin_popcount(x)
#define uset unordered_set
#define umap unordered_map
#define pii pair<int, int>
#define ld long double
#define pll pair<long long, long long>

#define int long long

struct edge {
	int to, t, c;
	edge(int to, int t, int cost) : to(to), t(t), c(cost) {}
};
 
const int inf = 2e15;
const int N = 2e3 + 15;
int n, m, ans[N];
double d[N];
int sumt[N], sumc[N];
vector <edge> g[N];
bool used[N];
set <pii> q;
vector <pair <pii, pii> > edges;

void dxtra(double x) {
	fill(d, d + N, inf);
	memset(sumt, 0, sizeof(sumt));
	memset(sumc, 0, sizeof(sumc));
	d[1] = 0;
	q.insert(mp(0, 1));
	while(!q.empty()) {
		int v = q.begin()->se;
		q.erase(q.begin());
		for(auto u : g[v]) {
			if(d[v] + u.t * x + u.c * (1 - x) < d[u.to]) {
				q.erase(mp(d[u.to], u.to));
				sumt[u.to] = sumt[v] + u.t;
				sumc[u.to] = sumc[v] + u.c;
				d[u.to] = d[v] + u.t * x + u.c * (1 - x);
				q.insert(mp(d[u.to], u.to));
			}
		}
	}
	for(int i = 2; i <= n; ++i)
		ans[i] = min(ans[i], sumt[i] * sumc[i]);
}

#undef int

int main() {
	#define int long long
	fill(ans, ans + N, inf);
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> n >> m;
	for(int i = 1; i <= m; ++i) {
		int u, v, t, c;
		cin >> u >> v >> t >> c;
		g[u].pb(*new edge(v, t, c));
		g[v].pb(*new edge(u, t, c));
		edges.pb({{u, v}, {t, c}});
		edges.pb({{v, u}, {t, c}});
	}
	double x = 0;
	dxtra(0);
	for(int i = 1; i <= 20000; ++i) {
		for(int i = 0; i < edges.size(); ++i) {
			int to = edges[i].f.f, v = edges[i].f.se, t = edges[i].se.f, c = edges[i].se.se;
			int na = sumt[v] + t,
                nb = sumc[v] + c,
                ca = sumt[to],
                cb = sumc[to];
            double newx = (cb - nb) / (double)(na - nb - ca + cb);
			if(newx > x && newx <= 1) {
				x = newx;
				dxtra(x);
			}
		}
	}
	for(int i = 2; i <= n; ++i)
		cout << (ans[i] == inf || ans[i] == 0 ? -1 : ans[i]) << endl;
    return 0;
}

Compilation message

ceste.cpp: In function 'int main()':
ceste.cpp:77:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < edges.size(); ++i) {
                  ~~^~~~~~~~~~~~~~

Subtask #1
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 508 KB Output isn't correct

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 18 ms 504 KB Output isn't correct

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 18 ms 504 KB Output isn't correct

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 19 ms 504 KB Output isn't correct

Subtask #5
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 254 ms 892 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 84 ms 632 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 377 ms 988 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 573 ms 1016 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 550 ms 896 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 506 ms 888 KB Output isn't correct
2 Halted 0 ms 0 KB -