Search found 9 matches

by Jucovschi Constantin
Sun Jan 12, 2003 7:29 pm
Forum: Volume 103 (10300-10399)
Topic: 10330 - Power Transmission
Replies: 43
Views: 16446

10330 - Power Transmission

Hi, This problems seems to be just a maximum flow problem but I cannot make it run in Time Limit. I tried 3 algorithms 1) Using breadth search 2) using depth search 3) preflux method. Still nothing . How to do it in time limit ? I make a graph of max 202 vertices. I double every regulator for being ...
by Jucovschi Constantin
Sat Jan 11, 2003 7:01 pm
Forum: Volume 103 (10300-10399)
Topic: 10340 - All in All
Replies: 129
Views: 33821

Try this test

Code: Select all

sea esa
Your program says "YES"
by Jucovschi Constantin
Fri Jan 10, 2003 7:30 pm
Forum: Volume 102 (10200-10299)
Topic: 10201 - Adventures in Moving - Part IV
Replies: 23
Views: 11905

I think Even is right for the following inputs 10 500 100 1 300 1 350 1 501 10 101 100 100 102 1 100 101 200 100 10 201 100 10 201 101 10 50 25 10 150 100 10 151 20 150 100 10 151 20 152 1 I get the results 970 301 Impossible Impossible 2000 Impossible Impossible 500 1500 622 Am I right ? I get WA ?
by Jucovschi Constantin
Tue Jan 07, 2003 7:33 pm
Forum: Volume 103 (10300-10399)
Topic: 10311 - Goldbach and Euler
Replies: 98
Views: 24131

Primality Tests

Hi,

How to generate all prime numbers in interval 2-50.000.000 fastly ? I can do it in almost 8 sec but it's not enough.

Or how to solve the problem in 10 sec ?
by Jucovschi Constantin
Wed Nov 27, 2002 7:23 pm
Forum: Volume 103 (10300-10399)
Topic: 10381 - The Rock
Replies: 8
Views: 3962

I tried to get my program accepted but I couldnt. I will write my idea, maybe it is wrong. Consider the path consists of positions a1, a2, a3, .. an with a1=entrance. Suppose we delete position ai (it is the unknown wall) we have to reconstruct the path as a1, a2, a3 .. a(i-1) b1 b2 .. an. Sure b1, ...
by Jucovschi Constantin
Fri Nov 15, 2002 6:20 pm
Forum: Volume 103 (10300-10399)
Topic: 10381 - The Rock
Replies: 8
Views: 3962

10381 - The Rock

Hi. When I submit my program it gets WA. Can somebody check whether my program gives the correct answer for the following tests? Are there any tricky tests? Id appreciate any tests for checking my program 3 5 18 X..#.#............ .#.....##..#....#. ..#..#.#..#.#..#.. .#.##.##.#...##... .....E.........
by Jucovschi Constantin
Sun Nov 03, 2002 6:36 pm
Forum: Volume 3 (300-399)
Topic: 301 - Transportation
Replies: 13
Views: 5135

How to solve 301 in time 0.00

How to solve 301 in time 0.00

I've tried some kind of opptimized backtracking and it run for 4.661 sec.

How to make this time 0.00 ?

Is there any other method ?
by Jucovschi Constantin
Sun Oct 27, 2002 8:52 pm
Forum: Volume 103 (10300-10399)
Topic: 10385 - Duathlon
Replies: 16
Views: 7345

10385 - Duathlon

How to solve 10385
by Jucovschi Constantin
Sat Oct 26, 2002 6:35 pm
Forum: Volume 2 (200-299)
Topic: 218 - Moth Eradication
Replies: 60
Views: 11447

218 WHY WA

Hello I've tested all tests that were on the previous pages and all are correct. I don't understand why I get WA :x :x [c]#include <stdio.h> #include <memory.h> #include <math.h> #include <stdlib.h> #define max 50000 typedef struct { float x,y; } point; int n, first, choosen, k, region=0, i; point r...

Go to advanced search