-
Notifications
You must be signed in to change notification settings - Fork 12
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
18 changed files
with
1,146 additions
and
25 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,135 @@ | ||
| // ERROR | ||
| #include <algorithm> | ||
| #include <cstdio> | ||
| #include <vector> | ||
| const int size = 405, inf = 1 << 30; | ||
| struct G { | ||
| struct Edge { | ||
| int to, nxt; | ||
| } E[size]; | ||
| int last[size], cnt; | ||
| G() : cnt(0) {} | ||
| void addEdge(int u, int v) { | ||
| ++cnt; | ||
| E[cnt].to = v, E[cnt].nxt = last[u]; | ||
| last[u] = cnt; | ||
| } | ||
| } A, B; | ||
| int p[size][6], d[size]; | ||
| int lca(int u, int v) { | ||
| if(u == 0 || v == 0) | ||
| return u | v; | ||
| if(d[u] < d[v]) | ||
| std::swap(u, v); | ||
| int delta = d[u] - d[v]; | ||
| for(int i = 0; i < 6; ++i) | ||
| if(delta & (1 << i)) | ||
| u = p[u][i]; | ||
| if(u == v) | ||
| return u; | ||
| for(int i = 5; i >= 0; --i) | ||
| if(p[u][i] != p[v][i]) | ||
| u = p[u][i], v = p[v][i]; | ||
| return p[u][0]; | ||
| } | ||
| int T[size], C[size], in[size], q[size], ans = 0; | ||
| struct Sol { | ||
| int lim, cw; | ||
| Sol(int lim, int cw) : lim(lim), cw(cw) {} | ||
| }; | ||
| std::vector<Sol> DFS(int u, int t) { | ||
| ans = std::max(ans, t); | ||
| std::vector<Sol> cur; | ||
| for(int i = B.last[u]; i; i = B.E[i].nxt) { | ||
| int v = B.E[i].to; | ||
| std::vector<Sol> vres = DFS(v, t + T[v]); | ||
| if(i == B.last[u]) | ||
| cur = vres; | ||
| else { | ||
| std::vector<Sol> mix; | ||
| for(int j = 0; j < cur.size(); ++j) { | ||
| Sol a = cur[j]; | ||
| int minv = inf; | ||
| for(int k = 0; k < vres.size(); ++k) | ||
| if(vres[k].lim >= a.lim) | ||
| minv = | ||
| std::min(vres[k].cw, minv); | ||
| if(minv != inf) { | ||
| a.cw += minv; | ||
| mix.push_back(a); | ||
| } | ||
| } | ||
| for(int j = 0; j < vres.size(); ++j) { | ||
| Sol a = vres[j]; | ||
| int minv = inf; | ||
| for(int k = 0; k < cur.size(); ++k) | ||
| if(cur[k].lim >= a.lim) | ||
| minv = | ||
| std::min(cur[k].cw, minv); | ||
| if(minv != inf) { | ||
| a.cw += minv; | ||
| mix.push_back(a); | ||
| } | ||
| } | ||
| cur.swap(mix); | ||
| } | ||
| } | ||
| Sol base(T[u], C[u]); | ||
| cur.erase(std::remove_if(cur.begin(), cur.end(), | ||
| [=](Sol sol) { | ||
| return sol.lim <= | ||
| base.lim && | ||
| sol.cw >= base.cw; | ||
| }), | ||
| cur.end()); | ||
| cur.push_back(base); | ||
| return cur; | ||
| } | ||
| int main() { | ||
| int n, m, w; | ||
| scanf("%d%d%d", &n, &m, &w); | ||
| for(int i = 1; i <= n; ++i) | ||
| scanf("%d", &T[i]); | ||
| for(int i = 1; i <= n; ++i) | ||
| scanf("%d", &C[i]); | ||
| for(int i = 1; i <= m; ++i) { | ||
| int u, v; | ||
| scanf("%d%d", &u, &v); | ||
| A.addEdge(u, v); | ||
| ++in[v]; | ||
| } | ||
| int rt = n + 1, qcnt = 0; | ||
| for(int i = 1; i <= n; ++i) | ||
| if(!in[i]) { | ||
| q[++qcnt] = i; | ||
| p[i][0] = rt; | ||
| d[i] = 1; | ||
| B.addEdge(rt, i); | ||
| } | ||
| for(int i = 1; i <= qcnt; ++i) { | ||
| int u = q[i]; | ||
| for(int j = A.last[u]; j; j = A.E[j].nxt) { | ||
| int v = A.E[j].to; | ||
| p[v][0] = lca(p[v][0], u); | ||
| if(--in[v] == 0) { | ||
| B.addEdge(p[v][0], v); | ||
| for(int i = 1; i < 6; ++i) | ||
| p[v][i] = p[p[v][i - 1]][i - 1]; | ||
| d[v] = d[p[v][0]] + 1; | ||
| q[++qcnt] = v; | ||
| } | ||
| } | ||
| } | ||
| for(int i = 1; i <= n; ++i) | ||
| printf("fa %d %d\n", i, p[i][0]); | ||
| std::vector<Sol> sols = DFS(rt, 0); | ||
| int res = 0; | ||
| for(int i = 0; i < sols.size(); ++i) { | ||
| Sol cs = sols[i]; | ||
| if(cs.cw) | ||
| res = std::max( | ||
| res, std::min(cs.lim, w / cs.cw)); | ||
| } | ||
| printf("%d\n", ans - res); | ||
| return 0; | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,109 @@ | ||
| #include <csetjmp> | ||
| #include <cstdio> | ||
| #include <cstring> | ||
| int read() { | ||
| int res = 0, c; | ||
| do | ||
| c = getchar(); | ||
| while(c < '0' || c > '9'); | ||
| while('0' <= c && c <= '9') { | ||
| res = res * 10 + c - '0'; | ||
| c = getchar(); | ||
| } | ||
| return res; | ||
| } | ||
| const int size = 5005; | ||
| struct Edge { | ||
| int to, nxt, w; | ||
| } E[2 * size]; | ||
| int last[size], cnt = 0; | ||
| void addEdge(int u, int v, int w) { | ||
| ++cnt; | ||
| E[cnt].to = v, E[cnt].nxt = last[u], E[cnt].w = w; | ||
| last[u] = cnt; | ||
| } | ||
| typedef double FT; | ||
| const FT eps = 1e-3; | ||
| FT x, delta; | ||
| jmp_buf buf; | ||
| int vis[size]; | ||
| FT dis[size]; | ||
| void pre(int u, int d) { | ||
| vis[u] = d; | ||
| FT du = dis[u]; | ||
| for(int i = last[u]; i; i = E[i].nxt) { | ||
| int v = E[i].to; | ||
| FT dv = du + E[i].w + x; | ||
| if(dv < dis[v]) { | ||
| if(vis[v]) { | ||
| delta = | ||
| (dis[v] - dv) / (d + 1 - vis[v]); | ||
| longjmp(buf, 1); | ||
| } | ||
| dis[v] = dv; | ||
| pre(v, d + 1); | ||
| break; | ||
| } | ||
| } | ||
| vis[u] = 0; | ||
| } | ||
| int D; | ||
| void DFS(int u, int d) { | ||
| if(d == D) | ||
| return; | ||
| vis[u] = d; | ||
| FT du = dis[u]; | ||
| for(int i = last[u]; i; i = E[i].nxt) { | ||
| int v = E[i].to; | ||
| FT dv = du + E[i].w + x; | ||
| if(dv < dis[v]) { | ||
| if(vis[v]) { | ||
| delta = | ||
| (dis[v] - dv) / (d + 1 - vis[v]); | ||
| longjmp(buf, 1); | ||
| } | ||
| dis[v] = dv; | ||
| DFS(v, d + 1); | ||
| } | ||
| } | ||
| vis[u] = 0; | ||
| } | ||
| bool iter(int n) { | ||
| memset(dis + 1, 0, sizeof(double) * n); | ||
| memset(vis + 1, 0, sizeof(int) * n); | ||
| if(setjmp(buf)) { | ||
| x += delta + 1e-4; | ||
| return delta > eps; | ||
| } else { | ||
| for(int i = 1; i <= n; ++i) | ||
| pre(i, 1); | ||
| int end = n * 2; | ||
| for(D = 1; D <= end; ++D) | ||
| for(int i = 1; i <= n; ++i) | ||
| DFS(i, 1); | ||
| return false; | ||
| } | ||
| } | ||
| int main() { | ||
| int n = read(); | ||
| int m = read(); | ||
| int S = n + 1; | ||
| for(int i = 1; i <= m; ++i) { | ||
| int u = read(); | ||
| int v = read(); | ||
| int a = read(); | ||
| int b = read(); | ||
| int c = read(); | ||
| int d = read(); | ||
| if(u != S) { | ||
| if(c) | ||
| addEdge(u, v, a - d); | ||
| addEdge(v, u, b + d); | ||
| } | ||
| } | ||
| x = 0.0; | ||
| while(iter(n + 2)) | ||
| ; | ||
| printf("%.2lf\n", x); | ||
| return 0; | ||
| } |
Oops, something went wrong.