Search found 39 matches

by aminallam
Fri Mar 01, 2013 4:01 pm
Forum: Off topic (General chit-chat)
Topic: ACM SIGMOD 2013 PROGRAMMING CONTEST
Replies: 1
Views: 27620

Re: ACM SIGMOD 2013 PROGRAMMING CONTEST

Now, the leaderboard is up! Join us.
by aminallam
Sat Jan 26, 2013 2:33 pm
Forum: Off topic (General chit-chat)
Topic: ACM SIGMOD 2013 PROGRAMMING CONTEST
Replies: 1
Views: 27620

ACM SIGMOD 2013 PROGRAMMING CONTEST

ACM SIGMOD 2013 PROGRAMMING CONTEST http://sigmod.kaust.edu.sa Student teams from degree granting institutions (both undergraduate and graduate) are invited to compete in the annual SIGMOD programming contest. The winning team will be awarded a prize of USD $5,000. Teams with the top-performing subm...
by aminallam
Sun Nov 25, 2007 5:00 pm
Forum: General
Topic: Speed difference
Replies: 1
Views: 2004

Speed difference

I would like to know the speed difference between running a solution on the old a new systems. In the past, I liked to make a code that runs in less than 2 seconds (as this was the real time limit intended by the most of the problem authors). In the new system, what should be equivalent to 2 seconds...
by aminallam
Sat Dec 30, 2006 1:26 pm
Forum: Volume 121 (12100-12199)
Topic: 12105 - Bigger is Better
Replies: 2
Views: 1877

I cannot submit it, because I use an array:
char D[50][101][3000];
But how can I avoid it, and get the path (the actual string number) at end?
by aminallam
Fri Dec 29, 2006 7:25 pm
Forum: Volume 121 (12100-12199)
Topic: 12105 - Bigger is Better
Replies: 2
Views: 1877

12105 - Bigger is Better

I wonder, where are the problems of the last 'hard' contest? And where is the forums related to it? I like to try submitting the problem 'Bigger is Better'. I have made a very fast code. I made a dynamic programming approach using C++ code, that is very fast on my machine. (but got TLE) I will be ha...
by aminallam
Fri Apr 14, 2006 7:00 pm
Forum: Volume 110 (11000-11099)
Topic: 11016 - Square Counting
Replies: 19
Views: 7147

These two questions are not related:
1) I would like to know how to make it using integers.
2) I will make a lot benefit from sweeping if there is a math formula to get number of grid squares inside a trapezoid with two edges parallel to x-axis.
by aminallam
Fri Apr 14, 2006 6:44 pm
Forum: Algorithms
Topic: LIS in O(nlog(k))
Replies: 7
Views: 4604

by aminallam
Mon Apr 03, 2006 9:13 pm
Forum: Volume 110 (11000-11099)
Topic: 11009 - Geometry Once Again
Replies: 4
Views: 2325

Thank you very much Mr. sclo for your time and effort.
I will try to think in it again using your valuable clues.
by aminallam
Sun Apr 02, 2006 11:25 pm
Forum: Volume 110 (11000-11099)
Topic: 11009 - Geometry Once Again
Replies: 4
Views: 2325

I am tired of thinking.
Can you give me an example of how to put an equation in this system?
Or please, direct me to a similar problem having discussions on it.
Thank you
by aminallam
Sun Apr 02, 2006 9:25 pm
Forum: Volume 110 (11000-11099)
Topic: 11016 - Square Counting
Replies: 19
Views: 7147

I am not good at designing test cases, but this may help: If you did not make these: 1) Ignore horizontal edges. 2) At each y, Compute edge intersection with the line Y=y, Y=y+1. Let the x cords xl, xr (where xl min of them, xr max). Edges are sorted by xl, and in tie by xr. xl, xr are double precis...
by aminallam
Sat Apr 01, 2006 12:52 pm
Forum: Volume 110 (11000-11099)
Topic: 11019 - Matrix Matcher
Replies: 43
Views: 17742

Can you help me further? I used something like these (in most computations) and got AC: hm2 [j]=((hm2[i-1][j]+MOD-(hm1[i-x][j]*po[x-1])%MOD)*AS+hm1 [j])%MOD; where MOD = 65521 How can I convert it using this trick of unsigned int? I have tried removing %MOD, and +MOD, and making all numbers in unsig...
by aminallam
Thu Mar 30, 2006 6:50 am
Forum: Volume 110 (11000-11099)
Topic: 11019 - Matrix Matcher
Replies: 43
Views: 17742

Also, I have used a small number (MOD=65529), so as to ensure that no overflow (using int) will occur (its square should fit in int). Is there a way to overcome this? I do not like to switch to long long computations as they are slow.
by aminallam
Thu Mar 30, 2006 6:47 am
Forum: Volume 110 (11000-11099)
Topic: 11009 - Geometry Once Again
Replies: 4
Views: 2325

11009 - Geometry Once Again

I need a hint to solve this problem.
by aminallam
Thu Mar 30, 2006 6:44 am
Forum: Volume 110 (11000-11099)
Topic: 11006 - Wheel Good
Replies: 12
Views: 5228

For Mr. tobby, if you have time, please describe the greedy approach.
by aminallam
Thu Mar 30, 2006 6:42 am
Forum: Volume 110 (11000-11099)
Topic: 11019 - Matrix Matcher
Replies: 43
Views: 17742

Thank you very much Mr. Emilio. I followed your advice and got AC. For Mr. Misof: I do not know how to use the trick of using unsigned int, and not using %. For example, consider this line: hm2 [j]=((hm2[i-1][j]+MOD-(hm1[i-x][j]*po[x-1])%MOD)*AS+hm1 [j])%MOD; How can I convert it using this trick? I...

Go to advanced search