OJ Board

sharath wrote: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.

misof wrote: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.