oj.uz

Submission #329069

# Submission time Handle Problem Language Result Execution time Memory
329069 2020-11-18T22:46:46 Z KWang31 Nautilus (BOI19_nautilus) Java 11
66 / 100
 1000 ms 21888 KB 
import java.io.*; import java.util.*;
public class nautilus{
  static class FastReader 
    { 
        BufferedReader br; 
        StringTokenizer st; 
  
        public FastReader() 
        { 
            br = new BufferedReader(new
                     InputStreamReader(System.in)); 
        } 
  
        String next() 
        { 
            while (st == null || !st.hasMoreElements()) 
            { 
                try
                { 
                    st = new StringTokenizer(br.readLine()); 
                } 
                catch (IOException  e) 
                { 
                    e.printStackTrace(); 
                } 
            } 
            return st.nextToken(); 
        } 
  
        int nextInt() 
        { 
            return Integer.parseInt(next()); 
        } 
  
        
    } 
    static int MOD=998244353;
    static long[][] map;
    static long[][] dp;
    static long[] ans;
    static int R,C;
    public static void main(String[] args){
        /*
        for (int i = 0; i < 2; i++) {
            for (int j = 0; j < 65; j++) {
                System.out.print(".");
            }
            System.out.println("");
        }*/
        
        FastReader br=new FastReader();
        R=br.nextInt(); C=br.nextInt();int M=br.nextInt();
        map=new long[R][(C+63)/64]; String s;
        for (int i = 0; i < R; i++) {//Setting up the map
            s=br.next();
            
            for (int j = 0; j < C; j+=64) {
                for (int k = 0; k <Math.min(C-j,64); k++) {
                    
                    if(j+k<C && s.charAt(j+k)=='.'){
                        
                        map[i][j/64]|=(long) 1<<k;
                        //System.out.println(i+"::"+j+"::"+map[i][j/64]);
                    }
                }
            }
        }
        
        s=br.next(); dp=new long[R][(C+63)/64];
        for(int i=0;i<R;i++){
            for(int j=0;j<(C+63)/64; j++){
                dp[i][j]=map[i][j];//All positions are reachable with 0 moves
            }
        }	
      
        
        for (int i = 0; i < M; i++) {
            if(s.charAt(i)=='E'){//Shift right
                for (int j = 0; j < R; j++) {
                    
                    shift(dp[j],1,j);
                    dp[j]=ans.clone();
                }
            }else if(s.charAt(i)=='W'){
                for (int j = 0; j < R; j++) {
                    
                    shift(dp[j],-1,j);
                    dp[j]=ans.clone();
                }
            }else if(s.charAt(i)=='N'){
                for (int j = 0; j < R-1; j++) {
                    for (int k = 0; k <(C+63)/64; k++) {
                        dp[j][k]=dp[1+j][k]&map[j][k];
                    }
                }
                Arrays.fill(dp[R-1],0);
                
            }else if(s.charAt(i)=='S'){
                for (int j = R-1; j > 0; j--) {
                   
                    
                    for (int k = 0; k <(C+63)/64; k++) {
                        dp[j][k]=dp[j-1][k]&map[j][k];
                    }
                }
                
                Arrays.fill(dp[0],0);
                
            }else{//Take the OR of all four, then AND the map
                long[][] a=new long[R][(C+63)/64];
                
                for (int j = 0; j <R; j++) {
                    
                    shift(dp[j],1,j);
                    a[j]=ans.clone();
                    
                    shift(dp[j],-1,j);
                    for (int k = 0; k < (C+63)/64;k++) {
                        a[j][k]|=ans[k];
                    }
                    if(j>0){
                        for (int k = 0; k <(C+63)/64; k++) {
                            a[j][k]|=dp[j-1][k];
                        }
                    }
                    if(j<R-1){
                        for (int k = 0; k <(C+63)/64; k++) {
                            a[j][k]|=dp[j+1][k];
                        }
                    }
                    //Do I need to make a[.][k] 0? No! They would not be affected because I have ORed them with the correct stuff.
                    for (int k = 0; k <(C+63)/64; k++) {
                        a[j][k]&=map[j][k];
                    }
                }
                for(int k=0;k<R;k++){
	for(int j=0;j<(C+63)/64; j++){
                            dp[k][j]=a[k][j];
	}
                }
            }
            
        }
        int res=0;
        for (int i = 0; i < R; i++) {
            for (int j = 0; j <(C+63)/64; j++) {
                
                res+=Long.bitCount(dp[i][j]);
            }
        }
        System.out.println(res);
    }
    public static void shift(long[] a, int c, int ind){
        int len=(63+C)/64; ans=new long[len];
        if(c==1){
            long x=(long) 1<<63;
            for (int i = 0; i < len-1; i++) {
                long b=a[i]&(x-1);
                ans[i]|=((long) b<<1);
                long d=a[i]>>>63;//3>'s, 2>'s don't work
                ans[i+1]|=d;
            }
            //Take care of last bit
            ans[len-1]|=(a[len-1]<<1);
        }else{//c=-1
            ans[0]=a[0]>>>1;
            for (int i = 1; i < len; i++) {
                long b=a[i]&1;
                ans[i-1]|=((long)b<<63);
                ans[i]|=a[i]>>>1;
            }
        }
        for (int i = 0; i <(C+63)/64; i++) {
            ans[i]&=map[ind][i];
        }
        
    }
}
//Debugging:
//Are you sure your algorithm is correct?
//Bounds: long
//Special cases: n=0,1?
//Make sure you remove your debugging code before you submit!

Subtask #1
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 10304 KB Output is correct
2 Correct 131 ms 10580 KB Output is correct
3 Correct 140 ms 10412 KB Output is correct
4 Correct 137 ms 10404 KB Output is correct
5 Correct 130 ms 10576 KB Output is correct
6 Correct 127 ms 10524 KB Output is correct

Subtask #2
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 10304 KB Output is correct
2 Correct 131 ms 10580 KB Output is correct
3 Correct 140 ms 10412 KB Output is correct
4 Correct 137 ms 10404 KB Output is correct
5 Correct 130 ms 10576 KB Output is correct
6 Correct 127 ms 10524 KB Output is correct
7 Correct 131 ms 10808 KB Output is correct
8 Correct 142 ms 10664 KB Output is correct
9 Correct 134 ms 10920 KB Output is correct
10 Correct 135 ms 10844 KB Output is correct
11 Correct 129 ms 10796 KB Output is correct
12 Correct 175 ms 13980 KB Output is correct
13 Correct 172 ms 13716 KB Output is correct
14 Correct 173 ms 13808 KB Output is correct
15 Correct 170 ms 13980 KB Output is correct
16 Correct 173 ms 13812 KB Output is correct
17 Correct 154 ms 12156 KB Output is correct
18 Correct 158 ms 12284 KB Output is correct
19 Correct 164 ms 12224 KB Output is correct
20 Correct 159 ms 12184 KB Output is correct
21 Correct 155 ms 12284 KB Output is correct

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 10304 KB Output is correct
2 Correct 131 ms 10580 KB Output is correct
3 Correct 140 ms 10412 KB Output is correct
4 Correct 137 ms 10404 KB Output is correct
5 Correct 130 ms 10576 KB Output is correct
6 Correct 127 ms 10524 KB Output is correct
7 Correct 131 ms 10808 KB Output is correct
8 Correct 142 ms 10664 KB Output is correct
9 Correct 134 ms 10920 KB Output is correct
10 Correct 135 ms 10844 KB Output is correct
11 Correct 129 ms 10796 KB Output is correct
12 Correct 175 ms 13980 KB Output is correct
13 Correct 172 ms 13716 KB Output is correct
14 Correct 173 ms 13808 KB Output is correct
15 Correct 170 ms 13980 KB Output is correct
16 Correct 173 ms 13812 KB Output is correct
17 Correct 154 ms 12156 KB Output is correct
18 Correct 158 ms 12284 KB Output is correct
19 Correct 164 ms 12224 KB Output is correct
20 Correct 159 ms 12184 KB Output is correct
21 Correct 155 ms 12284 KB Output is correct
22 Correct 695 ms 21668 KB Output is correct
23 Correct 666 ms 20736 KB Output is correct
24 Correct 650 ms 20380 KB Output is correct
25 Correct 700 ms 20992 KB Output is correct
26 Correct 734 ms 21888 KB Output is correct
27 Correct 869 ms 21536 KB Output is correct
28 Correct 851 ms 20632 KB Output is correct
29 Correct 829 ms 20492 KB Output is correct
30 Correct 853 ms 20464 KB Output is correct
31 Correct 940 ms 21844 KB Output is correct
32 Execution timed out 1000 ms 20388 KB Time limit exceeded
33 Halted 0 ms 0 KB -