что это и как исправить

Edited by author 07.04.2013 13:13

GIVE ME SOME TESTS

Please see: http://acm.timus.ru/forum/thread.aspx?id=19389
In test #8 input does not follow requirements given by problem description.

Can anyone please give me a hint to solve this problem. Please dont give the recurrence.

Thank you.

Let project all segments to some line (x,y --> z=ax+by) and try all pairs of segments, which have an intersection of projections. To do it just sort events "open segment", "close segment" and brute force pairs.

You will get TL. Yet.

Now let try 4 lines: (a,b) = (1,0) (0,1) (1,1) (1,-1). At first, let estimate number of pairs to process for each line in O(nlogn) time. Now that we may choose line, which produces minimal mumber of pairs.

AC in 0.937 seconds. id = 4870936.

I am getting TLE on test 24.
How will you choose from which town to start? Because of this I had to start from every town to find the answer. For each town it took me O(n),so for all the towns it becomes O(n^2), causing TLE.

I don't understand what's the hint in this problem! I read it and I think this code must be enough to solve that problem in c#:
using System;

namespace ConsoleApplication1
{
    class Program1243
    {
        static void Main()
        {
            ulong n = Convert.ToUInt64(Console.ReadLine());
            Console.WriteLine(n%7);

        }
    }
}

But I get WA#5. And I don't understand! Can someone help me? . . .

Please add UTF-8 encoding HTTP tag to http://acm.timus.ru/getsubmit.aspx so we could see our comments written in native languages. At least for C#. Or just to files that were submitted with UTF-8 preamble.

I'm using only notepad. 29 lines. Got AC after first sending. :-)

[code deleted]

Edited by moderator 01.12.2019 21:24

My algo works with 255 Kb memory and 1ms. what can I improve in code to get ~120 KB, as in best results?

[code deleted]

Edited by moderator 04.12.2019 20:44

What's the answer for this test?
3
1 1 1
25000000 10001 1
1 -90000 -999890001

Please give me some tests. I use DFS,but WA4.

Edited by author 19.05.2011 17:52

Здравствуйте!
Никак не могу понять где у меня проблема. На домашнем компьютере всё нормально работает, но здесь постоянно выдаёт WA.
Спасибо




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

int main(void) {

    long num;
    long double arr[100000];
    int position = 0;
    int asnwer;

    while ( ( asnwer = scanf("%lu", &num)) != EOF ) {
        if ( asnwer == 1 ) {
            arr[position] = num;
            position++;
        }
    }

    position--;

    while (position >= 0) {
        printf("%.4f\n", sqrt( arr[position] ));
        position--;
    }

    //getchar();

    return 0;
}

subj!
I could solve this task only when I've seen someone mention about stable results (used TreeSet with comparator, 0.4", 15.5 Mb memory)

I wrote kd-tree based solution but still TL#16, and I cannot find bad cases for my realization (on my local machine it finishes within 1 sec on any test). Any ideas of what kind of tests may these be?

Edited by author 26.03.2013 04:00

//please help me to solve this problem
//my Bug is between the stars.
#include <iostream>
using namespace std;
int main()
{
    int n,s=1;
    cin >> n;
    int a[n];
    for( int i=0;i<n;i++ )
    {
         cin >> a[i];
    }
    for( int i=0;i<n-1;i++ )
    {
         if( a[i]!=a[i+1] )
         s++;
    }
    int b[s][2];
    for( int i=0;i<s;i++ )
    {
         b[i][1]=-1;
         b[i][0]=0;
    }
    b[0][0]=1;
    b[0][1]=a[0];
    //**************************************************************************
    for( int i=0; i<n-1;i++ )
    {
         if( a[i]!=a[i+1] )
         {
             int j;
             for( j=1;j<s;j++ )
             {
                  if( b[j][1]=-1 )
                  break;
             }
             b[j][1]=a[i+1];
             b[j][0]++;
         }
         else if( a[i]==a[i+1] )
         {
             int j;
             for( j=1;j<s;j++ )
             {
                  if( b[j][1]=-1 )
                  break;
             }
             b[j-1][0]++;
         }
    }
    //**************************************************************************
    for( int i=0;i<s;i++ )
    {
         cout << b[i][0] << " " << b[i][1]<< " ";
    }
    return 0;
}