11218 - KTV

darkos32 · Post by **darkos32** » Sun Jun 03, 2007 1:03 pm

hi,can anyone give me testcases please ?

thanks..

rujialiu · Post by **rujialiu** » Sun Jun 03, 2007 4:42 pm

What is your problem? If you're getting TLE, think about a more efficient algorithm; if you're getting WA, write a 'silly' program that is absolutely correct and compare their answers for a lot of random data.

darkos32 · Post by **darkos32** » Sun Jun 03, 2007 4:46 pm

yep,i got WA,i dont know whats wrong with my code..

thanks..

rujialiu · Post by **rujialiu** » Mon Jun 04, 2007 4:42 am

darkos32 wrote:yep,i got WA,i dont know whats wrong with my code..

thanks..

Write one or two other programs (even different implementations of the same algorithm might be helpful) and compare the answers with a loooooooooooot of random cases

I'm sure you'll find your bug this way

Rajib · Post by **Rajib** » Mon Jun 04, 2007 1:14 pm

I need some test case. I'm getting WA.

rio · Post by **rio** » Mon Jun 04, 2007 3:09 pm

Rajib wrote:I need some test case. I'm getting WA.

Look rujialiu's post.

----
Rio

darkos32 · Post by **darkos32** » Wed Jun 06, 2007 7:21 am

yepp...i got accepted...thankss...

tanvir · Post by **tanvir** » Sat Jul 14, 2007 12:15 am

Acc'ed:)

rezaeeEE · Post by **rezaeeEE** » Tue Aug 21, 2007 2:54 pm

i cant find any bug in my code.
can any body help me.
i get WA.

Code: Select all

#include <iostream>
#include <algorithm>

using namespace std;

int score[80];
int s[80][3];
bool gr[80][80];

int main()
{
    int n;
    int t = 1;
    while(cin >> n, n)
    {
              memset(gr, 0, sizeof(gr));
              for(int i = 0;i < n;i++)
                      cin >> s[i][0] >> s[i][1] >> s[i][2] >> score[i];
              cout << "Case "<<t++<<": ";
              for(int i = 0;i < n;i++)
                      sort(s[i], s[i] + 3);
              for(int i = 0;i < n;i++)  
                   for(int j = i + 1;j < n;j++)
                      if(s[i][0]!=s[j][0]&&s[i][1]!=s[j][1]&&s[i][2]!= s[j][2])
                      {
                        gr[i][j] = 1;
                        gr[j][i] = 1;
                      }
              int mx = 0;
              for(int i = 0;i < n;i++)
                for(int j = i + 1;j < n;j++)
                  for(int k = j + 1;k < n;k++)
                    if(gr[i][j] && gr[i][k] && gr[j][k])
                    {
                    int sum = score[i] + score[j] + score[k];
                    if(mx < sum)
                          mx = sum;
                    }
              if(!mx)
                    cout << "-1" ;
              else
                    cout << mx;
              cout << endl;
    } 
    return 0;
}

chunyi81 · Post by **chunyi81** » Thu Aug 23, 2007 6:40 am

Try the following case:

Input:

Code: Select all

Output:

Code: Select all

Case 1: -1

brianfry713 · Post by **brianfry713** » Sat Dec 29, 2012 9:48 pm

Random input:

Code: Select all

Edit to remove incorrect output, the following output by ansiemens is correct.

ansiemens · Post by **ansiemens** » Sun May 26, 2013 9:27 am

here is another sample output from my AC'ed code, a little bit different from above.

Code: Select all

Case 1: -1
Case 2: 24786
Case 3: 20911
Case 4: 21213
Case 5: 15606
Case 6: 18168
Case 7: 16764
Case 8: 25441
Case 9: -1
Case 10: 13347
Case 11: -1
Case 12: 24691
Case 13: -1
Case 14: 25430
Case 15: -1
Case 16: 20529
Case 17: 20518
Case 18: 22782
Case 19: 21082
Case 20: 24569
Case 21: 21079
Case 22: 26412
Case 23: 18302
Case 24: 15615
Case 25: 22982
Case 26: 20859
Case 27: 18047
Case 28: 21873
Case 29: 21793
Case 30: -1
Case 31: -1
Case 32: -1
Case 33: 26813
Case 34: 24244
Case 35: 23978
Case 36: 9644
Case 37: 23184
Case 38: -1
Case 39: -1
Case 40: -1
Case 41: 24524
Case 42: 27097
Case 43: 16445
Case 44: 13509
Case 45: 17951
Case 46: 10738
Case 47: 26723
Case 48: 23482
Case 49: 14514
Case 50: 24516
Case 51: 27249
Case 52: 22468
Case 53: 24027
Case 54: 27212
Case 55: -1
Case 56: -1
Case 57: 24078
Case 58: 21765
Case 59: 20640
Case 60: 16262
Case 61: 17880
Case 62: 26454
Case 63: 22610
Case 64: 26038
Case 65: 25122
Case 66: 20126
Case 67: -1
Case 68: 23020
Case 69: -1
Case 70: 24103
Case 71: 21308
Case 72: 15900
Case 73: -1
Case 74: 24491
Case 75: -1
Case 76: 27340
Case 77: 27771
Case 78: -1
Case 79: 22453
Case 80: 28423
Case 81: 23361
Case 82: -1
Case 83: -1
Case 84: 16912
Case 85: 21111
Case 86: 23462
Case 87: 26432
Case 88: -1
Case 89: -1
Case 90: 21181
Case 91: 20089
Case 92: 20941
Case 93: -1
Case 94: -1
Case 95: 22011
Case 96: -1
Case 97: 22846
Case 98: 20361
Case 99: -1
Case 100: 25920

OJ Board

11218 - KTV

11218 - KTV

y

Test Case

Re: Test Case

yepp

need badly some input output

help

Re: 11218 - KTV

Re: 11218 - KTV