| Показать все ветки Спрятать все ветки Показать все сообщения Спрятать все сообщения |
| To admins. Try rejudge. | Birne Ageev [USU] (Psych up club) | 1041. Никифор | 13 сен 2013 00:16 | 1 |
I got AC with incorrect checker of linear independence.
Please, add this test:
6 3
6 0 0
3 0 0
0 5 0
0 2 0
0 0 4
0 0 1
6
5
4
3
2
1 |
| WA 66 | thitgaluoc | 1937. Орган Дейви Джонса | 12 сен 2013 22:55 | 1 |
WA 66 thitgaluoc 12 сен 2013 22:55
Edited by author 13.09.2013 22:11
you should check palindrome first
Edited by author 23.09.2013 21:39 |
| if u have WA#5 | Vladimir Plyashkun [USU] | 1534. Гондорский футбол | 12 сен 2013 13:22 | 1 |
try this test
2 1 1
answear is 3 3 |
| WHY Crash (access violation) on test 5. Please help me. | ahmedov | 1646. Годзилла возвращается! | 11 сен 2013 12:55 | 2 |
WHY Crash (access violation) on test 5. Please help me. length of array must be m+2 (two DNAs of the mutant pangolins, which were initially in the bank) |
| 1646 wa9 | R1d1 | 1646. Годзилла возвращается! | 11 сен 2013 12:52 | 2 |
godzillagodzilla
godz
illa
4
1 2
3 3
4 4
5 5
Edited by author 05.08.2009 18:11
Edited by author 05.08.2009 18:11 |
| STL::set work fast :D | Alex Vistyazh [Ivye School] | 1425. Ферзь 2 | 10 сен 2013 17:35 | 1 |
I use set when solve this task :D
And i have AC with 2.453s
But hashes work faster 0.625s (sorry for my bad english)
Edited by author 10.09.2013 21:09 |
| WA#2 | Alexander Samal | 1131. Копирование | 10 сен 2013 06:10 | 2 |
WA#2 Alexander Samal 16 авг 2009 13:43 I had the same problem and my mistake was treating n as always a power of 2, thus doing some extra work in the last step. Revise your code for that. Hope this helps. |
| What is the second test? | Kraun | 1131. Копирование | 10 сен 2013 05:59 | 1 |
Please help, I feel that I got the correct idea. |
| A mistake in the example. | asiorx22 | 1820. Уральские бифштексы | 10 сен 2013 01:58 | 2 |
Just think about it. In the example there are three steaks, and only two can be cooked at the same time. It would take two minutes to cook both sides of the first pair and another two to prepare the last steak. In total it makes four. I'm just curious, did the author mistype or is there an actual mistake in the program. Sample is correct, find the mistake in your logic. |
| Matching solution? | AlexandruValeanu | 1109. Конференция | 9 сен 2013 21:04 | 1 |
I've tried a solution usind a matching algorithm and my answer is match + every_node that is not part of the match and I have WA. Can someone explain me how to do this problem?
LE: I got it! Never mind!
Edited by author 09.09.2013 21:06 |
| test 3 | Seroj RAU | 1584. Тайны фараонов | 9 сен 2013 19:14 | 2 |
test 3 Seroj RAU 28 ноя 2010 18:16 6 10
ababaabaab
ababbbbbbb
baaaaababb
bbaaabbaba
bbbbabbabb
abbbaaaaaa
answer: 14
Good luck! |
| Помогите с 6 тестом... | Nakatengga | 1971. Настройки графики | 8 сен 2013 18:43 | 2 |
Совсем не могу понять почему не проходит 6 тест, проблема у меня не 59,9 как было у другого задовавшего вопрос... lual.ru
Edited by author 08.09.2013 18:45 |
| WA 1 help!!! | Alexandr-pro | 1209. 1, 10, 100, 1000... | 7 сен 2013 18:27 | 1 |
#include <stdio.h>
#define c 65535
int main()
{
long long k = 0;
long long a[c];
long n = 0,i,ot[c],j,t;
a[0]=1;
for (i=1; i<=c; i++)
{
a[i]=a[i-1]+i;
}
scanf("%ld",&n);
for (i=0; i<n; i++)
{
scanf("%lld",&k);
for (j=0; j<c; j++)
{
t=0;
if (a[j]==k)
{
t=1;
break;
}
}
ot[i]=t;
}
for (i=0; i<n; i++)
{
printf("%ld ",ot[i]);
}
return 0;
}
|
| If you WA #9, check if point A ≡ (coincides with) point B | Ilian | 1075. Нитка в пространстве | 6 сен 2013 22:08 | 1 |
That's how I get AC after so much time.
Edited by author 06.09.2013 22:11 |
| Fast solution | Hallelujah | 1872. Просторный офис | 6 сен 2013 11:55 | 4 |
For solving this problem I used advanced bipartite graph theory. But it work slowly(about 0.6sec). Very interesting how solve more quickly. Please, give me some hints.(My e-mail: scarlet.flower@list.ru) Maximum matchings in bipartite graph is almost enough to solve it + some "magic" :)
Maybe maximum flow algos' works better here...
My complexity was O(V*E), 0.3sec Also, O(NlogN) solution exists |
| 2 ADMINS: timus C# megacompiler, weak tests or bug in checker??? | Vedernikoff 'Goryinyich' Sergey (HSE: АОП) | 1953. Наибольший вписанный эллипс | 4 сен 2013 19:47 | 2 |
On my VS 2012 C# compiler on test
1000 1000 1000
my program's output is
0.0000143861 288.6751345948
which doesn't seem to fit into precision (from the solution correctness criteria). But AC on timus under VS 2010 C# compiler.
Just interesting: there is no such test, timus VS 2010 is better than my VS 2012, or checker checks not equality of both numbers in output and answer, but some more weird thing? There was incorrect checker, it checked with precision 10^-4.
It fixed now, all solutions were rejudged, 7 authors lost their AC. |
| What is test #19? | Artyom -178 RUS- | 1510. Порядок | 4 сен 2013 12:22 | 1 |
|
| Counter example for 3D convex hull algorithm | [MF] Radomir Djokovic | 1062. Триатлон | 4 сен 2013 04:34 | 3 |
I think I found counter example for this, ie. set of points of which one is inside the 3D convex hull, but it's appropriate contenstant can win. If we are given for contestant with following speeds:
1 1 2
1 1 4
100 1 3
1 100 3
20 20 3
If we choose paths of length 100, 100, 3, than last contestant (20, 20, 3) can win with time 100/20 + 100/20 + 3/3 = 11. But, for this points 3D convex hull consists of (1, 1, 2), (1, 1, 4), (100, 1, 3) and (1, 100, 3).
Does anyone know if I'm wrong and why? Consider that the sum of swim,bike and run is a const number,so we can let the total s=1,then we can solve it for 2D convex hull alogrithm rather than 3D. You should use reciprocals of speeds (preferably multiplied by some constant) as coordinates, but not just the speeds. After applying such an "inversion" to the points in your example, the last one jumps out of the convex hull formed by others. |
| wa 7 | Mikron | 1283. Гномик | 4 сен 2013 01:11 | 2 |
wa 7 Mikron 12 июл 2013 19:08 why wa #7
please help(
#include <stdio.h>
int main(void)
{
int s;
int p;
float zo;
int t = 0;
scanf("%f",&zo);
scanf("%d",&s);
scanf("%d",&p);
while(zo>s){
zo -= zo*p/100;
++t;
}
printf("%d",t);
return 0;
} use float instead of int for s and you will get AC |
| why wa on test 8 | tyomitch | 1552. Brainfuck | 3 сен 2013 22:27 | 2 |
It's the first test where more than one memory cell needs to be modified.
Do I miss something in the problem statement?
E.g. is this test correct?
azkazkazkazkazkazkazoazv
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
+++++++++++++++++.+++++++++++++++++++++++++.<+++++++++++++++++++++++++++++++++++
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++.>>+++++
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
++++++++++++.<.<.>>.<.<.>>.<.<.>>.<.<.>>.<.<.>>.<.<++++.>>.<.----. Try this test:
azqhazqhazqhazqhazqhazqhazqhazqhazqhazqhazqhazqh
My answer:
+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++.+++++++++++++++++++++++++.<+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++.<++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++.<+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++.>>>.<.<.<.>>>.<.<.<.>>>.<.<.<.>>>.<.<.<.>>>.<.<.<.>>>.<.<.<.>>>.<.<.<.>>>.<.<.<.>>>.<.<.<.>>>.<.<.<.>>>.<.<.
|
