OJ Board

Hi... I try to changed my algorithm n it can passed TLE.. But Now i've got WA for this prob.. Can u give me any critical i/o ??
Thx a lot..
Andre

I use C++ map , but I still got TLE
who can fix my program
I know my code isn't very good
thanks for your help.....

[cpp] CUT ^^"... [/cpp]

Why on earth are you using a map<char,char> to get the value of each letter? That's insane. Use a switch statement.

Do

map<int,int> phonenumbercount;

When you have the phone number as an INT (which you don't use any C++, ever, to figure out), do phonenumbercount[number]++.

The print your phone number with printf("%03d-%04d",n/10000,n%10000);

The only thing you need from C++ is a single map, indicating how many of each phone number there are, and an iterator to step through them afterwards.

Andrew Neitsch wrote:Why on earth are you using a map<char,char> to get the value of each letter? That's insane. Use a switch statement.

I think fast for the way , but actually I wrong

Do
map<int,int> phonenumbercount;
When you have the phone number as an INT (which you don't use any C++, ever, to figure out), do phonenumbercount[number]++.
The print your phone number with printf("%03d-%04d",n/10000,n%10000);
The only thing you need from C++ is a single map, indicating how many of each phone number there are, and an iterator to step through them afterwards.

thanks your correction and help , I got AC.....

I've gotten WA for long time.
I tried test input on this board and mine.
please tell me my mistake or some advice.
[cpp]

Accepted nasty my code is cleared.

And Thank you Hiloshi!

[/cpp]

thank you

hi tetuya!
I think you had take mistake in func method.

[cpp]
if(counter>0)
printf("%03d-%04d %d\n",tmp/10000,tmp%10000,++counter);

}
skip:;
if(duple) cout << "No duplicates." << endl;
}
[/cpp]

Label skip and follow code is executed any case.
You should type "return" before label skip:

Check this input

1

2
1111111
1111111
--------------
correct output is
111-1111 2

but your program will output
111-1111 2
No duplicates.

No soon had I followed your Advice and submitted,than I got Accepted !

Thank you for your Accurate Advice !

My heart was saved (^-')b

Hello emka.
It's a bug. good luck

Hi 20717TZ.

string is slow in case of this problem.
you could handle it with primitive measure.

How is it possible that for the following code,
OJ says it uses only 64 KB when it should use at least 0.3 MB?

It also says WA in 0.00 seconds.

[c]
[/c]

I don't understand this.

I found the error.

Why OJ gives WA Please help me ...
Please Help !

Would anyone be able to provide some input and output with lots of data in there as i think my program is correct, but keep getting WA =p

Thanks alot

Hi,
You can check this input. Hope it helps. Good luck

Input :-

4

5
-0-0-0-0-1-0-1
IYSDS-1-1-
MMDPS-22
0000A--AA
-----AMSAM--AA

6
3-10-10-1A
6464642
ASACCS5
-1111115
F101010
888-1200

5
-5-5-9-7-4-9-2
2947955
GO-HOME-1
HOME-123
12344-AA

9
-123-5657
12----12121
ABBCSS1
12112-A--B
ABBC-123
-1-2----3AABC
KKSDS-AA
ALNKNDS
----KKJ1234

Output:-

No duplicates.
No duplicates.
No duplicates.
No duplicates.

I think the 3rd test case is wrong since the number of phone numbers is wrong.

Furthermore, for the last input, how come the output is as such?