## Search found 17 matches

Wed Sep 24, 2014 11:53 pm
Forum: Volume 11 (1100-1199)
Topic: 1111 - Trash Removal
Replies: 1
Views: 1372

### Re: 1111 - Trash Removal

Can I have some I/O, please?
Mon Sep 15, 2014 5:49 pm
Forum: Volume 12 (1200-1299)
Topic: 1254 - Top 10
Replies: 4
Views: 2287

### Re: 1254 - Top 10

Can I have some tests, please?
Thu Aug 21, 2014 3:54 pm
Forum: Volume 111 (11100-11199)
Topic: 11167 - Monkeys in the Emei Mountain
Replies: 30
Views: 16301

### Re: 11167 - Monkeys in the Emei Mountain

Hello guys, My approach to this problem is: - created bipartite graph (monkeys, time from 0 to 50000) - link monkeys to time vertexes, when they can drink (capacity 1) - link source to monkeys (capacity: thirstyness of monkey) - link time vertexes to sink (capacity: m) - run maxflow with Dinic and I...
Thu Aug 14, 2014 12:52 pm
Forum: Volume 12 (1200-1299)
Topic: 1244 - Palindromic paths
Replies: 4
Views: 1488

### Re: 1244 - Palindromic paths

Tkanks, but still WA
Tue Aug 12, 2014 12:32 pm
Forum: Volume 12 (1200-1299)
Topic: 1216 - The Bug Sensor Problem
Replies: 7
Views: 6042

### Re: 1216 - The Bug Sensor Problem : WA

What are the constraints for number of sensors?
Mon Aug 11, 2014 7:48 pm
Forum: Volume 12 (1200-1299)
Topic: 1244 - Palindromic paths
Replies: 4
Views: 1488

### Re: 1244 - Palindromic paths

My code runs fine against your test, but still WA :( #include <iostream> #include <algorithm> #include <vector> #include <queue> #include <list> #include <climits> #include <string> #include <stack> #include <map> #include <set> #include <cmath> #include <cstdio> #include <cstring> #include <cstdlib...
Fri Aug 08, 2014 12:48 pm
Forum: Volume 12 (1200-1299)
Topic: 1229 - Sub-dictionary
Replies: 17
Views: 8779

### Re: 1229 - Sub-dictionary (Why WA)

I tested my code against all your tests and still getting WA. Can you help me? #include <iostream> #include <algorithm> #include <vector> #include <queue> #include <list> #include <climits> #include <string> #include <stack> #include <map> #include <set> #include <cmath> #include <cstdio> #include <...
Wed Aug 06, 2014 6:51 pm
Forum: Volume 110 (11000-11099)
Topic: 11060 - Beverages
Replies: 96
Views: 34593

### Re: 11060 - Beverages

Thank you, you're my hero.
Wed Aug 06, 2014 3:59 pm
Forum: Volume 110 (11000-11099)
Topic: 11060 - Beverages
Replies: 96
Views: 34593

### Re: 11060 - Beverages

Thanks, but still WA

Code: Select all

``````AC
``````
Wed Aug 06, 2014 2:10 pm
Forum: Volume 12 (1200-1299)
Topic: 1252 - Twenty Questions
Replies: 7
Views: 2104

### Re: 1252 - Twenty Questions

TLE :o #include <iostream> #include <algorithm> #include <vector> #include <queue> #include <list> #include <climits> #include <string> #include <stack> #include <map> #include <set> #include <cmath> #include <cstdio> #include <cstring> #include <cstdlib> #define ALL(v) v.begin(), v.end() #define RE...
Wed Aug 06, 2014 10:32 am
Forum: Volume 110 (11000-11099)
Topic: 11060 - Beverages
Replies: 96
Views: 34593

### Re: 11060 - Beverages

Code: Select all

``below``
Tue Aug 05, 2014 11:07 pm
Forum: Volume 12 (1200-1299)
Topic: 1252 - Twenty Questions
Replies: 7
Views: 2104

### Re: 1252 - Twenty Questions

Right, I thought it's enough to get unique object id-s (consists selected bits, the same for every object) to get the answer, but now I see we should adjust to results we get meanwhile. Thanks, I'll try to code it tomorrow.
Tue Aug 05, 2014 2:07 pm
Forum: Volume 110 (11000-11099)
Topic: 11060 - Beverages
Replies: 96
Views: 34593

### Re: 11060 - Beverages

I've been struggling with this problem for 2 hours, checked on all your tests and still got WA. Was anybody in this situation and got AC?
Tue Aug 05, 2014 11:47 am
Forum: Volume 12 (1200-1299)
Topic: 1252 - Twenty Questions
Replies: 7
Views: 2104

### 1252 - Twenty Questions

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3693 Hello, I'm solving this problem and I don't understand one thing. My program for sample input returns: 0 2 5 <-- correct is 4 11 9 My algorithm: I iterate over every bitmask from 1 to (1<<m) and check...
Thu Jul 31, 2014 11:45 am
Forum: Volume 12 (1200-1299)
Topic: 1204 - Fun Game
Replies: 1
Views: 511

### 1204 - Fun Game

Hello guys, I've been thinking about this problem lately and I came up with some solution. I wanna share it with you and ask you to tell me if it makes sense. 1) I grab the longest paper and check if it contains all of children by checking if other papers are substring of it (with cycle). 2) If yes,...