Shadows of the Knight - Episode 1 - Puzzle discussion


#63

Had a good sleep and when woke up, I finally saw the solution.
For example, when the building has width 4, Batman only needs 3 steps to go from left to right.
The moving area is smaller than the W and H of the building.
Now I can get 100% pass without relying on luck.


#65

in level tour it does not gives it does not give direction bombdir in c++ compiler. in java c ok


#66

I have problem with TC6 (Evasive) - no sense there for me.

Final results for me is:
Batman moved from window (0,2) to window (0,1)
The bombs are located above Batman

Or:
Batman moved from window (0,2) to window (0,0)
The bombs are located below Batman

Where is the bomb? :smiley:


#67

Can anybody help me? I can’t go through validation tests “Correct cutting”.


#68

What algo do you use? Is it binary search? If yes, then pay attention to the rounding.


#69

Thanks for help. It’s working!


#70

I don’t see the test list in the IDE, how to fix this? (for all puzzles, tested different browsers, some setting I’m missing?)

See the image:

Thx a lot!


#71

the ultimate level :smiley:

We’ll look into it.

EDIT: Fixed!


#72

Hi i have a small bug. When i test tower for example i begin at 0,1 debug say that the bomb is down so i go in 0,40 and it say down so my program searching between 40 and 60 but bomb is on 0,36.

Sorry for my bad english.


#73

I pass all tests except Tower. It’s because of rounding but my question is how do I know which way I need to round (up or down)? I’ve tried the following:

  1. always round up with this I fail the validator in the IDE
  2. always round down with this I fail the validator when I submit
  3. round towards the direction needed to go, I fail “Evasive” and “Not There?”

I’m just not sure how I would know which way I need to round


#74

I solved it by rounding up when the condition calls for you to go up or left.


#75

When i submit it loads for a long time but it still doesnt give a result but for the test cases that are shown it runs perfectly fine. Also for my report it doesnt show anything


#76

Seems it was a temporary issue since you validated the puzzle. Let me know if it reoccurs.


#78

i am using python and this is the code

import sys
import math
# Auto-generated code below aims at helping you parse
# the standard input according to the problem statement.
# w: width of the building.
# h: height of the building.
w, h = [int(i) for i in raw_input().split()]
n = int(raw_input())  # maximum number of turns before game over.
x0, y0 = [int(i) for i in raw_input().split()]
# game loop
while True:
    bomb_dir = raw_input()  # the direction of the bombs from batman's current location (U, UR, R, DR, D, DL, L or UL) 
    if bomb_dir == 'U':
        print str(x0    ) + ' ' + str(y0 - 1)
    elif bomb_dir == 'UR':
        print str(x0 + 1) + ' ' + str(y0 - 1)
    elif bomb_dir == 'R':
        print str(x0 + 1) + ' ' + str(y0)
    elif bomb_dir == 'DR':
        print str(x0 + 1) + ' ' + str(y0 + 1)
    elif bomb_dir == 'D':
        print str(x0    ) + ' ' + str(y0 + 1)
    elif bomb_dir == 'DL':
        print str(x0 - 1) + ' ' + str(y0 + 1)
    elif bomb_dir == 'L':
        print str(x0 - 1) + ' ' + str(y0)
    elif bomb_dir == 'UL':
        print str(x0 - 1) + ' ' + str(y0 - 1)

why is the ‘D’ part in the code not working? it goes back and forth, back and forth forever


#79

Since you never modify x0 nor y0, Batman cannot go far.


#80

hello everyone, i have finished the code in C++ and there is no syntax errors but " batman" never even moved.
this message appears in console input “Timeout: your program did not provide an input in due time”.
but i can’t detect error in my code, can any one help ?:grinning:


#81

Hi, Im lost here. Used all optimalizations I could find, but still missing 1 step by 1 field on last 2 checks.
Im using binarysearch with ceil of (max-current)/2 . Also working with limiting limits after each move by 1. And that Batman always move for at least 1 field if hes missing in that dirrection. Its basically all I could think of and what I found on this forum. Yet still missing some piece… Using Java.
My code:
public static void main(String args[]) {
Scanner in = new Scanner(System.in);
int W = in.nextInt(); // width of the building.
int H = in.nextInt(); // height of the building.
int N = in.nextInt(); // maximum number of turns before game over.
int X0 = in.nextInt();
int Y0 = in.nextInt();

        // game loop
        int nextX = X0;
        int nextY = Y0;
        int minW = 0;
        int minH = 0;
        int maxW = W;
        int maxH = H;
        int modifierXright = 2, modifierXleft = 2, modifierYdown = 2, modifierYup = 2,modifier = 2;
        while (true) {
            String bombDir = in.next();
            
            modifierXright = newModifier(nextX,maxW);
            if(modifierXright == 0) modifierXright = 1;
            modifierXleft = newModifier(nextX,minW);
            if(modifierXleft == 0) modifierXleft = -1;
            modifierYdown = newModifier(nextY,maxH);
            if(modifierYdown == 0) modifierYdown = 1;
            modifierYup = newModifier(nextY,minH);
            if(modifierYup == 0) modifierYup = -1;
            System.err.println("modifierXright= "+modifierXright+" modifierXleft= "+modifierXleft+
            " modifierYdown= "+modifierYdown + " modifierYup= " + modifierYup +
            "\nminW= "+minW+" maxW= "+maxW+" minH= "+minH+" maxH= "+maxH);
            
            switch(bombDir) {
                case "U": {
                    maxH = nextY-1;
                    nextY+=modifierYup; 
                    }break;
                case "UR": {
                    maxH = nextY-1; minW = nextX+1;
                    nextX+=modifierXright;nextY+=modifierYup;
                    }break;
                case "R":{
                    minW = nextX+1;
                    nextX+=modifierXright;
                    }break;
                case "DR": {
                    minH = nextY+1; minW = nextX+1;
                    nextX+=modifierXright;nextY+=modifierYdown;
                    }break;
                case "D": {
                    minH = nextY+1;
                    nextY+=modifierYdown;
                    };break;
                case "DL": {
                    minH = nextY+1; maxW = nextX-1;
                    nextX+=modifierXleft;nextY+=modifierYdown;
                    }break;
                case "L": {
                    maxW = nextX-1;
                    nextX+=modifierXleft;
                    }break;
                case "UL": {
                    maxH = nextY-1; maxW = nextY-1;
                    nextX+=modifierXleft;nextY+=modifierYup;
                    }break;
                }
            
            
            System.out.println(nextX+" "+nextY);
        }
    }
    
    private static int newModifier(float currentPos, float maxPos) {
        return (int)(Math.ceil((maxPos-currentPos)/2.0));
    }

#82

Everything works fine, but last challenge just shows that: Timeout: your program did not provide input in due time. :expressionless:
Edit 1: LOL, Because the map is too large for some calculations it can’t answer fast enough.


#83

I can seem to get my if statements to trigger. Can anyone help me out or explain why?


#84

I’m kinda new to coding and this site, could someone please tell me the solution or at least help me with what i have to do?