-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCongestionRunner.java
More file actions
117 lines (93 loc) · 3.75 KB
/
Copy pathCongestionRunner.java
File metadata and controls
117 lines (93 loc) · 3.75 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
public class CongestionRunner {
public static void main(String[] args) {
//INPUT VALUES HERE
double step = 1.0; //How long each time jump is
int numWaves = 3; //Number of Waves
int[]wavesizes = new int[numWaves];
String[]wavetypes = new String[numWaves];
int[]interWaveSteps = new int[numWaves - 1];
wavesizes[0] = 50; //Size of Each Wave
wavesizes[1] = 50;
wavesizes[2] = 50;
//wavesizes[3] = 50;
//wavesizes[4] = 50;
wavetypes[0] = "FPRO"; //Type of Each Wave
wavetypes[1] = "ATH";
wavetypes[2] = "FOPEN";
//wavetypes[3] = "CLY";
//wavetypes[4] = "MOPEN";
interWaveSteps[0] = 300; //Time between Waves
interWaveSteps[1] = 300;
//interWaveSteps[2] = 300;
//interWaveSteps[3] = 10;
int swimDistance = 1500;
int bikeDistance = 40000;
int runDistance = 10000;
//interWaveSteps[1] = 60;
//ACTUAL CODE NOW
int roadStart = 0; //Time road enters use
int time = 0; //Tracks total time
int bikeSumDistance = swimDistance + bikeDistance;
int runSumDistance = bikeSumDistance + runDistance;
int totalsize = 0;
for(int i = 0; i < numWaves; i++){
totalsize += wavesizes[i];
}
double [][] runners = new double[totalsize][2]; //Array of all runners' position and velocity
Runner[]runnerList = new Runner[totalsize]; //Array of first wave of Runners
int startIndex = 0; //Keeps track of how many indices in we are
for(int waveIndex = 0; waveIndex < numWaves; waveIndex++){
for(int index = startIndex; index < startIndex + wavesizes[waveIndex]; index++) { //Assigns values for waves
runnerList[index] = new Runner(wavetypes[waveIndex],step,swimDistance,bikeSumDistance,runSumDistance);
runners[index][0] = 0;
runners[index][1] = 0;
}
if(waveIndex != numWaves - 1){
for(int intercounter = interWaveSteps[waveIndex]; intercounter >= 0; intercounter--){ //runs waves for intersteps time
double[]moveDist = new double[startIndex + wavesizes[waveIndex]];
for(int index = 0; index < startIndex + wavesizes[waveIndex]; index++) { //Gets data from every runner
moveDist[index] = runnerList[index].calcTravel(runners);
}
for(int index = 0; index < startIndex + wavesizes[waveIndex]; index++) {
if(runnerList[index].position < runSumDistance){
if(roadStart == 0){
if(runnerList[index].position > swimDistance){
roadStart = time;
}
}
runnerList[index].timestep();
runners[index][0] += moveDist[index];
runners[index][1] = moveDist[index]/5;
}
}
time += step;
}
startIndex += wavesizes[waveIndex];
}
}
boolean finished = false; //Tests if everyone finished yet
while(!finished){
finished = true;
double[]moveDist = new double[totalsize];
for(int index = 0; index < totalsize; index++) { //Gets data from every runner
moveDist[index] = runnerList[index].calcTravel(runners);
}
for(int index = 0; index < totalsize; index++) {
if(runnerList[index].position < runSumDistance){
runnerList[index].timestep();
runners[index][0] += moveDist[index];
runners[index][1] = moveDist[index]/step;
finished = false;
//System.out.println(runnerList[index].position);
}
}
time += step;
}
System.out.println(time);
for(int index = 0; index < totalsize; index++){
//System.out.println(runnerList[index].stepDifference());
System.out.println(runnerList[index].classname + " " + runnerList[index].stepDifference() * step + " " + runnerList[index].getStepNumber()*step);
}
System.out.println(time-roadStart);
}
}