Пробовал тесты в другой теме-не помогает.
Программу уже тестил буквально на всё!!!!!!!!

I think that checker is not correct. Admins, please, check test7.

here is test:
input:
7
1 1 1 0 1 1 1
1 0 0 0 0 0 1
1 0 0 0 0 0 1
0 0 0 0 0 0 0
1 0 0 0 0 0 1
1 0 0 0 0 0 1
1 1 1 0 1 1 1
0

output:
No solution

first my program write 3 for this.
hope can help you!!!

Did anybody solve it with numerical algo (local optimization)?

I use the multiset initially with the similar method. However, I had a memory limit exist. After, I saw the discussion, then I change the container to priority_queue.
Then I am able to solve the quetion. I just wonder, why with the similar algorithm, the memory usage is different? 1 396 KB vs 972 KB.

The memory usage of multiset is more than simple array is used then sorted. 1 084 KB

Can you please provide me test cases where i can fail?

My code is here:
http://www.ideone.com/396m3

have test:
1 2 -> 5
1 150000->656233
1 20 ->71
Right?


What test may give Crash in test 2?

the graph is simple!!!
input:
2 0

output:
-1

GOOD LUCK!!!

#define _USE_MATH_DEFINES
#include<stdio.h>
#include<math.h>

int cal(double x1, double y1, double x2, double y2){
    int d;
    d=sqrt(pow((x2-x1),2)+pow((y2-y1),2));
    return d;
}

int main(){
  int no_of_nails,j;
  double radius;
  double total_length=0;
  double x1,y1,x2,y2;
  double nextx,nexty,prevx,prevy;

  fscanf(stdin, "%d %lf",&no_of_nails,&radius);
  getchar();

  total_length += no_of_nails * ((M_PI*radius)/2);

  if(no_of_nails==1)  {
    total_length += M_PI*2*radius;
    printf("%0.2lf",total_length);
    return 0;
  }


  fscanf(stdin,"%lf %lf",&x1,&y1);
  fscanf(stdin,"%lf %lf",&x2,&y2);

  total_length+=cal(x1,y1,x2,y2);

  prevx=x2;
  prevy=y2;
  if(no_of_nails>2){
      for(j=no_of_nails-2;j>0;j--){
          fscanf(stdin,"%lf %lf",&nextx,&nexty);
          total_length += cal(prevx,prevy,nextx,nexty);
          prevx=nextx;
          prevy=nexty;
      }
      total_length += cal(prevx,prevy,x1,y1);
  }

  printf("%0.2lf",total_length);
  return 0;


}

so, can I output  "t" since, since it is encountered 3 times???? I mean the only way to measure how strong a spell is, is to count how to many times it is encountered in the Universal spell.

#include <stdio.h>
#include <math.h>
int main()
{
    freopen("input.txt", "r", stdin);
    int i=0;
    int k;
    double arr[100000];
    float temp;
    while(scanf("%f", &temp)!=EOF){
        arr[i]=temp;
        i++;
    }
    for(k=i-1; k>=0; k--)
        printf("%.4f\n", sqrt(arr[k]));
    return 0;
}

if you have wa13, try test

4
4 4 4 3

answer is 2

Всем добрый день.
Мне нужно сгенерировать все графы следующего типа:
1. Направление ребер не имеет значения;
2. Количество ребер не больше 20;
3. Граф должен быть связным;
4. Граф не должен содержать петель и кратных ребер;
5. Граф должен состоять только из циклов (не должно быть вершин степени 1).
Затем нужно среди изоморфных графов оставить только один.
Время работы программы в принципе не важно (но должно быть в разумных пределах, не больше 15 мин.). Есть идеи?

first i use RB tree (set in C++) and got AC in 0.796s and when i use heap i AC in 0.156s. my algo is (n^2* log(n)).
GOOD LUCK!!!

At first I got lots of WA #1 at this problem, but I was confident in my algo.

When I replaced stl::merge with stl::sort, I got AC.
When I replaced stl::merge with stl::inplace_merge, I got AC, too.
After that, I tried to rewrite the stl::merge myself, and also got AC.
Then I copied the source code of stl::merge from "include\c++\3.4.2\bits\stl_algo.h", and ... also AC.

Does it mean that there is something strange in stl::merge of Visual C++ 2010?


UPD: I have found that the stl::merge in Visual C++ 2010 sometimes will modify the elements in the origin vector. Be careful to use it!

PS:

/* G++ merge */

  template<typename _InputIterator1, typename _InputIterator2,
       typename _OutputIterator>
    _OutputIterator
    merge(_InputIterator1 __first1, _InputIterator1 __last1,
      _InputIterator2 __first2, _InputIterator2 __last2,
      _OutputIterator __result)
    {
      // concept requirements
      __glibcxx_function_requires(_InputIteratorConcept<_InputIterator1>)
      __glibcxx_function_requires(_InputIteratorConcept<_InputIterator2>)
      __glibcxx_function_requires(_OutputIteratorConcept<_OutputIterator,
        typename iterator_traits<_InputIterator1>::value_type>)
      __glibcxx_function_requires(_SameTypeConcept<
        typename iterator_traits<_InputIterator1>::value_type,
        typename iterator_traits<_InputIterator2>::value_type>)
      __glibcxx_function_requires(_LessThanComparableConcept<
        typename iterator_traits<_InputIterator1>::value_type>)
      __glibcxx_requires_sorted(__first1, __last1);
      __glibcxx_requires_sorted(__first2, __last2);

      while (__first1 != __last1 && __first2 != __last2)
    {
      if (*__first2 < *__first1)
        {
          *__result = *__first2;
          ++__first2;
        }
      else
        {
          *__result = *__first1;
          ++__first1;
        }
      ++__result;
    }
      return std::copy(__first2, __last2, std::copy(__first1, __last1,
                            __result));
    }


/* VC++ 2010 merge */

template<class _InIt1,
    class _InIt2,
    class _OutIt> inline
    _OutIt _Merge(_InIt1 _First1, _InIt1 _Last1,
        _InIt2 _First2, _InIt2 _Last2,
        _OutIt _Dest)
    {    // copy merging ranges, both using operator<
    for (; _First1 != _Last1 && _First2 != _Last2; ++_Dest)
        if (_DEBUG_LT(*_First2, *_First1))
            {    // merge first
            *_Dest = _Move(*_First2);
            ++_First2;
            }
        else
            {    // merge second
            *_Dest = _Move(*_First1);
            ++_First1;
            }

    _Dest = _Move(_First1, _Last1, _Dest);    // copy any tail
    return (_Move(_First2, _Last2, _Dest));
    }

Edited by author 17.12.2010 14:20

my old AC code has WA on this test, please add this:
4 3
2 1 4
2 4 3
2 3 2
2
100 1 0
0 2 0


Edited by author 14.12.2010 23:04

Здравствуйте.

Помню что видел на сайте задачу про расстановку ферзей на доске большого размера. Подскажите ее номер или название.

8
3 2 3 7
3 1 3 7
3 1 2 7
1 6
0
2 4 8
3 1 2 3
1 6

why i can't make group like this:
1: 1 2 6
2: 3 4 5 7 8
???

I have about 50 wrong submissions,please help me with test #9.



Edited by author 11.12.2010 17:01