# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
4014 | pichulia | Following Flow (kriii1_F) | C++98 | 332 ms | 1508 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<stdio.h>
int n,m;
int a[35][1005][3];
int an[1005];
int an2[1005];
double d1[3][35];
double d2[3][35];
double la;
int main(){
int i,j,k,in1,in2,in3;
scanf("%d %d",&n,&m);
for(i=1;i<=m;i++){
scanf("%d %d %d",&in1,&in2,&in3);
if(in1!=n){
a[in2][++an[in2]][0]=in1;
a[in2][an[in2]][1]=in3;
an2[in1]++;
}
}
d1[0][0]=1;
int i1,i2;
double op,d1n=0,d2n=0;
int in=3800;
for(i=1;i<=in;i++){
i1=i%2;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |