oj.uz

Submission #117073

# Submission time Handle Problem Language Result Execution time Memory
117073 2019-06-14T15:42:53 Z emilem Board (CEOI13_board) Java 11
40 / 100
 200 ms 191392 KB 
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.math.BigInteger;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

class board
{
    static BigInteger min(BigInteger a, BigInteger b)
    {
        return a.compareTo(b) < 0 ? a : b;
    }
	static int Depth(String a)
	{
		int depth = 0;
		for (int i = 0; i < a.length(); ++i)
			if (a.charAt(i) == 'U')
				--depth;
			else if (a.charAt(i) == '1' || a.charAt(i) == '2')
				++depth;
		return depth;
	}
	static BigInteger Coord(String a)
	{
		BigInteger coord = BigInteger.ZERO;
		for (int i = 0; i < a.length(); ++i)
			switch(a.charAt(i))
			{
			case '1':
				coord = coord.multiply(BigInteger.valueOf(2)); break;
			case '2':
				coord = coord.multiply(BigInteger.valueOf(2));
				coord = coord.add(BigInteger.ONE); break;
			case 'L':
				coord = coord.subtract(BigInteger.ONE); break;
			case 'R':
				coord = coord.add(BigInteger.ONE); break;
			case 'U':
				coord = coord.divide(BigInteger.valueOf(2));
			}
		return coord;
	}
    public static void main(String[] args)
	{
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
		String path = in.nextString();
		int aDepth = Depth(path);
		BigInteger aCoord = Coord(path);
		path = in.nextString();
		int bDepth = Depth(path);
		BigInteger bCoord = Coord(path);
		if (aDepth > bDepth)
		{
		    int temp1 = aDepth; aDepth = bDepth; bDepth = temp1;
			BigInteger temp2 = aCoord; aCoord = bCoord; bCoord = temp2;
		}
		int depthSteps = bDepth - aDepth;
		bDepth = aDepth;
		bCoord = bCoord.shiftLeft(-depthSteps);
		BigInteger ans = aCoord.subtract(bCoord).abs().add(BigInteger.valueOf(depthSteps));
		while (aDepth-- > 0)
		{
			depthSteps += 2;
			aCoord = aCoord.divide(BigInteger.valueOf(2));
			bCoord = bCoord.divide(BigInteger.valueOf(2));
			ans = min(ans, aCoord.subtract(bCoord).abs().add(BigInteger.valueOf(depthSteps)));
		}
        out.println(ans);
        out.close();
	}

    static class InputReader
	{
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream)
		{
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String nextString()
		{
            while (tokenizer == null || !tokenizer.hasMoreTokens())
			{
                try { tokenizer = new StringTokenizer(reader.readLine()); }
                catch (IOException e) { throw new RuntimeException(e); }
            }
            return tokenizer.nextToken();
        }

        public int nextInt()
		{
            return Integer.parseInt(nextString());
        }
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 9848 KB Output is correct
2 Correct 83 ms 9684 KB Output is correct
3 Correct 78 ms 9972 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 203 ms 25436 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 9980 KB Output is correct
2 Correct 80 ms 9936 KB Output is correct
3 Correct 76 ms 10004 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 15024 KB Output is correct
2 Execution timed out 249 ms 32516 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 10152 KB Output is correct
2 Correct 84 ms 10144 KB Output is correct
3 Correct 84 ms 10124 KB Output is correct
4 Correct 77 ms 9868 KB Output is correct
5 Correct 81 ms 9872 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 13404 KB Output is correct
2 Correct 129 ms 14732 KB Output is correct
3 Correct 87 ms 10204 KB Output is correct
4 Correct 90 ms 10196 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 196 ms 22748 KB Output is correct
2 Execution timed out 428 ms 49736 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1102 ms 185168 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1135 ms 191392 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1089 ms 181528 KB Time limit exceeded
2 Halted 0 ms 0 KB -