10928 - My Dear Neighbours

[Raj Ariyan]

Hi,
Here is the link abt explanation of 10928. Let me know, If u face problem again after see this page. Good Luck.
http://online-judge.uva.es/board/viewtopic.php?t=9112

[misof]

Sorting isn't necessary, but the output has to be sorted. The most tricky part of this problem is reading the input data correctly. For each test case:
- get a line with P
- get P lines with the descriptions of neighborhoods
- find the index of the line that contains the least amount of numbers (if there are more possible answers, store all of them and output them in increasing order)
- output it
- if this is not the last test case, get a line (the empty line that separates test cases)

Check whether you don't have unnecessary whitespaces in your output.

Try the following test data:

Code: Select all

2
2
1
2

13
10 11 12 13
11 12 13
11 12 13
11 12 13
11 12 13
11 12 13
11 12 13
11 12 13
11 12 13
11 12 13
1 2 3 4
1 2 3 4
1 2 3 4

The correct output:

Code: Select all

1 2
2 3 4 5 6 7 8 9 10

There are no spaces after 2 and 10, there is an end-of-line character after both of them.

[Moha]

You don't need to count the numbers in each line, just count the space!

[turcse143]

here is sample input output: I got WA PLES help? Is there any special case?
input:
4
3
2
1 3
2 1

4
2
3
1 4 2
2 1 3

2
1
2

13
10 11 12 13
11 12 13
11 12 13
11 12 13
11 12 13
11 12 13
11 12 13
11 12 13
11 12 13
11 12 13
1 2 3 4
1 2 3 4
1 2 3 4

output:
1
1 2
1 2
2 3 4 5 6 7 8 9 10
Press any key to continue

[turcse143]

thanks changing the input technique i got accept

[sharath]

My code below is passing all the test cases mentioned in the thread but getting WA when submitted..

#include <iostream>
#include <string>
#include <sstream>
using namespace std;

int a[1000];
int main()
{
int n,p,d,i,min;

char str[1000];

cin>>n;
while (n-- != 0)
{
i = 0;
cin>>p;
min = p-1;
memset(a,0,sizeof(a));

while (p != 0)
{
fgets(str,999,stdin);

istringstream str1(str);
while (str1 >> d)
{
a++;
}
if (a != 0)
{
if (a < min)
{
min = a;
}
i++;
p--;
}

}
for (i=0;i<1000;i++)
{
if (a == min)
{
cout<<i+1<<" ";
}
}

cout<<endl;
}
return 0;
}

What is the mistake??

[mukit]

I'm getting WA in this problem
Please give some I/O.

Code: Select all

Got Acc ...

Thank's in advance.

[mukit]

Ok forget that. Got AC. But one thing...
for misof's input

Code: Select all

2
2
1
2

13
10 11 12 13
11 12 13
11 12 13
11 12 13
11 12 13
11 12 13
11 12 13
11 12 13
11 12 13
11 12 13
1 2 3 4
1 2 3 4
1 2 3 4

output will be,

Code: Select all

1 2
2 3 4 5 6 7 8 9 10

So just a newline '\n' (not a blank line) after every case including the last one.

[Shafaet_du]

Too easy a problem. Dont need to make the thinks complex,just count inputs in every line,index them and find out the lowes value. then print the ouputs.
Only one space will separate the outputs,which makes the problem even more easier.

if you still get wa,check this IO:

Code: Select all

2

8
2
4 3
1 2 3
2 1 3 4
1 2 3 4 5
5 3 1 3 5 
2
5

12
11 10 9
1 2 3
1 2 3 4
5 6 7 8
4 3 1 2
11 9 3
1 2 3 4 5 6 7 8 9
1 2 10 9 8 7
1 2 3 4
6 7 8
5 4 3
1 2 3 4 5

Output from my ac code:

Code: Select all

1 7 8
1 2 6 10 11

[DD]

My code below is passing all the test cases mentioned in the thread but getting WA when submitted..

#include <iostream>
#include <string>
#include <sstream>
using namespace std;

int a[1000];
int main()
{
int n,p,d,i,min;

char str[1000];

cin>>n;
while (n-- != 0)
{
i = 0;
cin>>p;
min = p-1;
memset(a,0,sizeof(a));

while (p != 0)
{
fgets(str,999,stdin);

istringstream str1(str);
while (str1 >> d)
{
a++;
}
if (a != 0)
{
if (a < min)
{
min = a;
}
i++;
p--;
}

}
for (i=0;i<1000;i++)
{
if (a == min)
{
cout<<i+1<<" ";
}
}

cout<<endl;
}
return 0;
}

What is the mistake??

The size of str is not enough. The number of neighbors in this problem will not exceed 1000 but the length of each line may exceed. You should get A.C. once you enlarge the length of str.

[Farsan]

Sorting isn't necessary, but the output has to be sorted. The most tricky part of this problem is reading the input data correctly. For each test case:
- get a line with P
- get P lines with the descriptions of neighborhoods
- find the index of the line that contains the least amount of numbers (if there are more possible answers, store all of them and output them in increasing order)
- output it
if this is not the last test case, get a line (the empty line that separates test cases)[/even for the last test case you have 2 print a new line all u have 2 worry about is whitespaces]

Check whether you don't have unnecessary whitespaces in your output.

Try the following test data:

Code: Select all

2
2
1
2

13
10 11 12 13
11 12 13
11 12 13
11 12 13
11 12 13
11 12 13
11 12 13
11 12 13
11 12 13
11 12 13
1 2 3 4
1 2 3 4
1 2 3 4

The correct output:

Code: Select all

1 2
2 3 4 5 6 7 8 9 10

There are no spaces after 2 and 10, there is an end-of-line character after both of them.

[moxlotus]

Runtime Error on my following code. Can someone tell me why?

AC'ed

[lighted]

Increase array limit

Code: Select all

char *str = new char[size];

It must be

Code: Select all

char *str = new char[size + 1];

You will get PE. Don't print extra space after last number.

Don't forget to remove your code after getting accepted.

[uDebug]

Replying to follow the thread.