OJ Board

Can I have some I/O, please?

Can I have some tests, please?

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...

Tkanks, but still WA

What are the constraints for number of sensors?

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...

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 <...

Thank you, you're my hero.

Thanks, but still WA

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...

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.

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?

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<<...

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,...