I have a problem with test5!.Wrong anwser!!!
Can anyone help me?. What is the test 5?

for each node v,calculate a(v)-maximum cost achieved by the subtree with root "v" in which v will attend, and n(v)-maximum cost achived by the subtree with root "v" in which v will not attend.
a(v)=p(v)+n(v1)+n(v2)+...+n(vn), vi-is the child of v.,p(v)-is the point of v itself.
n(v)=sum(max(n(vi),a(vi))),for all i-s.
and simply use DFS.

This is my program:
[code deleted]
Be careful of the s and t.In TEST#8,s>t.

Edited by moderator 23.10.2019 08:45

* New tests have been added.
* First test is now the sample from the problem statements.
* Memory limit is changed from 16 MB to 64 MB.
* Time limit is changed from 2 seconds to 1 second.

Solutions have been rejudged. More than 1700 authors have lost AC.

I create a struct STACK like this:
struct STACK
{
    int number;
    unsigned char before[3];
};

and keep arrays:
STACK LIST[100000+1];
int last[1000];

Apparently (3B+4B)*10^5 = 7*10^2 KB which is less than 750 :D
whats wrong with it? :/


how much memory does an empty cpp code consume?

What the ***?

Edited by author 28.03.2013 22:52

Edited by author 28.03.2013 07:06

Hi,
Does the solution require the set having the minimum cardinality having numbers that sums to k*n? I am getting a WA, but the solution appears pretty right to me.
If so, the question makes it appear that you can get by with any set. @Mods can this be updated in that case?

Thanks.

can any explain the test case in the problem ,how the answer comes out to 383.

Thanks in advance

For those who are stuck at this point.

The filtered (thus 0x0a and 0x0d removed) first testcase is:

"a ?" (w/o quotes)

#include<stdio.h>
#include<stdlib.h>


int main()
{
long unsigned int a[15000][2],i,j,n,temp,b,c;
scanf("%ld",&n);

for(i=0;i<n;i++)
{
scanf("%lu%lu",&b,&c);
if(b<=10000000&&c<=100)
{
a[i][0]=b;
a[i][1]=c;
}
else
{
return 0;
}
}


for(i=0;i<n;i++)
{
for(j=0;j<n-i;j++)
{
if(a[j][1]<a[j+1][1])
{
temp=a[j][0];
a[j][0]=a[j+1][0];
a[j+1][0]=temp;

temp=a[j][1];
a[j][1]=a[j+1][1];
a[j+1][1]=temp;
}
}
}
for(i=0;i<n;i++)
{
for(j=0;j<2;j++)
{
printf("%d ",a[i][j]);
}
printf("\n");
}

return 0;
}

Edited by author 27.03.2013 18:08

her's my cod! Please help!
using System;

namespace ConsoleApplication1
{
    class Program1563
    {
        static void Main()
        {
            int n = int.Parse(Console.ReadLine());
            string str;
            string[] strl = new string[n];
            int s = -1;
            for (int i = 0; i < n; i++)
            {
                str = Console.ReadLine();
                strl[i] = str;
                Console.WriteLine("i="+i);
                for (int j = 0; j < i; j++)
                {
                    if (str == strl[j])
                        s++;
                }
            }

            Console.WriteLine(s);
                    Console.ReadLine();
        }
    }
}

When you compare in the sort, try using epsilon = 1e-8.

When I used 1e-13, I keep getting WA#3.

I use O(n^3), but i meet time  problem. Can you help me?

#include <iostream>

int ClickCount(char c);

using namespace std;

int main()
{
    char Buf[1001];
    cin.getline(Buf,1001);

    int Result=0;
    int i=0;
    while (Buf[i]!='\0')
    {
        Result+=ClickCount(Buf[i]);
        i++;
    }

    cout << Result;

    //system("pause");

    return 0;
}

int ClickCount(char c)
{
    char AlphaBet[]="abcdefghijklmnopqrstuvwxyz*.,!# *";
    for (int i=0;i<=sizeof AlphaBet;i++)
    {
        if (c==AlphaBet[i]) return i%3+1;
    }
    return 0;
}

It took me 2 minutes to finish it.

if N=3 k=10
is 011 valid(i mean may the valid number start with 0?)

Edited by author 26.03.2013 14:03

import java.util.*;
public class LavinInteractive {


    public static void main(String[] args) {

        int n;
            Scanner rc = new Scanner(System.in);
            System.out.print("Введите число: ");
            n = rc.nextInt();

            if (( n >= 1 ) && (n <= 4)) {
                System.out.print("few");
            }
            else if (( n >=5 ) && (n <= 9)) {
                System.out.print("several");
            }
            else if (( n >= 10 ) && (n <= 19)) {
                System.out.print("pack");
            }
            else if (( n >= 20 ) && (n <= 49)) {
                System.out.print("lots");
            }
            else if (( n >= 50 ) && (n <= 99)) {
                System.out.print("horde");
            }
            else if (( n >= 100 ) && (n <= 249)) {
                System.out.print("throng");
            }
            else if (( n >= 250 ) && (n <= 499)) {
                System.out.print("swarm");
            }
            else if (( n >= 500 ) && (n <= 999)) {
                System.out.print("zounds");
            }
            else if ( n >= 1000 ) {
                System.out.print("legion");
            }



    }

}