# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
3805 | waps12b | Following Flow (kriii1_F) | C++98 | 0 ms | 4260 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<queue>
#include<vector>
#include<algorithm>
using namespace std;
int v[31][1001];
double dist[31][1001];
int cnt[31];
struct Q{
double per;
double dist;
int pos;
Q(int pos_,double dist_,double per_){
pos = pos_;
dist = dist_;
per = per_;
}
};
double sum=0;
int main(){
double lmt = 0.00000001;
int n, m;scanf("%d %d",&n,&m);
for(int i=0;i<m;i++){
int a, b;
double t;
scanf("%d %d %lf",&a,&b,&t);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |