Search found 17 matches

by vpanait
Mon Oct 08, 2012 10:26 am
Forum: Volume 3 (300-399)
Topic: 371 - Ackermann Functions
Replies: 196
Views: 29419

Re: 371 - Ackermann Functions... Why WA????

i consider the problem statement a bit confusing, I got AC only after I've taken care that the input pair is ordered [L H]. Ex:
1 2
2 1
mean the same thing, and both are valid input.

enjoy
by vpanait
Fri Oct 05, 2012 2:37 pm
Forum: Volume 4 (400-499)
Topic: 414 - Machined Surfaces
Replies: 49
Views: 9269

Re: WA 414 pls help

For some strange reason the input tests contain lines that are different from "XX..X X...X"
In order to count the spaces, just iterate all the line and count them, do not rely on the X character at all.
by vpanait
Fri Oct 05, 2012 10:12 am
Forum: Volume 109 (10900-10999)
Topic: 10929 - You can say 11
Replies: 69
Views: 27096

Re: 10929 - You can say 11

maybe i am wrong.. but i think the input contains inputs like "011", and considers them valid, after considering these cases i got AC
i hate this kinds of problems, instead of focusing on the algo, you need to focus on how to parse strange input..
by vpanait
Thu Oct 04, 2012 10:34 am
Forum: Volume 104 (10400-10499)
Topic: 10405 - Longest Common Subsequence
Replies: 103
Views: 29996

Re: 10405 - Longest Common Subsequence

use fgets() to parse the input, I previously used "cin" that stops at "spaces" and was getting WA, so i presume "space" is a valid part of the input and needs to be processed
by vpanait
Wed Sep 19, 2012 9:31 am
Forum: Volume 103 (10300-10399)
Topic: 10342 - Always Late
Replies: 25
Views: 11142

Re: 10342 - Always Late

Other than the good advices so far, it is good to notice that this particular F-W problem has a particular good test-set. That is if you do not write F-W from the text book, you will get WA.
by vpanait
Mon Sep 10, 2012 12:50 pm
Forum: Bugs and suggestions
Topic: frozen status for - 702 - The Vindictive Coach
Replies: 2
Views: 2566

frozen status for - 702 - The Vindictive Coach

Hi I've submitted the answer for 702, 4 days ago, and still I did not receive any judgement from the online-judge. I've submitted other problems as well after this, and all other problems are judged but not 702. Resubmitting 702 does not fix this, I have now several instances of 702 waiting to be ju...
by vpanait
Sat Sep 08, 2012 2:54 pm
Forum: Bugs and suggestions
Topic: insufficient testset for problems 10039 and 10166
Replies: 2
Views: 2646

insufficient testset for problems 10039 and 10166

Hi admin, the algo for getting accepted for 10039 and 10166 is identical. Also both problems share the same issue with the test-set. I state this because I got AC with a code that does a simple BFS, however if I test the code on the following input: 5 Hamburg Frankfurt Darmstadt T1 T2 2 2 0900 Hambu...
by vpanait
Sat Sep 08, 2012 12:54 pm
Forum: Volume 100 (10000-10099)
Topic: 10044 - Erdos Numbers
Replies: 102
Views: 40259

Re: 10044 - Erdos Numbers

miserable problem statement, I got AC using a parse after {,} and {:} it may happen that "erdos" is actually not in the list, so you cannot do BFS, or it may happen that a name from the author's list, is also not in the original nodes. so if you use a hash to keep all names, just check if the "name"...
by vpanait
Sat Aug 04, 2012 10:21 am
Forum: Bugs and suggestions
Topic: Problems submitting 11957 - Checkers
Replies: 1
Views: 1871

Problems submitting 11957 - Checkers

Hi, I am unable to submit problem 11957 - Checkers.
It Compiles, Links and than it does not report anything ..
On my status it is presented as "in queue".
This problem is from yesterday night, and I hoped it will get resolved overnight.. It did not.

Thank you.
Regards
vlad
by vpanait
Thu Jul 19, 2012 3:55 pm
Forum: Volume 115 (11500-11599)
Topic: 11504 - Dominos
Replies: 55
Views: 21412

Re: 11504 - Dominos

Some advice for solving this - use STL as rarely as possible, I lost some time just profiling and replacing stl to C functions, here is some profile for the main stages of the code (the values are taken with clock() function, and represent the difference between the indication of clock() at the begi...
by vpanait
Tue Jul 17, 2012 4:55 pm
Forum: Volume 9 (900-999)
Topic: 929 - Number Maze
Replies: 92
Views: 40912

Re: 929 - Number Maze

In case of TLE, the only comment I've seen on the forum for improving the speed of problem 929, was to split the queue in 10x queues (based on the initial weight of the edges). This is a strange hack, that - to my understanding - may improve the speed performance only because 10x queues have a small...
by vpanait
Wed Jun 06, 2012 11:25 pm
Forum: Volume 100 (10000-10099)
Topic: 10099 - The Tourist Guide
Replies: 91
Views: 29385

Re: 10099 - The Tourist Guide

Note: the Guide has also to be on the bus, so do not forget to add him.. i did.. :)
by vpanait
Wed Jun 06, 2012 11:06 am
Forum: Bugs and suggestions
Topic: pb10000 - WA instead of PE
Replies: 2
Views: 2005

pb10000 - WA instead of PE

Hello,
in my humble opinion, pb10000 - longest path in a DAG, has a small issue.

Problem states "Print a new line after each test case.", however if the last "\n" is omitted it reports WA, instead of PE.

Regards
by vpanait
Sat May 12, 2012 5:23 pm
Forum: Bugs and suggestions
Topic: pb 310 WA by problemsolve.php
Replies: 1
Views: 2262

pb 310 WA by problemsolve.php

I think the pb 310 has some issues in http://www.uvatoolkit.com/problemssolve.php for example I input ab baa abbababb bbabbabbb that is: a - > ab b -> baa w = abbababb z = bbabbabbb if we expand w by the first rule we get <ab> bb <ab> b <ab> bb z is bb ab b ab bb so this should reply YES, however it...
by vpanait
Sat Apr 21, 2012 6:59 pm
Forum: Volume 5 (500-599)
Topic: 507 - Jill Rides Again
Replies: 92
Views: 30610

Re: 507 - Jill rides again

I got accepted, there are 2 tricky parts: 1. read carefully the statement "If more than one segment is maximally nice, choose the one with the longest cycle ride (largest j-i)." 2. pay attention that http://www.uvatoolkit.com wrongly solves the cases suggested by "avdtech", so you can compare most o...

Go to advanced search