Search found 111 matches

by arsalan_mousavian
Mon Feb 26, 2007 4:28 pm
Forum: Volume 111 (11100-11199)
Topic: 11184 - Joyful Ride
Replies: 11
Views: 7245

i think i solved the problem in O(N^2) but i've got TLE, does anybody know any faster algorithm?
by arsalan_mousavian
Mon Feb 26, 2007 3:41 pm
Forum: Volume 111 (11100-11199)
Topic: 11178 - Morley's Theorem
Replies: 2
Views: 1808

thanks a lot, i found my mistake, Accepted
by arsalan_mousavian
Mon Feb 26, 2007 1:23 pm
Forum: Volume 111 (11100-11199)
Topic: 11178 - Morley's Theorem
Replies: 2
Views: 1808

11178 - Morley's Theorem

can somebody post some IO, i've got WA on this problem

thanks in Advance
Arsalan
by arsalan_mousavian
Mon Feb 26, 2007 1:20 pm
Forum: Volume 111 (11100-11199)
Topic: 11183 - Teen Girl Squad
Replies: 28
Views: 13102

sclo wrote:This is the directed minimum spanning tree problem.
during the contest i have figured out that the problem could be solved with MST, but i have one problems, is it enough to start MST algorithm from the vertex which indegree is 0, or it has some blind spots?
thanks in Advance...
by arsalan_mousavian
Sat Dec 30, 2006 9:17 pm
Forum: Volume 111 (11100-11199)
Topic: 11150 - Cola
Replies: 43
Views: 23062

11150 - Cola

can somebody tell me what is the correct output for my input ?

Code: Select all

1
2
3
4
5
6
7
8
9
10
15
20
30
40
50
100
150
190
199
200

Code: Select all

2
3
5
6
8
9
11
12
14
15
23
30
45
60
75
150
225
285
299
300
thanks
by arsalan_mousavian
Tue Dec 19, 2006 8:37 pm
Forum: Volume 111 (11100-11199)
Topic: 11142 - MineSweeper II
Replies: 10
Views: 4056

as in my input it is mentioned that there will be 7 bombs in the map then your solution is completely wrong,
by arsalan_mousavian
Mon Dec 18, 2006 11:49 pm
Forum: Volume 111 (11100-11199)
Topic: 11142 - MineSweeper II
Replies: 10
Views: 4056

few months ago that i was in the mood for solving this problem, i've got many WAs :wink:
i think the only solutions are

Code: Select all

1XX
2.X
2XX
X.X

1XX
2.X
2XX
.XX
the only way you can put 7 bombs on the board, and i don't think there will be another valid solution with 7 bombs for this map,
by arsalan_mousavian
Mon Oct 30, 2006 1:30 pm
Forum: Volume 111 (11100-11199)
Topic: 11142 - MineSweeper II
Replies: 10
Views: 4056

can't anybody help me ? :o
by arsalan_mousavian
Mon Oct 30, 2006 1:17 pm
Forum: Volume 111 (11100-11199)
Topic: 11144 - S.O.S.
Replies: 13
Views: 5025

//cut off
by arsalan_mousavian
Sun Oct 29, 2006 11:28 pm
Forum: Volume 111 (11100-11199)
Topic: 11142 - MineSweeper II
Replies: 10
Views: 4056

my program handles your Cases ( because they are much easier than mine :wink: ), which input is incorrect ? all of them are valid ,
by arsalan_mousavian
Sun Oct 29, 2006 4:11 pm
Forum: Volume 111 (11100-11199)
Topic: 11142 - MineSweeper II
Replies: 10
Views: 4056

11142 - MineSweeper II

i've got many WA on this problem , can somebody post some IO ? i think my program works for following testcases 5 4 3 6 1.. 2.. 2.. ... 4 3 7 1.. 2.. 2.. ... 5 5 25 ..... ..... ..... ..... ..... 1 3 1 1.. 1 3 2 1.. Case #1: 1.. 2.. 2X. ... Case #2: 1XX 2.X 2XX ..X Case #3: XXXXX XXXXX XXXXX XXXXX XX...
by arsalan_mousavian
Fri Oct 27, 2006 6:50 pm
Forum: Volume 111 (11100-11199)
Topic: 11140 - Little Ali's Little Brother!
Replies: 28
Views: 14153

Code: Select all

1
5 5 2
....*
...**
..***
...**
....*
6 6
......
......
......
..*...
......
......
the answer shoould be

Code: Select all

Yes
by arsalan_mousavian
Tue Oct 24, 2006 1:42 pm
Forum: C++
Topic: deleting from multiset container
Replies: 3
Views: 2064

Artikali wrote:inserting complexity O(n) or O(lgn)?
inserting and deleting in multiset and set and also map and multimap is o(Nlg N) , because they are implemented by RB tree
by arsalan_mousavian
Tue Oct 24, 2006 9:27 am
Forum: C++
Topic: deleting from multiset container
Replies: 3
Views: 2064

Re: deleting from multiset container

How can i delete from multiset container is there any function. i only need delete first and last elements inserting element in multiset container is O(n) or o(lgn)? thanks mutiset<int> S ; multiset<int>S::iterator itr ; S.erase ( itr ) ;// this function erase the elemnt that is pointed to itr in o...
by arsalan_mousavian
Tue Oct 24, 2006 9:22 am
Forum: Volume 111 (11100-11199)
Topic: 11136 - Hoax or what
Replies: 31
Views: 17894

About STL not timing out - did you use cin to read the input? I used Java's TreeSet with some modifications during the real contest, but it was TLE when I used Scanner but got AC when I used BufferedReader, which was probably generous of them, I don't know. I don't think that solving problems shoul...

Go to advanced search