11078 - Open Credit System

[Ghust_omega]

Hi to all!

I getting WA in this one mi algo is:

if i < j then "i" is senior and j is junior
so I take the diference of S_i - Min ( S_J ) where i<j<=n

then take the maximun of this diferences

Thanks in advance

[Martin Macko]

Hi to all!

I getting WA in this one mi algo is:

if i < j then "i" is senior and j is junior
so I take the diference of S_i - Min ( S_J ) where i<j<=n

then take the maximun of this diferences

Thanks in advance

Yes, your approach is correct... You have a bug in your code probably...

Try:

Code: Select all

4
2
149999
-149999
2
-149999
149999
2
47
47
7
32652
652
2642
642
-426
65427
7424

My output:

Code: Select all

299998
-299998
0
58003

[Ghust_omega]

Hi!! Martin

you are right , I have a bug in my code, thanks for that

Thanks in advance
Keep posting.

[krijger]

Note that the first integer in the input is the number of cases. The input description does not explicitely state this. Treating it as the 'n' of the first case (and reading input until EOF) gives the right answer for all example cases, but will get WA on the judge.

[lbfacci]

Note that the first integer in the input is the number of cases. The input description does not explicitely state this. Treating it as the 'n' of the first case (and reading input until EOF) gives the right answer for all example cases, but will get WA on the judge.

I took 2 WAs in the contest because of that!

[ayon]

I faced the same problem at real-time contest held somedays ago at our country. I thought the first line of input is the n for the 1st test case and got two runtime error(might be array was indexed with negative number), we then requested a clarification about he 1st line of input, but we were not answered. i still cannot understand how can the 1st line be the number of test cases.

[shahriar_manzoor]

Hmm it is really an unfortunate situation, although the description is implicit none of the reviewers marked it wrong. And also the both interpretations resulting in correct format is unintensional. I personally thought well though the description is a bit implicit the sample makes it clear... but actually the sample confuses things a bit as I see it now.

[Nazmul Quader Zinnuree]

12 penalties !!!!!!!!!!!!

WA, TLE, RTE, RTE, WA, TLE, WA, ...........

in EWUIPC, the reason is simple as mentioned above. Killed our time, killed our head, killed our position, killed us..... But we got no clarifications, no corrections, but a potato sample, that was right in all ways.

However, the description should be changed, immediately.

[uDebug]

In addition to test cases shared by Martin Macko, here's some input / output that I found useful during testing / debugging.

Input:

Code: Select all

3
4
99
94
91
100
5
99
94
91
100
-99
6
98
200
90
60
50
100

AC Output:

Code: Select all

8
199
150

[ehsanulbigboss]

Didn't read the question carefully

[lighted]

Input consists of a number of test cases T (less than 20). Each case starts with an integer n which is the number of students in the course. This value can be as large as 100,000 and as low as 2

Your code's complexity is 20 * O(n * n) = 20 * 100000 * 100000 = 2e+10. It will give TLE.

You can solve it in 20 * O(n) even without saving numbers in integer array. For each input number check and save current max value and max difference. Max value is necessary to calculate max difference. Then print max difference

[mohdali231993]

Code: Select all

#include <iostream>
#include <vector>
using namespace std;
int main()
{
    int t,h,l,i,d,de,v;
    cin >> t;
    while(t--)
    { 
      cin >> i;de = i;
      h = -150000;l = 150000;d = -299998;
      while(i--)
      {
        //cout<<i<<endl;        
        cin >> v;
        if(v > h && i >= 0){
                h=v;l = 150000;//cout<<" h "<<h<<endl;
                }
        else if(v < l){
             l=v;//cout<<" l "<<l<<endl;
             if(d < (h-l)){
                  d = h-l;
                  }
             }
      }
      
      cout<<d<<endl;
    }
    //cin>>h;
    return 0;
}

i hv tried all above inputs
i m getting wa cant figure out why!

[mohdali231993]

Got it.
condition should be
i > 0