| Show all threads Hide all threads Show all messages Hide all messages |
| HINT | Dhaval Rathod | 1742. Team building | 15 Mar 2024 22:33 | 2 |
HINT Dhaval Rathod 26 Feb 2022 23:07 first make a SCC , u will get max
iterate through scc graph root nodes and in dfs the node size is great than 2 increment answer u will get min is great than 2 no, great than 1! I got AC using it |
| test 4 | Enots: Revolution | 1742. Team building | 1 Jan 2022 12:08 | 5 |
test 4 Enots: Revolution 24 Jan 2010 08:52 What is test nubmer 4? Anybody know? Re: test 4 Zayakin Andrey[PermSU] 24 Jan 2010 13:23 maybe
6
1
1
1
1
1
1
My program can`t pass this test and i have WA4. It's like this:
15
2 5 6 3 8 2 3 6 10 10 12 13 14 15 11
The right answer is:
5 8
Edited by author 24.01.2010 23:08 No the right answer is
3 8 |
| WA8 need help | Harshita Sharma | 1742. Team building | 7 Nov 2021 17:49 | 1 |
I keep getting WA8 but I don't have any test cases that may go wrong. Please help. |
| How to find minimum teams using SCC? | ajay jadhav | 1742. Team building | 14 May 2020 20:45 | 1 |
I got AC for maximum temas using Kosaraju.
and for minimum I started with nodes with no incoming edge and searched until it hit previously found node (cycle) this is 1 team.
For disconnected cycles, run dfs in similar fashion incrementing teams by 1. |
| Hint | Ishmeet Singh Saggu | 1742. Team building | 14 May 2020 19:47 | 2 |
Hint Ishmeet Singh Saggu 28 Apr 2020 22:51 This question requires knowledge of Strongly Connected Component. If you don't know read about it.
Good Luck !!! for max = number of strongly connected components.
for min = ? |
| how to get ac in 0.031 sec? | muhammad | 1742. Team building | 6 Dec 2016 15:06 | 4 |
i just found no of storngly connected components and got ac in 0.562 sec after eliminating stack overflow with pragma.
how to make it so fast as 0.031 sec and so little memory? You don't have to find strongly connected components. You can just sort vertices topologically and here you will find an answer :) But for topological sorting, graph must be DAG(directed acyclic)? i just keep getting stack overflow,could you please tell me how to eliminate it? |
| TEST for WA9 | lallala | 1742. Team building | 9 Feb 2016 01:03 | 1 |
|
| to get AC you might want to use this formulas | esbybb | 1742. Team building | 26 Sep 2015 18:01 | 1 |
min = leaves + disconnectedCycles
max = acyclicNodes + disconnectedCycles + connectedCycles |
| Some tests for #WA7 and #WA8 | Pinky | 1742. Team building | 11 Apr 2015 21:17 | 1 |
May be this tests can help you, my friends:
7
4 4 4 5 6 7 5
Answer: 3 5
5
4 4 4 5 5
Answer: 3 5
10
2 3 4 1 1 2 3 4 7 9
Answer: 4 7
Good luck!
Edited by author 11.04.2015 21:18 |
| #pragma is useful ! | 吕蒙子明 | 1742. Team building | 4 Oct 2012 13:10 | 1 |
|
| WA 2 | minib00mpola | 1742. Team building | 4 Oct 2012 13:09 | 2 |
WA 2 minib00mpola 12 Dec 2011 21:08 Does anyone know what second test might be like?
I pass all tests posted here, but can't solve this.
Thanks. |
| Stack overflow? | MOPDOBOPOT (USU) | 1742. Team building | 31 Aug 2012 16:51 | 1 |
If you have problems with size of program stack just read FAQ and use special directives :)
In pascal it is {$M 16777216} |
| tricky problem | scythe | 1742. Team building | 6 Mar 2012 04:34 | 1 |
This was one of the hardest problem i implemented ( conceptually was simple ), adhoc solution, corner cases ( i had to rewrite the solution a couple of times ).
Good luck with it. |
| tricky problem | scythe | 1742. Team building | 6 Mar 2012 04:34 | 1 |
This was one of the hardest problem i implemented ( conceptually was simple ), adhoc solution, corner cases ( i had to rewrite the solution a couple of times ).
Good luck with it.
Edited by author 06.03.2012 04:35 |
| Need help; keep getting WA 7 | vlyubin | 1742. Team building | 25 Jan 2012 10:02 | 1 |
Hi!
I have tested my program for about 30 min. and still cannot find what is wrong with it. I keep getting WA 7. Can you please give a hint of what may be a reason or point some tricky part that I missed?
Thanks ! |
| hint: use dot (+) | ASK | 1742. Team building | 14 Nov 2010 02:34 | 1 |
Use dot from http://www.graphviz.org/ to test with random graphs, e.g., 21 1 2 1 2 1 2 5 3 4 3 4 5 6 5 4 3 5 1 2 7 20 #13 21 |
| WA7 | Paval Marius | 1742. Team building | 25 Oct 2010 18:01 | 1 |
WA7 Paval Marius 25 Oct 2010 18:01 Can I have a sample input that would pass test 7? thanks |
| WA5 | fuch_prog_er | 1742. Team building | 6 Feb 2010 21:35 | 1 |
WA5 fuch_prog_er 6 Feb 2010 21:35 Hello,
I've WA5 can you give me some tests,please? |
