I'am using AVL-tree to solve this problem... it seems to be not effective... but works too

Edited by author 01.07.2007 03:01

Edited by author 30.06.2007 21:05

My solution for this input:
5
4 0
3 0
5 0
5 0
0

print 0-2-210
It's wrong answer, but my solution is AC :)

6 6
1 2 8
2 3 3
3 5 2
2 4 7
4 6 2
2 5 6
The correct answer is:
Cost: 22
Cost: 25
But the program made by me which WA 12 prints:
Cost: 22
Cost: 20

I want to check my program (WA#2)

Where is the end of file in C# ? Help me, please !

Give me some test:), or may be some think wrong with test????

Edited by author 16.03.2007 22:42

There is my solution:

Program t1072;

Const MaxN=100;
      MaxK=10;

Type TCPIP=record IP,Mask :array[1..4]of longint end;

Var  N,K,i,j,count :longint;
     S             :string[255];
     Route         :array[1..MaxN,1..MaxN]of boolean;
     MinWay        :array[1..MaxN]of longint;
     PredWay       :array[1..MaxN]of longint;
     Comp1,Comp2   :longint;
     Next          :longint;
     Way           :array[1..MaxN]of longint;
     ex            :boolean;
     net           :array[1..MaxN]of record
                      K      :longint;
                      TCP_IP :array[1..MaxK]of TCPIP;
                    end;

Function SameNet(_IP1,_IP2:TCPIP):boolean;
var r1,r2,r3,r4 :boolean;
 begin
  r1:= (_IP1.IP[1] AND _IP1.Mask[1]) = (_IP2.IP[1] AND _IP2.Mask[1]);
  r2:= (_IP1.IP[2] AND _IP1.Mask[2]) = (_IP2.IP[2] AND _IP2.Mask[2]);
  r3:= (_IP1.IP[3] AND _IP1.Mask[3]) = (_IP2.IP[3] AND _IP2.Mask[3]);
  r4:= (_IP1.IP[4] AND _IP1.Mask[4]) = (_IP2.IP[4] AND _IP2.Mask[4]);
  SameNet:= r1 AND r2 AND r3 AND r4 ;
 end;

Function InSameNet(comp1,comp2 :longint):boolean;
var i1,i2     :longint;
    ok        :boolean;
 begin
  for i1:=1 to net[comp1].K do
   for i2:=1 to net[comp2].K do
    if SameNet(net[comp1].TCP_IP[i1],net[comp2].TCP_IP[i2]) then begin
     InSameNet:=true;
     exit;
    end;
  InSameNet:=false;
 end;

Procedure MakeTCP(S:string;Var D :TCPIP);
var n1,n2,n3,n4    :longint;
    t1,t2,t3,t4    :longint;
    CurNum         :string[255];
    i,j,code       :longint;
 begin
  j:=1;
  while S[j]=' ' do j:=j+1;
  CurNum:='';
  for i:=j to length(S) do
   if S[i]<>'.' then CurNum:=CurNum+S[i] else break;
  j:=i+1;
  val(CurNum,n1,code);
  CurNum:='';
  for i:=j to length(S) do
   if S[i]<>'.' then CurNum:=CurNum+S[i] else break;
  j:=i+1;
  val(CurNum,n2,code);
  CurNum:='';
  for i:=j to length(S) do
   if S[i]<>'.' then CurNum:=CurNum+S[i] else break;
  j:=i+1;
  val(CurNum,n3,code);
  CurNum:='';
  for i:=j to length(S) do
   if S[i]<>' ' then CurNum:=CurNum+S[i] else break;
  j:=i+1;
  val(CurNum,n4,code);
  while S[j]=' ' do j:=j+1;
  CurNum:='';
  for i:=j to length(S) do
   if S[i]<>'.' then CurNum:=CurNum+S[i] else break;
  j:=i+1;
  val(CurNum,t1,code);
  CurNum:='';
  for i:=j to length(S) do
   if S[i]<>'.' then CurNum:=CurNum+S[i] else break;
  j:=i+1;
  val(CurNum,t2,code);
  CurNum:='';
  for i:=j to length(S) do
   if S[i]<>'.' then CurNum:=CurNum+S[i] else break;
  j:=i+1;
  val(CurNum,t3,code);
  CurNum:='';
  for i:=j to length(S) do
   if S[i]<>' ' then CurNum:=CurNum+S[i] else break;
  val(CurNum,t4,code);
  D.IP[1]:=n1;
  D.IP[2]:=n2;
  D.IP[3]:=n3;
  D.IP[4]:=n4;
  D.Mask[1]:=t1;
  D.Mask[2]:=t2;
  D.Mask[3]:=t3;
  D.Mask[4]:=t4;
 end;

begin
Assign(input,'1072.in');ReSet(input);
for i:=1 to MaxN do
 for j:=1 to MaxN do
  Route[i,j]:=false;
Readln(N);
for i:=1 to N do begin
 Readln(K);
 net[i].K:=K;
 for j:=1 to K do begin
   Readln(S);
   MakeTCP(S,net[i].TCP_IP[j]);
  end;
end;
Read(Comp1,Comp2);
if comp1=comp2 then begin
 Writeln('YES');
 Writeln(comp1);
 Halt(0);
end;
for i:=1 to N do
 for j:=1 to N do
  if i<>j then Route[i,j]:=InSameNet(i,j);
for i:=1 to MaxN do MinWay[i]:=-1;
for i:=1 to MaxN do PredWay[i]:=0;
count:=0;
MinWay[comp1]:=1;
repeat
 ex:=true;
 count:=count+1;
 for i:=1 to N do
  if MinWay[i]=count then
   for j:=1 to N do
    if Route[i,j] then
     if MinWay[j]=-1 then begin
      MinWay[j]:=count+1;
      PredWay[j]:=i;
      ex:=false;
     end;
until ex;
if MinWay[comp2]=-1 then writeln('NO') else begin
 Next:=comp2;
 j:=MinWay[comp2]+1;
 while Next<>0 do begin
  j:=j-1;
  Way[j]:=Next;
  Next:=PredWay[Next];
 end;
 writeln('YES');
 i:=0;
 for i:=1 to MinWay[comp2]-1 do write(Way[i],' ')

I just finding volume of the pyramid and deducting volume of truncated cylinder, but getting WA (4 test). Can anyone to give me a prompting (not solving :)), please?

Is it reduced to flow or matching ?

Also what here it is wrong??? You see only latin letters!!
using System;
    class Program
    {
        static void Main(string[] args)
        {
            string s = Console.ReadLine();

            if (s != null)
            {
               int[] s1 = new int[s.Length];
                int[] s3 = new int[s.Length];
                string s2 = "abcdefghijklmnopqrstuvwxyz";
                int tmp = 26;
                for (int i = 0; i < s.Length; i++)
                {
                    if (i == 0)
                    {
                        s1[i] = s2.IndexOf(s[i]);
                        if (s1[i] <= 4)
                        {
                            s1[i] += 26;
                        }
                    }
                    else
                    {
                        s1[i] = s2.IndexOf(s[i]);
                        while (s1[i] < s1[i - 1])
                        {
                            s1[i] += tmp;
                        }
                    }
                }
                tmp = s1[1];
                int tmp1;
                s1[1] -= s1[0];
                for (int i = 2; i < s1.Length; i++)
                {
                    tmp1 = s1[i];
                    s1[i] -= tmp;
                    tmp = tmp1;
                }

                s = "";
                s1[0] -= 5;
                for (int i = 0; i < s1.Length; i++)
                {
                    s += s2[s1[i]];
                }
                           }
           Console.WriteLine(s);

        }
    }

http://www.cplusplus.com/reference/algorithm/prev_permutation.html
"If the function can determine the previous smaller permutation, it rearranges the elements as such and returns true. If that was not possible (because it is already at the smallest), it rearranges the elements according to the last permutation (sorted in descending order) and returns false."

On Timus std::prev_permutation function doesn't return false ever.

This code gets TLE:

    std::vector<int> v(5);
    for (int i = 0; i < 2; ++i)
        v[i] = 1;
    while (std::prev_permutation(v.begin(), v.end()));

I'm stupid,but I want you to tell me.

n=14
n=16
n=12

Please help me!

This one is a really tough one. Even though solving it was kind of fun, I really got tired of it. I used a heap. I also tried priority_queue<T> template, but for some reason I was just keep on getting MLE on the test #7. I really don't know how other people made a good use of priority_queue<T>. My advise is simple - just use binary heap with "add to a heap" and "delete from a heap" operations. If you don't know what it is visit this site "http://en.wikipedia.org/wiki/Binary_heap"(I would pay attention to the part where the author describes an array implementation of it). Good luck.

Edited by author 28.06.2007 20:21

I got crash on test 1
Is test 1 the sample?
I passed the sample.. why?

The old limitations were 1000 tests in multitest and 25000 childs in one test. There are no more than 16 tests in multitests now. Tests were seriously updated (in fact only Test#1 and Test#2 were not changed). About 300 authors lost their AC after rejudge.

#include<stdio.h>
int main()
{
 long int i,n,m,x;
 scanf("%d", &n);
 scanf("%d", &m);
 int a[20000]={0};
for(i=1;i<=m;i++)
{scanf("%ld", &x);a[x]++;
}
for(i=1;i<=n;i++)
{
 printf("%.2f%%\n",(double)((double)a[i]*100/(double)m));
}
return 0;
}