hi

can you please show / send me some hint about test #2 ? (I think you can see the source code of my attempt)
p519446 at yandex.ru

TIA.

I am learning  python.
When i see  the example of problem 1000 and 1001, python reads  from stdin.
How can i read from input.txt without changing my program every  time i send  it  in.

e.g. pascal  uses #ifdef online_judge to read from files

hi all

I'm interesting on praxis to solve tasks using java threads.
Do we have here such ones ?

Many thanks to author of this task and Oleg Strekalovsky [Vologda SPU] for the hint ( http://acm.timus.ru/forum/thread.aspx?id=22536&upd=634614144741133716 ).
PS. It is very unexpectedly to me that some collection types (e.g. HashMap) take so much memory and CPU time in java :-/

Edited by author 19.04.2013 22:14

Edited by author 19.04.2013 22:14

What the hell is test 9?
In my computer I got 0.06s in worst case but still TLE 9!

Write me 10 test, please !

I guess there is a test case that the condition 1<=Q<=N-1 is not satisfied.
I put a condition that if Q is outside the given interval then output 0 and got WA#1.
Without this condition, it gives WA#8.

Edited by author 18.04.2013 20:01

My programm works on my computer. Timus gives me this verdict. Why it may be?I write on C++ in Dev. May be I cannot use strings?

Edited by author 16.03.2011 20:11

#include <iostream>

#include <map>
using namespace std;

int main()
{
    map<int,int> table;
    int x,y,sum = 3;
    while(sum--)
    {
        cin >> x;
        while(x--)
        {
            cin >> y;
            table[y]++;
        }
    }
    int s = 0;
    for(int i = 0;i < table.size();i++)
        if(table[i] == 3) s++;
    cout << s;
    return 0;
}

import java.util.Scanner;
public class T_1226_esreveR_redrO {
public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    while(sc.hasNext()){
        String set="ABCDEFGHIJKLMNOPQRSTUVXYZWabcdefghijklmnopqrstuvxyzw";
        String s =sc.nextLine();
        String p="";
        for (int i = 0; i < s.length(); i++) {
            if(set.indexOf(s.charAt(i)+"")>-1)
                p=s.charAt(i)+p;
            else{
                System.out.print(p);
                p="";
                System.out.print(s.charAt(i));
            }
        }
        System.out.println(p);
    }
}
}

Time limit is changed from 4 to 2 seconds.
First test is changed to the sample.
Submissions are rejudged.

#include<iostream>
#include<queue>
#include<stdio.h>
using namespace std;
int main()
{
  int n,i,k,m,n1,n2;
  priority_queue<int>a;
  cin>>n;
  m=n/2+1;
  for(i=1;i<=m;i++)
  {
    cin>>k;
    a.push(k);
  }
  for(i=m+1;i<=n;i++)
  {
    cin>>k;
    a.push(k);
    a.pop();
  }
  if (n%2) printf("%.1f",1.0*a.top());
  else
  {
    n1=a.top(); a.pop();
    n2=a.top();
    printf("%.1f",((float)n1+(float)n2)/2);
  }
  system("pause");
  return 0;
}

76 85
46 -22
4 15
-10 14
-12 7
-14 20
17 42
11 15
10 -10
60 15
18 -10
43 -51
27 22
-50 -32
-60 -11
-3 -29
-65 -13
-10 2
37 -7
9 -37
-39 42
80 -28
55 -41
-7 -77
-11 17
-6 -54
-55 -48
8 -58
-17 -52
-42 -8
26 -4
24 -13
29 41
-52 14
12 17
55 12
-50 43
27 -8
-33 -78
-42 -2
2 -71
-39 -6
52 -5
-25 62
-51 -2
-19 45
10 12
3 47
-61 37
13 -41
-7 -12
-7 -25
12 15
44 5
-47 -8
-3 -17
-12 -60
-2 28
37 -5
29 -7
-59 61
-17 50
-42 -19
26 51
-10 11
10 5
-1 31
-50 -23
7 -35
29 -47
-5 21
-69 11
13 -17
26 3
13 58
-40 30
-20 -12
please add this test
i found many AC program can't pass it.(they use Simulated Annealing)

Strange,

string s = Console.ReadLine(); ===>AC

string s = Console.ReadLine().Trim(); ===> Runtime Error (AV #2)
string s = Console.ReadLine().TrimEnd(); ====> Same as above

who can explain this?

wrong answer in test 13, help me!

Edited by author 15.04.2013 23:26

What parameters in the test number 9?

 What is test 7?  here is my code. It is working on the available sample inputs. Please help.

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.StringTokenizer;

/**
 *
 * @author proy
 */
class Reader
{
    static BufferedReader reader;
    static StringTokenizer tokenizer;

    /** call this method to initialize reader for InputStream */
    static void init(InputStream input)
    {
        reader = new BufferedReader(new InputStreamReader(input) );
        tokenizer = new StringTokenizer("");
    }

    /** get next word */
    static String next() throws IOException
    {
        while ( ! tokenizer.hasMoreTokens() )
        {
            //TODO add check for eof if necessary
            tokenizer = new StringTokenizer(reader.readLine() );
        }
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException
    {
        return Integer.parseInt( next() );
    }

    static double nextDouble() throws IOException
    {
        return Double.parseDouble( next() );
    }
}
public class p1106
{

    public static void main(String args[]) throws IOException
    {
        int a;
        Reader.init(System.in);

        int n = Reader.nextInt();
        int graph[][]= new int[n][n];
        ArrayList<ArrayList<Integer>> st = new ArrayList<ArrayList<Integer>>();
        ArrayList<Integer> grp1 = new ArrayList<Integer>();
        ArrayList<Integer> grp2 = new ArrayList<Integer>();
        for (int i = 0; i<n;i++)
        {
            ArrayList<Integer> ar = new ArrayList<Integer>();
            do
            {
                a = Reader.nextInt();
                if(a !=0)
                {
                    graph[i][a-1] = 1;
                    ar.add(a-1);
                }

            }
            while(a!=0);
            st.add(ar);
        }



        if(n!=0)
        {
            grp1.add(0);
            for(int i = 1; i<n; i++)
            {
                if(graph[0][i]!= 1 )
                {
                    grp1.add(i);
                }

                else
                {
                    grp2.add(i);
                }
            }

            for(int i = 1; i<grp1.size();i++)
            {
                int x = grp1.get(i);

                if(!st.get(x).isEmpty())
                {
                   boolean frFlag = false;
                   Iterator it = st.get(x).iterator();
                   while(it.hasNext())
                   {
                       if(grp2.contains((Integer)it.next()))
                       {
                           frFlag = true;
                           continue;
                       }
                   }

                   if(!frFlag)
                   {
                       Integer rm = st.get(x).get(0);
                       //grp1.r
                       grp1.remove(rm);
                       grp2.add(rm);
                   }
                }

            }

            System.out.println(grp1.size());
            Iterator it1 = grp1.iterator();
            while(it1.hasNext())
            {
                System.out.print(((Integer)it1.next()+1)+ " ");
            }
        }

        else
        {
            System.out.println(0);
        }

    }

}

Подскажите какой пример в 10ом тесте? уперся и ничего не могу поделать. За ранее спасибо

hi

I found some hint about this task (PQ usage with size = n/2+1) and applied it.
My class have only PQ<Integer> object and three int variables + StreamTokenizer + System.out.
Unfortunately, I've got MLE (1096 Kb).
So I think that java needs more than 1 Mb to store 125'001 elements on PQ<Integer> - is it right ? If yes than which way this task can be solved using java ?

TIA.