There is a typo in statement in the first part of it. The sentence:
"This numbers are not necessarily different"
should be written as:
"These numbers are not necessarily different".

Try this test (it helped me, but real test #36 has N = 10000):
7
4
4
4
5
5
5
5
Answer, of course, is for example
3
5
4
5

After AC, I find that the answer is NO.

Edited by author 20.08.2010 09:25

#include <iostream>
#include <vector>
#include <math.h>
#include <cstdio>
#include <algorithm>
#include <string>
using namespace std;
int main()
{
   long long m,h = 0,i,t,l,n,f;
   string a,s;
   cin >> a;
   s = a;
   for(i = a.length()-1 ;i >= 0 ;i--)
   s[h] = a[i],h++;

    f = s.length()-2;
    i = 0;
    n = f;

    while(n >= 1 && m != 0)
     {
        t = n;
        m = 0;
       while(i <= n - (n  / 2) - 1)
     {
         if(s[i] != s[t])
       {
          m = 1;
          break;
       }
        i++;
        t--;
     }
         n--;
         i = 0;
     }
        if(m == 0)
         n++;
       for(i = 0 ;i < a.length() ;i++)
        cout << a[i];
       for(i = n + 1 ;i < s.length() ;i++)
        cout << s[i];
        cout << endl;
    return 0;
}

Hello, pleaze help me to read data correctly in Java. I've spend a lot of time with no result.

The next 2^N worst-case algo gets AC.

searchSolution(i) {
   if (i==N+1) {
       throw new FoundException();
   }
   group[i] = 1;
   if (checkThisAndAdvsHasNotMoreThan1Adv(i)) {
      searchSolution(i+1);
   }
   group[i] = 2;
   if (checkThisAndAdvsHasNotMoreThan1Adv(i)) {
       searchSolution(i+1);
   }
   group[i] = 0;
}

............

try {
   searchSolution(1);
} catch (FoundException e) {
   outputResult();
}
output("NO SOLUTION");


Judges, please do something with it :)
This is cool graph problem, i think in order to get AC one should write O(N) solution :)
But this obvious brute-force gets AC
SAD :(

Edited by author 01.08.2016 10:52

What's mean this problem?   why the example one should output 14 3?

It seems that lots of people can solve this problem with hashing. Well, I'm using 64 bit hashing and am using sufficiently large prime p (I'm using the usual polynomial hashing i.e. s[0]+s[1]*p+s[2]*p*p ...). I have tried 5 different p's and I'm always catching collisions at test 52 !!! I added code to check for collision and keep working with a different random chosen p ... and now I get TL !!!

My question is: what is the smart solution to the problem that I have? What hashing have you used?

To admins: How can you guys make solutions with random p get collisions? That's probably a really good test. I know how to build anti-hash for certain p, but I cannot imagine a test that hacks 10 random p's in a row. Good job! Or more like "my solution sucks" :)

I got AC through

t <- max(0, min(t1, t2))
if t = 0 do nothing

Edited by author 22.11.2013 08:33

use my own code.....
my id： 151799QY
The last time I submitted code, is my own code....

Edited by author 21.11.2013 21:17

16
25000
0 3 4 5 ... 1
25000
0 3 4 5 ... 1
....

....
25000
0 3 4 5 ... 1

Edited by author 21.11.2013 02:11

Who can tell test 24? May b someone also got in trouble with this test.

I can't understand that wrong in my program. please, give me a test.

I don't think there are such threads as (2 Edges)
 1 2
 2 1

And although my program can solve that case, I still WA on test5. Can you help me and give me some advice? Thank you very much!

If you have a problem - WA4 - consider sorting input, not output

for example:

5
1 5
3 6
1 3
9 6
4 2

answer
3
1 3
3 6
6 9

This may help you: http://en.wikipedia.org/wiki/Round-robin_tournament

#include <iostream>
using namespace std;


int main()
{
    int n = 0, m = 0, a = 0, s = 0, k = 0;
    int arr[15001];
    cin >> n;
    for(int i = 0; i < n; i ++)
    {
        cin >> arr[i];
    }
    cin >> m;
    bool flag = true;
    int j = 0;
    int left = 0, right = n-1;
    for(int i = 0; i < m; i++)
    {
        cin >> a;
        j = 0;
        left = 0;
        right = n-1;
        flag = true;

        if(a == arr[0])
        {
            flag = false;
            s++;
        }
        else
        {
            if(a == arr[n-1])
            {
                flag = false;
                s++;
            }
        }
        if(a > arr[n-1])
        {
            flag = false;
        }

        while(flag)
        {
            if(a > arr[j])
            {
                left = j;
                j = (left + right)/2;
                if(a == arr[j])
                {
                    {
                        flag = false;
                        s++;
                    }
                }
                if(right-left <= 1)
                {
                    flag = false;
                    if(a == arr[j+1]) s++;
                }
            }
            else
            {
                right = j;
                j = (left + right)/2;
                if(a == arr[j])
                {
                    {
                        flag = false;
                        s++;
                    }
                }
                if(right-left <= 1)
                {
                    flag = false;
                    if(a == arr[j+1]) s++;
                }
            }
        }
    }
    cout << s;
    return 0;
}

Edited by author 17.11.2013 16:03

My damned solution keep giving WA on test 6 with C11. I tested on big numbers and every corner case (yes, it works with 1 1 -> '0', yes, it gives '-1' on 3 6, etc..)

Suggestions? What's in test 6?

The exact same algorithm in python gives AC.. (and it's not a bignum issue, I tested the C version with 43 and 10**9)

Edited by author 24.11.2013 01:26