OJ Board

Posted: **Sun Apr 17, 2011 4:21 pm**

Removed After AC

Posted: **Mon Apr 18, 2011 2:56 am**

i haven't solve it yet but i think 100000*100000 is too large

Code: Select all

for(int i=2;i<=nod;i++)
      {
         dfs(i);
         //color[1]=false;
         for(int j=2;j<=nod;j++)
         {
            ...
         }
      }

And there is a recommended in this problem.

Input is huge. So, faster I/O methods (e.g. scanf, printf, BufferedReader, BufferedWriter) are recommended.

p.s: hope it help

OJ Board

11981 - Corrupted Friendship

11981 - Corrupted Friendship

Re: 11981 TLE :( please help me