Cleaning UpProblem code: CLEANUP |
All submissions for this problem are available.
After a long and successful day of preparing food for the banquet, it is time to clean up. There is a list of n jobs to do before the kitchen can be closed for the night. These jobs are indexed from 1 to n.
Most of the cooks have already left and only the Chef and his assistant are left to clean up. Thankfully, some of the cooks took care of some of the jobs before they left so only a subset of the n jobs remain. The Chef and his assistant divide up the remaining jobs in the following manner. The Chef takes the unfinished job with least index, the assistant takes the unfinished job with the second least index, the Chef takes the unfinished job with the third least index, etc. That is, if the unfinished jobs were listed in increasing order of their index then the Chef would take every other one starting with the first job in the list and the assistant would take every other one starting with the second job on in the list.
The cooks logged which jobs they finished before they left. Unfortunately, these jobs were not recorded in any particular order. Given an unsorted list of finished jobs, you are to determine which jobs the Chef must complete and which jobs his assistant must complete before closing the kitchen for the evening.
Input
The first line contains a single integer T ? 50 indicating the number of test cases to follow. Each test case consists of two lines. The first line contains two numbers n,m satisfying 0 ? m ? n ? 1000. Here, n is the total number of jobs that must be completed before closing and m is the number of jobs that have already been completed. The second line contains a list of m distinct integers between 1 and n. These are the indices of the jobs that have already been completed. Consecutive integers are separated by a single space.
Output
The output for each test case consists of two lines. The first line is a list of the indices of the jobs assigned to the Chef. The second line is a list of the indices of the jobs assigned to his assistant. Both lists must appear in increasing order of indices and consecutive integers should be separated by a single space. If either the Chef or the assistant is not assigned any jobs, then their corresponding line should be blank.
Example
Input: 3 6 3 2 4 1 3 2 3 2 8 2 3 8 Output: 3 6 5 1 1 4 6 2 5 7
| Author: | friggstad |
| Date Added: | 9-08-2010 |
| Time Limit: | 5 sec |
| Source Limit: | 50000 Bytes |
| Languages: | ADA, ASM, BASH, BF, C, C99 strict, CAML, CLOJ, CLPS, CPP 4.0.0-8, CPP 4.3.2, D, ERL, F#, FORT, GO, HASK, ICK, ICON, JAR, JAVA, JS, LISP clisp, LISP sbcl, LUA, NEM, NICE, PAS fpc, PAS gpc, PERL, PERL6, PHP, PIKE, PRLG, PYTH, PYTH 3.1.2, RUBY, SCALA, SCM guile, SCM qobi, ST, TEXT, WSPC |
Comments
SUCCESSFUL SUBMISSIONS FOR THIS PROBLEM:
HELP
Program should read from standard input and write to standard output. After you submit a solution you can see your results by clicking on the [My Submissions] tab on the problem page. Below are the possible results:
- Accepted
Your program ran successfully and gave a correct answer. If there is a score for the problem, this will be displayed in parenthesis next to the checkmark. - Time Limit Exceeded
Your program was compiled successfully, but it didn't stop before time limit. Try optimizing your approach. - Wrong Answer
Your program compiled and ran succesfully but the output did not match the expected output. - Runtime Error
Your code compiled and ran but encountered an error. The most common reasons are using too much memory or dividing by zero. For the specific error codes see the help section. - Compilation Error
Your code was unable to compile. When you see this icon, click on it for more information.
If you are still having problems, see a sample solution here.

Fetching successful submissions

why C# not allowed for this
why C# not allowed for this problem
#include<stdio.h>#include<str
#include<stdio.h>
#include<string.h>
#include<memory.h>
typedef enum { false, true } bool;
int main()
{
int tc;
scanf("%d",&tc);
for(int testcase=0; testcase<tc; testcase++)
{
int m,n,x;
bool a[1001];
memset(a,0,sizeof(a)); //Sets the first num bytes of the block
// of memory pointed by ptr to the specified value
scanf("%d %d",&n, &m);
for(int i=0;i<m; i++)
{
scanf("%d", &x);
a[x]=true;
}
int cnt=0;
for(int j=1; j<=n; j++)
{
if(!a[j])
{
if(!(cnt%2))
{
printf("%d ",j);
a[j]=true;
}
cnt++;
}
}
printf("n");
for(int k=1; k<=n; k++)
{
if(!a[k])
{
printf("%d ",k);
a[k]=true;
}
}
printf("n");
}
return 0;
}
this code is giving desired
memory.h is a nonstandard
memory.h is a nonstandard header file, which is why it won't compile.
please help me in removing
Why can't we submit in C#?
@Admin please tell me why
@Admin: When I try to submit
i am getting wrong ans every
Getting run time error.