If you have a problem - WA4 - consider sorting input, not output

for example:

5
1 5
3 6
1 3
9 6
4 2

answer
3
1 3
3 6
6 9

This may help you: http://en.wikipedia.org/wiki/Round-robin_tournament

#include <iostream>
using namespace std;


int main()
{
    int n = 0, m = 0, a = 0, s = 0, k = 0;
    int arr[15001];
    cin >> n;
    for(int i = 0; i < n; i ++)
    {
        cin >> arr[i];
    }
    cin >> m;
    bool flag = true;
    int j = 0;
    int left = 0, right = n-1;
    for(int i = 0; i < m; i++)
    {
        cin >> a;
        j = 0;
        left = 0;
        right = n-1;
        flag = true;

        if(a == arr[0])
        {
            flag = false;
            s++;
        }
        else
        {
            if(a == arr[n-1])
            {
                flag = false;
                s++;
            }
        }
        if(a > arr[n-1])
        {
            flag = false;
        }

        while(flag)
        {
            if(a > arr[j])
            {
                left = j;
                j = (left + right)/2;
                if(a == arr[j])
                {
                    {
                        flag = false;
                        s++;
                    }
                }
                if(right-left <= 1)
                {
                    flag = false;
                    if(a == arr[j+1]) s++;
                }
            }
            else
            {
                right = j;
                j = (left + right)/2;
                if(a == arr[j])
                {
                    {
                        flag = false;
                        s++;
                    }
                }
                if(right-left <= 1)
                {
                    flag = false;
                    if(a == arr[j+1]) s++;
                }
            }
        }
    }
    cout << s;
    return 0;
}

Edited by author 17.11.2013 16:03

My damned solution keep giving WA on test 6 with C11. I tested on big numbers and every corner case (yes, it works with 1 1 -> '0', yes, it gives '-1' on 3 6, etc..)

Suggestions? What's in test 6?

The exact same algorithm in python gives AC.. (and it's not a bignum issue, I tested the C version with 43 and 10**9)

Edited by author 24.11.2013 01:26

give some tests plz

I use BFS, but WA12 :( Help me, pleas give me test

var a,b:array[1..1000000] of  integer;
f:array[1..1000000]of integer;
n,v,e,k,u:integer;
begin
k:=0;
assign(input, 'input.txt'); reset(input);
assign(output, 'output.txt'); rewrite(output);
readln(n);
for v:=1 to n do begin
  read(a[v]);
  read(b[v]);
  readln
end;
for e:=n downto 1 do begin
 f[e]:=a[e]+b[e];
f[e]:=f[e]+k;
 if f[e]>9 then begin
 f[e]:=f[e]-10;
 k:=1;
 end
 else
 k:=0;
 if((e=1)and(f[e]>9)) then
 f[e]:=f[e]+10;
end;
for u:=1 to n do
write(f[u]);
end.

New timelimit is 1.5 seconds. All solutions were rejudged.

I found a test that might be you don't have:
input:
2
AA

output:
2.000

my program accepted even it's not passed this test. plase add this test as a variant

I'm getting WA#4, can you give some tests?

If they both start from the same position, who eats the number from that position?

#include "stdafx.h"
#include "stdio.h"
#include "locale.h"


int main()
{
    setlocale(LC_CTYPE, "rus");

    int X, Z;

    char Y;

    printf("Введите координаты клетки коня: ");
        scanf("%c%d", &Y, &Z);

        switch (Y)
        {
        case 'a': Y = 1;
            break;
        case 'b': Y = 2;
            break;
        case 'c': Y = 3;
            break;
        case 'd': Y = 4;
            break;
        case 'e': Y = 5;
            break;
        case 'f': Y = 6;
            break;
        case 'g': Y = 7;
            break;
        case 'h': Y = 8;
            break;
        default:
            break;
        }

        if (Y == 1 && Z == 1 || Y == 1 && Z == 8 || Y == 8 && Z == 1 || Y == 8 && Z == 8) {
        printf("Клеток под боем: 2\n");
    } else {
        if (Y == 1 && Z == 2 || Y == 1 && Z == 7 || Y == 2 && Z == 1 || Y == 2 && Z == 8 || Y == 7 && Z == 1 || Y == 7 && Z == 8 || Y == 8 && Z == 2 || Y == 8 && Z == 7) {
            printf("Клеток под боем: 3\n");
        } else {
            if (Y == 1 && Z == 3 || Y == 1 && Z == 4 || Y == 1 && Z == 5 || Y == 1 && Z == 6 || Y == 8 && Z == 3 || Y == 8 && Z == 4 || Y == 8 && Z == 5 || Y == 8 && Z == 6 || Z == 1 && Y == 3 || Z == 1 && Y == 4 || Z == 1 && Y == 5 || Z == 1 && Y == 6 || Z == 8 && Y == 3 || Z == 8 && Y == 4 || Z == 8 && Y == 5 || Z == 8 && Y == 6 || Y == 2 && Z == 2 || Y == 2 && Z == 7 || Y == 7 && Z == 2 || Y == 7 && Z == 7) {
                printf("Клеток под боем: 4\n");
            } else {
                if (Y == 2 && Z == 3 || Y == 2 && Z == 4 || Y == 2 && Z == 5 || Y == 2 && Z == 6 || Y == 7 && Z == 3 || Y == 7 && Z == 4 || Y == 7 && Z == 5 || Y == 7 && Z == 6 || Z == 2 && Y == 3 || Z == 2 && Y == 4 || Z == 2 && Y == 5 || Z == 2 && Y == 6 || Z == 7 && Y == 3 || Z == 7 && Y == 4 || Z == 7 && Y == 5 || Z == 7 && Y == 6) {
                    printf("Клеток под боем: 6\n");
                } else {
                    if (Y == 3 && Z == 3 || Y == 3 && Z == 4 || Y == 3 && Z == 5 || Y == 3 && Z == 6 || Y == 4 && Z == 3 || Y == 4 && Z == 4 || Y == 4 && Z == 5 || Y == 4 && Z == 6 || Y == 5 && Z == 3 || Y == 5 && Z == 4 || Y == 5 && Z == 5 || Y == 5 && Z == 6 || Y == 6 && Z == 3 || Y == 6 && Z == 4 || Y == 6 && Z == 5 || Y == 6 && Z == 6) {
                        printf("Клеток под боем: 8\n");
                    } else {
                        printf("Где конь, парень? 0_о \n");
                    }
                }
            }
        }
    }

    return 0;

}

what's wrong, guys? :D
P.S.: WA 1

My algorithm finds the numbers on the left and right, and then compares them, and takes a step toward greater. But if the sum is equal, it compares to one until it finds one larger (and goes upwards). If comparing the results in one step, then goes in the direction of the enemy.

What's wrong?

On #1 test my program output:
4
6 1 5 4
but get wrong answer. Why?

import java.io.*;
import java.util.*;

public class Main {
    public static void main(String[] args)
    {
        Scanner in = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);
        int n = in.nextInt();
        String[] a = new String[n];
        int[] result = new  int[n];
        for (int i = 0 ; i < n ; i++){
            String tmp = in.next();
            String x = tmp.substring(0,1);
            String y = tmp.substring(1,2);
            int xi=0;
            ArrayList<String> letters = new ArrayList<String>();
            Collections.addAll(letters, "a", "b", "c", "d", "e", "f", "g", "h");
            xi = letters.indexOf(x);
            int yi = Integer.parseInt(y)-1;
            int[][] desk = new int[8][8];
            for (int[] tmp_array :desk){
                Arrays.fill(tmp_array,1);
            }
            result[i]=0;
            result[i]=result[i] +
                    check(desk,xi+1,yi+2)+
                    check(desk,xi+2,yi+1)+
                    check(desk,xi-1,yi+2)+
                    check(desk,xi-2,yi+1)+
                    check(desk,xi+1,yi-2)+
                    check(desk,xi+2,yi-1)+
                    check(desk,xi-1,yi-2)+
                    check(desk,xi-2,yi-1);
        }
        for (int j : result){
            out.println(j);
        }
        out.flush();
    }
    public static int check(int[][] desk, int x, int y){
        int add = 0;
        try{
            if (desk[x][y]==1){
                add++;
            }
        }catch (Exception e){}
        return add;
    }
}

Why?

#include <iostream>
using namespace std;

int main ()
{
    int x,y=0;
    cin >> x;
    if (x==1)
    {
        cout << x-1;
        return 0;
        system ("pause > void");
    }
    if (x>1 && x<=10000)
    {
        for (int z=1;z<=x;++z)
        {
            y+=z;
        }
    }
    if (x<1 && x>=-10000)
    {
        for (int z=x;z<=1;++z)
        {
            y+=z;
        }
    }
    cout << y;
    system ("pause > void");
}

Edited by author 10.11.2013 23:05

Cual es la entrada y salida del test 4?

0.062s and 2125Kb

I solve it on C#. With Hashtable it's very easy.

p.s. GL & HF


Edited by author 22.01.2008 17:18

Give plz some tests

В чём ошибка не пойму.?  не проходит 1 тест

var i,j,k,m,s,n:integer;
a,b:array[1..100000] of integer;
begin
  read(n);
  k:=0;
  for i:=1 to n do read(a[i]);
  read(m);
  for i:=1 to m do read(b[i]);

  for i:=1 to n do begin
  for j:=1 to m do begin
  if a[i]+b[j]=10000 then k:=1;
  end;
  end;
if k=1 then write('yes');
if k=0 then write('no');
end.

Edited by author 05.02.2011 21:26

Edited by author 05.02.2011 21:30