## Search found 48 matches

Tue Jul 19, 2016 6:12 am
Forum: Volume 103 (10300-10399)
Topic: 10317 - Equating Equations
Replies: 13
Views: 6647

### Re: 10317 - Equating Equations

I'm getting WA with a seemingly correct code: /* * 10317. Equating Equations * TOPIC: recursion * status: TLE */ import java.io.*; import java.util.*; import java.util.regex.*; class Main { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bw = new BufferedWrit...
Wed May 11, 2016 5:50 am
Forum: Volume 125 (12500-12599)
Topic: 12552 - The Moon of Valencia
Replies: 1
Views: 1371

### Re: 12552 - The Moon of Valencia

My code passes all the official test cases -- checked by the SWERC judge's checker, but I get WA on UVa. I believe there is something wrong with the UVa side. The Judge IO is http://users.dsic.upv.es/swerc_12/problems.php

EDIT: even the official solution from the above resource gets WA.
Sat Apr 02, 2016 3:26 pm
Forum: Volume 11 (1100-1199)
Topic: 1102 - Affine Mess
Replies: 1
Views: 1675

### Re: 1102 - Affine Mess

Anyone cares to show me the inconsistent transformations (at least two) for this case?

Code: Select all

0 -3 0 2 0 1
110 90 -115 -48 -115 -94
0 0 0 0 0 0

My code answers "equivalent solutions", but the correct answer is supposed to be "inconsistent solutions".
Thu Mar 03, 2016 5:27 pm
Forum: Volume 8 (800-899)
Topic: 801 - Flight Planning
Replies: 2
Views: 3604

### Re: 801 - Flight Planning

To my experience, this problem may feature more than 9 legs, and require rounding up instead of "to the nearest gallon". After changing these I got AC.
Mon Feb 22, 2016 5:17 am
Forum: Volume 10 (1000-1099)
Topic: 1092 - Tracking Bio-bots
Replies: 2
Views: 2232

### Re: 1092 - Tracking Bio-bots

For input (picture attached) 30 30 13 18 10 22 10 22 10 27 10 9 3 16 3 3 26 19 26 9 17 22 17 27 10 27 10 11 25 18 25 22 5 27 5 26 10 27 10 25 9 27 9 9 2 11 2 6 27 7 27 26 17 27 17 0 0 0 the correct output should be "15", but udebug outputs "11". Assuming udebug features accepted solutions, someone c...
Sat Feb 06, 2016 4:33 pm
Forum: Volume 2 (200-299)
Topic: 205 - Getting There
Replies: 13
Views: 3949

### Re: 205 - Getting There

What is the correct output for TRAVEL 35 yuqywldlcf mbspttle 07:29A 04:35A 0.84 etwuuug bukxeuwmrnr 11:07A 07:10A 1.54 powpc bukxeuwmrnr 06:47P 03:31P 0.65 rpjjkbsjfrhidp fzkkbxopfi 03:56A 08:28A 9.36 etwuuug mbspttle 09:57P 02:31P 8.02 bukxeuwmrnr nangtq 05:10A 06:10A 1.52 flpsfgkmje mxzdrwv 03:45P...
Thu Feb 04, 2016 7:57 pm
Forum: Volume 2 (200-299)
Topic: 205 - Getting There
Replies: 13
Views: 3949

### Re: 205 - Getting There

I do a Dijkstra over a certain search space, where each state is a pair (p,t) -- place & current time. d[(p,t)] is a structure that keeps the least amount of time spent to get into city p at time instant t, or, in case of equal amount of time spent, the least amount of money spent. (we are optimizin...
Tue Jan 26, 2016 3:10 pm
Forum: Volume 15 (1500-1599)
Topic: 1541 - To Bet or Not To Bet
Replies: 1
Views: 2002

### Re: 1541 - To Bet or Not To Bet

What does "Loosing a Turn" mean? Say in my k-th turn I toss a coin and make the appropriate jump and land on an "L" cell. Does this mean my next turn will also be k-th, not (k+1)-th?
Mon Jan 11, 2016 5:20 am
Forum: Volume 107 (10700-10799)
Topic: 10754 - Fantastic Sequence
Replies: 16
Views: 10929

### Re: 10754 - Fantastic Sequence

I do so wonder whether the formula in the problem statement is wrong? Should it be a_n = \sum_{i=1}^{k}c_i\times{a_{n-i}}+c_{k+1}\times(n\geq k)?
Sat Jan 02, 2016 11:01 am
Forum: Volume 11 (1100-1199)
Topic: 1123 - Crazy Search
Replies: 1
Views: 796

### Re: 1123 - Crazy Search

What is the correct output for the following? udebug.com sort of RTEs on this ("Input format is wrong: it says). 13 7 26 abcdefghijklmnopqrstuvwxyzwanrlhsowrbgsszpuhffroyjsfrvthjxlyvndxsfulsnopzvdvmuwrsadeoemthyjzzatpyddlrhtmdnpyokzeqmtrnapexrbfubndnocwejumkieouttsrehfeljmpowamttyfwdqrjkhbhfwhwuknos...
Sun Dec 13, 2015 4:34 pm
Forum: Volume 11 (1100-1199)
Replies: 1
Views: 1421

The judge data may be incomplete. For instance for the input

Code: Select all

6
1 2
2 3
3 1
4 5
5 6
6 4
6
1 2
2 3
3 1
5 6
6 7
7 5

the answer should be "4 9" for both cases. udebug.com outputs "2 15", however, obviously assuming that the input graph is always complete, which may not be the case in general.
Sun Nov 29, 2015 11:28 am
Forum: Volume 116 (11600-11699)
Topic: 11670 - Physics Experiment
Replies: 0
Views: 3539

### Re: 11670 - Physics Experiment

OK I understand this is about binary search. My question: is the following a correct, equivalent reformulation of the problem? Find the smallest time t such that there exists at least one scenario where all the particles become heated up at timestamp t, but for any t-eps such a scenario does not exi...
Thu Nov 26, 2015 6:44 am
Forum: Volume 10 (1000-1099)
Topic: 1064 - Network
Replies: 6
Views: 5358

### Re: 1064 - Network

Code: Select all

3 9
5 5 5
1 4 4
2 3 4
2 1 2
3 1 1
1 1 3
2 5 5
3 4 5
3 2 3
1 5 5
0 0

can be 6? For ordering "2 1 3" I'm getting 5.
Tue Oct 27, 2015 4:24 am
Forum: Volume 12 (1200-1299)
Topic: 1212 - Duopoly
Replies: 0
Views: 1049

### Re: 1212 - Duopoly

Does one need a specialized maxflow for this particular problem? I coded the usual Dinic and getting TLE.
Mon Oct 26, 2015 2:21 pm
Forum: Volume 4 (400-499)
Topic: 431 - Trial of the Millennium
Replies: 13
Views: 6371

### Re: 431 - Trial of the Millennium

I'm getting WA for this: /* * 431. Trial of the Millenium * TOPIC: dp * status: */ #include <assert.h> #include <ctype.h> #include <math.h> #include <stdio.h> #include <stdlib.h> #include <string.h> #define N 0x80 #define MAXT BIT(9) #define FG (ptr = fgets(buff,sizeof buff,stdin)) #define oo 0xffff...