Question

Sutmissien shoud indude a cop file and an output file generated by your program. Plee smit the pp fie Do NOT submit the entire Visual Studio project package! Background hre s amous ralway staton in PopPush City. Country there is incredibly hilly. The station was built in st centiuny Unfortunately, funds were extremely limited that time. it was possible to establish only a sete res Moreover t turned out that the station could be only a dead-end one (see picture) and due to lack of available space it could have only one track 1, 2 3, 4, 5 8432 B. Station The tradition is hat every train arriving from the direction A continues in the direction B with coaches reorgani i seme way Assume tha: the train anv from the direction A has N s 1000 coaches numbered in increasing order 1,2, N The chief for train reorganizations must know whether it is possible to marshal coaches continuing in the direction B so that their order will be a, an..a. Help him and write a program that decides whecher it is possible to get the required order of coaches . You can assume that single coaches can be disconnected from the train before they enter the station an d that they can move themselves until they are on the track in the direction B . You can also suppose that at any time there can be located as many coaches as necessary in the station. But once a coach has entered the station it cannot return to the track in the direction A and also once it has left the station in the direction B it cannot return back to the station Program Input The input file consists of blocks of lines, each of which is a test case. Each block except the last describes one train and possibly more requirements for its reorganization, In the first line of the block there is the integer N, which is the number of coaches in the train, In each of the next lines of the block there is a permutation of 1, 2,.., N.For example, if N is 5, and the permutation could be 5,3,2,1,4 Your program will take this permutation as input and determine whether you can marshal the coaches . from track A an incoming order 1,2,3,4, 5 to track B with an outgoing order 5, 3, 2, 1, 4 using the station, which can be treated as a stack The last ine of the block contains just O Iif a block starts with a zero, the program weill terminate. e You shouild use the input file named lab1in.txt (download from Canvas) to test your program; an output file named lab1out.txt(with correct output) is also provided for you to verify your program. Input Sample I/ start of first block 2345 s4123 1/ end of first block // start of second block 5432 /I end of second block // end of Input Program Output The output file contains the lines corresponding to the lines with permutations in the input file. A line of the output file contains "Yes" if it is possible to marshal the coaches in the order required on the corresponding ine of the input file. Otherwe it contains "No". In addinion, there is one empty line after the lines espanding to one b'ok uf the inpus file. There is no line in the output file corresponding to the last back of the input t Output Sample This is an output sample of the previous input sample Hint Key points to understand/solve the problem * The train station can be regarded as a stack . One can push a coach from track A into the stack when the coach is popped out of the ack g into track B, and a coach in the station can never go back to track A * Taking a train with 5 coaches as an example Coaches in track A is always in strictly increasing order, Le·1,2,3,4,5 * The train chief tries to marshal the coaches anto track ธ ฟ, a seomee-Pah ~ ~- * Each test case in the input fle is asking a que hon such that the coach order matches the test case? * 11,toma h.Pe~a.노m- For instance,if the test case is "1, 2, 3, 4, 5", then we can perform the following sequence of Track A Stack (left side is the top) Track B operation 2, 3,4,5 empty push(1) 2,3,4, 5 empty pop 3,4,5 3,4,5 empty 1,2 pop 4, 5 1,2 4, 5 2. 3 empty 1,2,3 1,2,3,4 empty pop empty 1,2,34 push(5) 1, 2, 3, 4, 5 empty The final coach order in track B matches 1,2,3,4,5- in the test case, so program outputs YES o Now use a similar way to validate that why test case "5, 4, 1,2,3" will NOT work Now you should be able to handle larger test cases as the ones in the input file provided by the

Answer 1

Code -

#include<cstdio>
#include<stack>

using namespace std;
//global variables
int N, c;
stack<int> block;

void railway() {
//infinit for loop
for(;;) {
//check for size of block
while(block.size() > 0) block.pop();
int j = 0;
for(int i = 0; i < N; i++) {
scanf("%d", &c);
if(c == 0) return;

while(j < N && j != c) {
if(block.size() > 0 && block.top() == c) break;
j++;
block.push(j);
}
if(block.top() == c) block.pop();
}
if(block.size() == 0) printf("Yes\n");
else printf("No\n");
}
}

int main() {
//infinite loop if user press 0 than break
for(;;) {
//store the value of N
scanf("%d", &N);
//if N is 0 than break
if(N == 0) break;
//call the function to check
railway();
printf("\n");
}
}

Screenshots -