[code deleted]

My program give right answers on all tests in this forum, but I have WA on test #2 :) Why ? :)

Edited by moderator 22.02.2006 22:12

I wrote solution, it works well on my PC, but gives stack overflow 1 on Online judge, first test is example from problem statement, I've no idea, on Visual c++ 2008 my solution does not give any error, please help if you know whats up with Compiler on Timus...

---
CODE DELETED

Edited by author 13.10.2009 18:32

I use a very simple algorithm..my code is very short..
*just (for i:=1 to n do)check if the number appears in the A set of numbers after i.
*set down the father of each number.
*Just output.

(i'm sorry that my English is really bad..)

var
  con,temp,i,j:longint;
  fin:array[1..7500]of boolean;
  b,a,fa:array[1..7500]of integer;
begin
  {$IFNDEF ONLINE_JUDGE}
  assign(input,'input.in');reset(input);
  assign(output,'output.out');rewritE(output);
  {$ENDIF}
  reaD(temp);
  con:=0;
  while temp<>0 do
    begin
      inc(con);
      a[con]:=temp;
      inc(b[temp]);
      read(temp);
    end;
  for i := 1 to con do
    for j := 1 to con+1 do
      if (not fin[j])and(b[j]=0) then
        begin
          fin[j]:=true;
          fa[j]:=a[i];
          deC(b[a[i]]);
          break;
        end;
  for i := 1 to con+1 do
    begin
      write(i,':');
      for j := 1 to con+1 do
        if (fa[j]=i)or(fa[i]=j) then
          write(' ',j);
      writeln;
    end;
end.

Edited by author 13.10.2009 15:09

I don't understand, how it is possible... The simplest solution works for 0.015 sec.

I have got wa 14 and don't know why

Edited by author 29.12.2008 18:33

(On^2)use:
f[j-1]<=b[i]
{means that (a=2,b=3)and(a=3,b=3) are contain too}
是最长不下降（不是上升）子序列..记得判断上个的a个当前a是否不同。

Why answer for G: 92?
Why it is not 4*3+3*2+9*8=90?

Shaitan-pipe kill ALL bosses on the line.
If you have WA#6 try this test:

100 0
-100 0
0 1000
0 100

Correct answer is not 100.0000000000

The testing system doesn't treat exceptions thrown by a thread another than "main" as exceptions and does checking of correctness of the output after such exceptions. For example, if I write my main method in such way:
  new Thread() {
    public void run() {
      new Main().run();
    }
  }.start();
and the first operator in "run" is
  if (true)
    throw new RuntimeException();
I'll get WA 1, not Crash 1.
It seems to be very strange, because such uncaught exceptions is really thrown by jvm and it terminates abnormally and prints a stack trace.
This behaviour of the testing system is very nagging because it hides things that really happen in the program.

There is an injustice: coders on Java have possibility to create threads, and coders on C/C ++ have no such possibility. It is necessary to give the possibility to include <pthreads.h> or <windows.h>.

Hello!
I have tryed to solve 1022 on C++:

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

struct member
{
        int latency;
        int number;
        vector<int>child;
        member() {latency=0; child.resize(0);}
};

struct member_less : public binary_function<member, member, bool>
{
        bool operator()(const member& m1, const member& m2) const
        { return m1.latency < m2.latency; };
};

int main()
{
        int numb_of_members;
        cin >> numb_of_members;
        vector<member>mosk(numb_of_members);
        for (int i=0;i<numb_of_members;i++)
        {
                mosk[i].number=i;
                int buf;
                cin >> buf;
                while(buf!=0)
                {
                        mosk[i].child.push_back(buf);
                        cin >> buf;
                }
        }
        bool stop=false;
        while(stop==false)
        {
                stop=true;
                for (int i=0;i<numb_of_members;i++)
                {
                        for(int j=0;j<mosk[i].child.size();j++)
                        {
                                if (mosk[mosk[i].child[j]].latency <= mosk[i].latency)
                                {mosk[mosk[i].child[j]].latency = mosk[i].latency+1; stop=false;}
                        }
                }
        }
        sort(mosk.begin(),mosk.end(),member_less());
        for (int i=0;i<numb_of_members;i++)
        cout << mosk[i].number << " ";
        return 0;
}

But I have got errors:

685a5f5c-5454-4df3-be25-6c467c9fdfd1
685a5f5c-5454-4df3-be25-6c467c9fdfd1(14): error: binary_function is not a template
  struct member_less : public binary_function<member, member, bool>
                              ^

685a5f5c-5454-4df3-be25-6c467c9fdfd1(14): error: not a class or struct name
  struct member_less : public binary_function<member, member, bool>

Why? On my computer this programm works well!

Hi,

I thought of bipartite matching as possible solution , can any one tell me what is the correct algorithm to solve this problem.
Here is my code
#define _CRT_SECURE_NO_WARNINGS
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <ctime>

using namespace std;

int inf=(1<<28);
double eps=1e-9;
double pi=acos(-1.0);
typedef vector<int> vi;
typedef long long int64;
typedef pair<int,int> ii;
#define size(x) (int)((x).size())
#define all(v) (v).begin(), (v).end()
#define For(i,x) for(int i=0;i<x;i++)
#define Forr(i,y,x) for(int i=y;i>=x;i--)
#define Forn(i,y,x) for(int i=y;i<=x;i++)
#define Fill(a, v) memset(a, v, sizeof(a))
#define outs(x) cout << #x << " = " << x << " ";
#define outn(x) cout << #x << " = " << x << "\n";

int n;

int prev[1001];
vi graph[1001];
int visit[1001];

int rank[1001];
string name[1001];
string ans[501][2];
int speciality[1001];

bool findNext(int x)
{
    if(x<0)return true;
    if(visit[x])return false;
    visit[x]=1;
    int sz = size(graph[x]);
    For(i,sz)
    {
        int y = graph[x][i];
        if(findNext(prev[y]))
        {
            prev[y]=x;
            //prev[x]=y;
            return true;
        }
    }

    return false;
}


int main()
{
    #ifdef FAMEOFLIGHT_HOME
        freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
        //  freopen("input2.txt","r",stdin);freopen("output2.txt","w",stdout);
    #endif

    int tmp;
    char str1[30],str2[30];
    scanf ("%d",&n);
    For(i,n)
    {
        scanf ("%s %s %d",&str1,&str2,&tmp);
        rank[i]=tmp;
        name[i]=string(str1);
        if(str2[0]=='a')speciality[i]=0;
        if(str2[0]=='s')speciality[i]=1;
        if(str2[0]=='t')speciality[i]=2;
    }
    // construct the graph
    For(i,n)
    {
        For(j,n)
        {
            if(abs(rank[i]-rank[j])==2)
            {
                if(speciality[i]==0 || speciality[j]==0)graph[i].push_back (j) , graph[j].push_back (i);
                else if((speciality[i]==1 && speciality[j]==2) || (speciality[i]==2 && speciality[j]==1))graph[i].push_back (j) , graph[j].push_back (i);
            }
        }
    }
    int ret=0;
    Fill(prev,-1);
    For(i,n)
    {
        Fill(visit,0);
        findNext(i);
    }

    For(i,n)
    {
        if(prev[i]!=-1)
        {
            prev[prev[i]]=-1;
            int x = i , y = prev[i];
            ans[ret][0]=name[x];
            ans[ret++][1]=name[y];
            //printf ("%s %s\n",name[x].c_str (),name[y].c_str ());
        }
    }
    printf ("%d\n",ret);
    For(i,ret)
    {
        printf ("%s %s\n",ans[i][0].c_str (),ans[i][1].c_str ());
    }
    return 0;
}

function calc(x, y, l ,r: int64): int64;
  var n, nx, ny: int64;
    n1,n2: int64;
  begin
     if l < x then l := x;
     if x > r then begin
       result := 0;
       exit;
      end;

    if ( x = 1 ) then begin
       result := (r - l + 1);
       exit;
    end;
     if x = y then begin
       result := ( r div x - ((l-1) div x) );
       exit;
     end;
   if y + 1 >= x + x then begin
      result := (r - l + 1);
      exit;
   end;


    n := (y - 2) div ( y - x ) + 1;
    while  (y * (n - 1) + 1 >= x * n) and (n > 0) do dec(n);

  if n * x  <= l then begin
     result := (r - l + 1);
     exit;
  end;
  result := 0;
  if n*x <= r then begin
     result := r - n*x + 1;
     r:=n*x - 1;
  end;


      nx := (l + y - 1) div y;
      if nx*x > r then begin
        result := result + 0;
        exit;
      end;
      ny := r div x;
      if ny * y < l then begin
         result := result +0;
         exit;
      end;
      if ( ny * x <= l ) and (ny*y >= r)then begin
        result := result +r - l + 1;
        exit;
      end;
      if ( nx * x <= l ) and (nx*y >= r)then begin
        result := result +r - l + 1;
        exit;
      end;

      if (ny * y < l ) and ( ny * x + x > r) then begin
       result := result +(0);
       exit;
     end;
    if nx = ny then begin
       if l < nx * x then l := nx * x;
       if r > nx * y then r := ny * y;
       result := result +(r - l + 1);
       exit;
     end;

     if l < nx * x then l := nx * x;
     if r > nx * y then r := ny * y;

     n1 := nx + 1;
     n2 := ny - 1;
     if n1 <= n2 then
         result := result + (n2 - n1 + 1) + (y-x) * (( n1+n2) * (n2-n1+1) div 2);
     result := result + nx * y - l + 1  + (r - ny*x + 1);


  end;

#include <iostream>
#include <string>
#include <algorithm>
#include <map>

using namespace std;

int main()
{
    int n;
    map <string , string> user;
    map <string , string > ::iterator it;
    string name , er , ti ;
    cin >> n;
    for(int i = 0 ; i < n ; i++)
    {
        cin >> name >> er;

        if(er == "CE")
        {
            it = user.find(name);
            if(it == user.end())
                user[name] = "0";
        }

        else if(er == "AC")
        {
            user[name] = "a";
        }

        else
        {
            cin >> ti;
            it = user.find(name);
                if(it != user.end())
                    user[name] = max(ti, it->second);
                else
                    user[name] = ti;
        }
    }

    //cout << " ^^^ " << user.size() << endl;
    it = user.begin();
    int mx = 0 , mn = 0;
    while(it !=  user.end())
    {
        //cout << "first == " << it->first << " second == " << it->second << endl;
        if(it->second == "6" || it->second == "a")
            mx++;
        if(it->second == "7")
        {
            mn++;
            mx++;
        }
        it++;
    }
    cout << mn << " " << mx << endl;

    return 0;
}

what the wrong !?

"The outcomes which differ only in test number are considered different."It means that the maximum number of tests passed are different?

Edited by author 10.10.2009 17:16

Edited by author 10.10.2009 17:18

Folowing your algo when the Main ball is Blue we should get 82 point (8*7 + 3*2 + 1*0 + 1*0 + 5*4),but why the answer 74?

I can not understand problem statement.
Please explain me it

I use greedy.
Is this rigth?

Give me some tests.