# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
4491 | jays | Following Flow (kriii1_F) | C++98 | 0 ms | 1672 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
const double EPS = 1e-9;
int N, M;
vector<int> adj[32], weight[32];
double solve(double* out) {
double A[32][32] = {0.0, }, B[32] = {0,0, };
for (int u = 0; u <= N; ++u) {
A[u][u] = 1.0;
for (int i = 0; i < adj[u].size(); ++i) {
int v = adj[u][i];
int w = weight[u][i];
A[u][v] = -1.0/out[u];
B[u] += 1.0*w/out[u];
}
}
// Gauss Elimination
for (int i = 0; i <= N; ++i) {
// Find Max Coefficient Row
double mx = 0.0;
int index = -1;
for (int j = i; j <= N; ++j) {
if (abs(A[j][i] > mx)) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |