Search found 251 matches

by serur
Sat Dec 12, 2009 5:34 pm
Forum: Volume 113 (11300-11399)
Topic: 11319 - Stupid Sequence
Replies: 19
Views: 8241

Re: 11319 - Stupid Sequence

I did exactly what sunny suggested; the main problem with my solution was rounding. AC.
by serur
Thu Dec 03, 2009 8:31 pm
Forum: Volume 113 (11300-11399)
Topic: 11372 - Arranging a Contest
Replies: 13
Views: 4663

Re: 11372 - Arranging a Contest

I say, there may be at most 4 dp-problems, at most 3 math, at most 3 graph, and at most 2 "other" problems. So it is enough if we choose <=2 problems of each type for each difficulty level, indeed arriving at <= 24 problems among which to choose. This problem is more about common sense than programm...
by serur
Sat Nov 07, 2009 8:43 pm
Forum: Volume 116 (11600-11699)
Topic: 11637 - Garbage Remembering Exam
Replies: 1
Views: 2249

Re: 11637 - Garbage Remembering Exam

Any hints on this problem?
by serur
Fri Nov 06, 2009 6:50 am
Forum: Volume 116 (11600-11699)
Topic: 11635 - Hotel booking
Replies: 39
Views: 11516

11635 - Hotel booking

I'm getting RE for this... /* * ``Hotel Booking'' */ #include <algorithm> #include <cctype> #include <cassert> #include <cstdio> #include <cstdlib> #include <cstring> #include <iostream> #include <vector> using namespace std; #define N 10001 #define TEN_HOURS (10*60) #define Q (1UL << 21) #define MA...
by serur
Sun Nov 01, 2009 8:41 pm
Forum: Volume 117 (11700-11799)
Topic: 11708 - Lexicographical ranking
Replies: 2
Views: 2408

11708 - Lexicographical ranking

Some I/O would be appreciated
by serur
Thu Oct 29, 2009 8:38 pm
Forum: Volume 117 (11700-11799)
Topic: 11705 - Grasshopper
Replies: 5
Views: 2733

Re: 11705 -- Grasshopper

Thanks Mark. Got AC now :)
by serur
Tue Oct 27, 2009 6:07 pm
Forum: Volume 117 (11700-11799)
Topic: 11705 - Grasshopper
Replies: 5
Views: 2733

11705 - Grasshopper

I did a bfs from northwest corner (cell (0,0)) and then output the "move" array. Now, how to handle ties?
For I couldn't understand that "northmost and westmost" thing.
Thanks!
by serur
Mon Oct 05, 2009 5:31 am
Forum: Volume 101 (10100-10199)
Topic: 10109 - Solving Systems of Linear Equations
Replies: 18
Views: 8880

Re: 10109 - Solving Systems of Linear Equations

Hi there! This my code gets RE. Now why? /* * `Solving Systems of Linear Equations' */ #include <assert.h> #include <ctype.h> #include <math.h> #include <stdio.h> #include <stdlib.h> #include <string.h> #define tol 1e-7 #ifdef _MSC_VER typedef __int64 i64; typedef unsigned __int64 u64; #else typedef...
by serur
Sat Sep 12, 2009 8:36 pm
Forum: Volume 103 (10300-10399)
Topic: 10385 - Duathlon
Replies: 16
Views: 7224

Re: 10385 - Duathlon

Thanks coze, your suggestion was the very thing. Got it AC at last :)
by serur
Tue Sep 08, 2009 8:47 pm
Forum: Volume 103 (10300-10399)
Topic: 10385 - Duathlon
Replies: 16
Views: 7224

Re: 10385 - Duathlon

Thanks coze. This is my source code, it gets WA. What I did is a ternary search...

Code: Select all

CUT AFTER AC
by serur
Mon Sep 07, 2009 7:25 pm
Forum: Volume 103 (10300-10399)
Topic: 10385 - Duathlon
Replies: 16
Views: 7224

Re: 10385 - Duathlon

What's the output for this?

Code: Select all

100
1
2 3

7
2
3 4
4 3

100
9
25 20
40 12
37 23
9 49
17 19
33 5
67 3
34 11
21 30
by serur
Sun Aug 16, 2009 8:55 am
Forum: Volume 7 (700-799)
Topic: 718 - Skyscraper Floors
Replies: 8
Views: 5837

Re: 718 - Skyscraper Floors

Your opinion on this code is appreciated /* * `Scyscraper Floors' */ #include <assert.h> #include <stdio.h> #include <stdlib.h> #include <string.h> #define N 0x80 #ifdef _MSC_VER typedef __int64 i64; #else typedef long long i64; #endif i64 m,g[N][N], can_reach_a[N], can_reach_b[N]; i64 x[N],y[N],a,b...
by serur
Wed Aug 12, 2009 10:23 am
Forum: Volume 105 (10500-10599)
Topic: 10510 - Cactus
Replies: 31
Views: 22946

Re: 10510 - Cactus

After deciding whether the graph is strongly connected, we need to check if it is singly connected: there are no two simple paths
sharing the same origin and the same end...
by serur
Sat Jun 27, 2009 7:30 pm
Forum: Volume 113 (11300-11399)
Topic: 11324 - The Largest Clique
Replies: 11
Views: 6727

Re: 11324 - The Largest Clique

IMHO, `chain' would have been more appropriate, rather than `clique'.
by serur
Thu Jun 25, 2009 7:59 pm
Forum: Volume 112 (11200-11299)
Topic: 11294 - Wedding
Replies: 21
Views: 8951

Re: 11294 - Wedding

The tricky part is to impose a condition that the bride herself seats in the same side of the table....

Go to advanced search