OMG, I had the same stupid mistake!

Why you not print 999999999999999999999999? 777777 retwitt 0000000000000000000000000, 55 retwit 777777: RT @777777: RT @0000000000000000000000000: XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
(len=128<140).

And what your answers on these tests?
1)

4
JaneSoboleva 2 FelixMate Try
FelixMate 1 JaneSoboleva
Try 0
SumSu 1 FelixMate
Why Jane Soboleva not solve problems on Timus Online? Her count of problems is 784. It's not beautiful number! She must solve for >=800 problems!!!

2)

4
JaneSoboleva 2 FelixMate Try
FelixMate 1 SumSu
Try 0
SumSu 0
Why Jane Soboleva not solve problems on Timus Online now?Her count of problems is 784.She must solve minimum 16 problems!

So Dijkstra looks like is needed.

Are you sure, that after >480 accepted solutions I'v done so stupid mistake ?
PS:
I don't use threads. Problem was with Timus JVM. It's solved.

These sumbissions have verdict Crash 1 now. It was a failure of compiler - any solution was judged as WA1.

scanf("\n") ignore first ' ' symbols in next string.

Edited by author 18.10.2011 19:43

thank you so much! but one more question...
if the fist one tweets "aaaaa earthquake!!!!", the second retweets "RT @name1: aaaaa earthquake!!!!" what should write the third one who wants to retweet: "RT @name2: aaaaa earthquake!!!!" or "RT @name2: RT @name1: aaaaa earthquake!!!!"

        ""Послано Gao Yang 19 октября 2011 07:52
         Pay attention to that the one can't retweet the message but he has learn it.""

Please, give this test.

Edited by author 21.10.2011 23:54

Edited by author 21.10.2011 23:55

Please, give this test.
Where are bugs? =)

#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;

class my_less{
    public:
        bool operator()( const pair<string,short> a, const pair<string,short> b ){
            return a.second < b.second;
        }
};

int main(){
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "rt", stdin);
    #endif
    map<string,bool> DidGet;
    map<string,short> minLengthMessage;
    map< string, set<string> > users;
    set<string> informed;//опповещёные
    long n;
    string first_man;
    cin >> n;
    for( short i = 0; i < n; ++i ){
        //cout << i << endl;
        string name;
        cin >> name;
        users[name] = set<string>();
        if( !i ) first_man = name;
        DidGet[name] = false;
        minLengthMessage[name] = numeric_limits<short>::max();
        long kol;
        if( scanf("%ld", &kol)!=1 ){while(1)printf("12121");};
        for( long j = 0; j < kol; ++j ){
            string follower;
            cin >> follower;
            users[name].insert( follower );
        }
    }
    //for(map< string, set<string> >::iterator i = users.begin();
    //    i != users.end();
    //    ++i
    //) {
    //    cout << (*i).first << endl;
    //        for(
    //            set<string>::iterator it = (*i).second.begin();
    //            it != (*i).second.end();
    //            ++it
    //        )
    //        {
    //            cout << "    " << (*it) << endl;
    //        }
    //}
    string SOS_massage;
    while( cin.get() != '\n' );
    getline( cin, SOS_massage );
    if( SOS_massage.size() == 0 || SOS_massage.size()>140 ){while(1)puts("1212");}
    //cout << "|" << SOS_massage << "|" << endl;
    multiset< pair<string,short>, my_less > Q;
    Q.insert( pair<string,short>(first_man,SOS_massage.size()) );
    while( !Q.empty() ){
        pair<string,short> para = *Q.begin();
        Q.erase( Q.begin() );
        //cout << "Take:" << para.first << " " << para.second << endl;
        if( para.second <= 140
            &&( !DidGet[para.first] || minLengthMessage[para.first] > para.second)
        )
        {
            informed.insert( para.first );
            DidGet[para.first] = true;
            minLengthMessage[para.first] = para.second;
            //cout << "adding for: " << para.first << endl;
            for(
                set<string>::iterator it = users[para.first].begin();
                it != users[para.first].end();
                ++it
            )
            {
                //cout << "    " << *it << endl;
                Q.insert( pair<string,short>(
                    *it,
                    6 + para.first.length() + para.second//
                    //доп. симв. + длина имени отправителя + длина сообщ. которое получил отправитель
                ));//
            }
        }
    }
    cout << informed.size() << endl;
    for(
        set<string> ::iterator it = informed.begin();
        it != informed.end();
        ++it
    )
        cout << *it << endl;
    return 0;
}

Edited by author 22.10.2011 00:31

Ok. Thank you!