Page 3 of 4
10887 - Don't understand
Posted: Fri Nov 18, 2005 12:16 am
by [_TANG_]
Hi,
Can anyone tell me why does the input:
outputs:
Think that's why I can't get AC ...
... My code output is 6
Posted: Fri Nov 18, 2005 10:07 am
by mamun
I should think the concatenated words are
- 1. aa
2. a
3. ab
4.
5. b
6. ba
7. bb
I couldn't get it accepted either, TLE.
Strange :-?
Posted: Fri Nov 18, 2005 7:15 pm
by [_TANG_]
Hello,
I've a strange problem, when I debug my code with an input containing empty strings (hardcoded) its output is correct but if I try to run my code at console like this:
code.exe < input.txt > output.txt
Doesn't recognize the empty string ... I think is because of this:
Code: Select all
cin >> A >> B;
if(A && B)
{
count = 0;
for(d = 0; d < A; d++)
cin >> vectorA[d];
for(d = 0; d < B; d++)
cin >> vectorB[d];
...
I read from input and copy into an array the languages then I find the count of different words.
Is there other way to catch the input and recognize the empty string?
Thnx.
Posted: Fri Nov 18, 2005 10:40 pm
by mamun
cin skips whitespaces unless skipws flag is off.
Re: 10887 - Don't understand
Posted: Sat Nov 19, 2005 3:55 pm
by Soarer
[_TANG_] wrote:Hi,
Can anyone tell me why does the input:
outputs:
Think that's why I can't get AC ...
... My code output is 6
why is this a valid input?
You can assume that the strings are formed by lower case letters (
Posted: Sat Nov 19, 2005 4:46 pm
by Soarer
By the way, I need some i/o as well.. thanks.
Re: 10887 - Don't understand
Posted: Sat Dec 10, 2005 4:17 pm
by Martin Macko
[quote="Soarer"]why is this a valid input?
You can assume that the strings are formed by lower case letters (
Posted: Sat Dec 10, 2005 4:27 pm
by Martin Macko
Soarer wrote:By the way, I need some i/o as well.. thanks.
input:
Code: Select all
5
20 20
aaaaaaaaaa
aaaaaaaaa
aaaaaaaa
aaaaaaa
aaaaaa
aaaaa
aaaa
aaa
aa
a
baaaaaaaaa
baaaaaaaa
baaaaaaa
baaaaaa
baaaaa
baaaa
baaa
baa
ba
b
aaaaaaaaaa
aaaaaaaaa
aaaaaaaa
aaaaaaa
aaaaaa
aaaaa
aaaa
aaa
aa
a
aaaaaaaaab
aaaaaaaab
aaaaaaab
aaaaaab
aaaaab
aaaab
aaab
aab
ab
b
2 2
gas
gadf
1 1
1 1
a
a
5 1
gfegtwg
wgtwgtrweg
trwgtrwg
trwgrwg
trwgtgg
trwgtgg
output:
Code: Select all
Case 1: 76
Case 2: 4
Case 3: 1
Case 4: 1
Case 5: 5
Re: 10887 - Concatenation of Languages
Posted: Tue Aug 04, 2009 10:40 am
by Jehad Uddin
i have got ac,using set,bt its too slow,any faster idea??
10887 - Concatenation of Languages
Posted: Fri Apr 30, 2010 1:17 pm
by sazzadcsedu
I submitted the following algorithm but got TLE. How can i improve running time .someone plz help.Is stl map not enough???
here my code
Using set instead of using map got Acc.
Re: 10887 - Concatenation of Languages
Posted: Fri Jun 10, 2011 9:30 pm
by Shafaet_du
getting tle after tle
. I tried trie. I dont know how to write hash function yet.
Re: 10887 - Concatenation of Languages TLE
Posted: Mon Jun 20, 2011 4:05 pm
by nymo
As some posters said that it is possible to get AC with stl set. I am getting tle... I wonder how they did that...
Re: 10887 - Concatenation of Languages
Posted: Wed Nov 09, 2011 2:01 pm
by Karcher
i got quite curious about this issue (getting AC with stl set), but found no exact answer. Is
cell phone spy anybody in the know?
Re: 10887 - Concatenation of Languages
Posted: Tue Jan 03, 2012 11:09 am
by plamplam
I got Accepted with STL map, just don't use cin/getline, use gets() you should pass the Time Limit.
10887 - Concatenation of Languages WA
Posted: Sat Sep 14, 2013 12:11 pm
by hpjhc
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <cstring>
using namespace std;
int hash(string );
int insert(int );
string st1[1510], st2[1510];
int head[1000003], next[2250010];
string queue[2250010];
int main(void)
{
int t, a, b, i, j, k, cnt = 0;
scanf("%d", &t);
while(t--)
{
scanf("%d%d", &a, &b);
for(i = 0; i < a; i++)
cin>>st1;
for(i = 0; i < b; i++)
cin>>st2;
k = 1;
memset(head, 0, sizeof(head));
memset(next, 0, sizeof(next));
for(i = 0; i < a; i++)
for(j = 0; j < b; j++)
{
queue[k] = st1+st2[j];
if(insert(k))
k++;
}
printf("Case %d: %d\n", ++cnt, k-1);
}
return 0;
}
int hash(string str)
{
int hash = 0, seed = 31;
for(int i = 0; i < str.size(); i++)
hash = hash*seed+str;
return (hash & 0x7fffffff) % 1000003;
}
int insert(int s)
{
int h = hash(queue[s]);
int u = head[h];
while(u)
{
if(queue == queue[s])
return 0;
u = next;
}
next[s] = head[h];
head[h] = s;
return 1;
}