OJ Board

Do I get it wrong?
I assume that
1) if paper i is reviewed less than twice the violation is with paper i, (correct is " if paper i is reviewed more or less than K times the violation is with paper i,")
2) if author j reviews paper i more than once the violation is with paper i,
3) if author j ...

Well then, it explains how.
Thanks again!

Let's make something clear,
I assume that the time is the maximum of every single testcase's running time.
Am I wrong?! Is it their sum?

I added this to the beginning of the original findGold
y= lower_bound(a.begin(), a.end(), e)-a.begin()+1;
if (y>=a.size())
y=a.size()-1;
and it got the best time among my submissions.

I guess the worst input for the original code was 6, because the answer is 3 + 3 and "y" was to iterate through ...

Thanks, it worked.
But I cant see how it is faster; it is like O(n lgn) while mine was O(n)!

I'm getting TL but I cant get why

Thanks! I'll try.

I got WA, please help!

Thank you Brian; the first test case was enough to see my algorithm is buggy.
I did some modifications and then I nearly disproved its correctness.

Do you think I'd see light if I try more on greedy or maybe I better move on to something else?

I'm getting WA though I think everything's ok! :-?


#include <cstdio>
#include <iostream>
#include <bitset>
#include <functional>
#include <algorithm>

using namespace std;

int main(){
int n, a[110], sum, gsum, tc, b, d;
bitset<110> is;
bool done;

cin>>tc;
while (tc--){
cin>>n;
sum=0 ...

Got it; thank you!

I changed that to 198 and then to 140 yet the same result!

I'm getting RE
Can anybody help?

I modified it according to that and even did a little more overkill, yet wa!
Maybe I better move on.

According to a friend I'd been assuming that EOF is always preceded by a newline, thanks for mentioning that!
However it is still TL after fixing that.