# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
4013 | Qwaz | Following Flow (kriii1_F) | C++98 | 0 ms | 1212 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 <cstdio>
#include <vector>
#include <queue>
const int N_MAX=35, M_MAX=1020;
const double EPSILON=2.2204460492503131e-016;
struct state {
int time, node;
double ratio;
bool operator < (const state &t) const {
return time*ratio > t.time*t.ratio;
}
};
struct edge {
int to, time;
};
int n, m, outCount[N_MAX];
std::vector < edge > to[N_MAX];
void input(){
scanf("%d%d", &n, &m);
int i;
for(i=0; i<m; i++){
int p, q, r;
scanf("%d%d%d", &p, &q, &r);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |