Code Submission Evaluation System Login

Datatähti 2016 alku

Start:2015-09-28 00:00:00
End:2015-10-12 00:00:00
 

Tasks | Scoreboard | Statistics


CSES - Datatähti 2016 alku - Results
History
2015-10-08 21:10:3347
2015-10-08 21:09:4447
2015-10-08 21:08:480
2015-10-08 20:41:2647
2015-10-08 20:41:030
2015-10-08 20:31:400
2015-10-08 20:18:240
2015-10-08 20:17:070
2015-10-08 20:14:260
2015-10-08 20:11:580
2015-10-08 20:10:370
2015-10-08 19:25:130
2015-10-08 17:58:550
2015-10-06 20:53:240
2015-10-06 20:15:240
2015-10-06 19:34:170
2015-10-04 13:10:130
2015-10-04 13:00:580
2015-10-03 23:05:530
2015-10-03 22:41:010
2015-10-03 22:33:160
2015-10-03 22:23:150
2015-10-02 22:29:520
2015-09-29 20:14:270
2015-09-29 20:11:490
2015-09-29 20:06:360
2015-09-29 20:05:45
2015-09-29 20:02:130
2015-09-29 18:37:370
Task:Tontti
Sender:Maunuliini
Submission time:2015-10-06 19:34:17
Language:Java
Status:READY
Score:0

Feedback

groupverdictscore
#1WRONG ANSWER0
#2WRONG ANSWER0
#3TIME LIMIT EXCEEDED0

Test results

testverdicttime (s)group
#1WRONG ANSWER0.17 / 1.001details
#2WRONG ANSWER0.17 / 1.001details
#3WRONG ANSWER0.17 / 1.001details
#4WRONG ANSWER0.18 / 1.001details
#5WRONG ANSWER0.17 / 1.001details
#6WRONG ANSWER0.57 / 1.002details
#7WRONG ANSWER0.68 / 1.002details
#8WRONG ANSWER0.49 / 1.002details
#9WRONG ANSWER0.52 / 1.002details
#10WRONG ANSWER0.54 / 1.002details
#11TIME LIMIT EXCEEDED-- / 1.003details
#12TIME LIMIT EXCEEDED-- / 1.003details
#13TIME LIMIT EXCEEDED-- / 1.003details
#14TIME LIMIT EXCEEDED-- / 1.003details
#15TIME LIMIT EXCEEDED-- / 1.003details

Code

/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */


/**
 *
 * @author alexey
 */
import java.util.*;

import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.StringTokenizer;

public class Datatahti20163 {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here
       
        
        IO io = new IO(); 
        int h = io.nextInt();
        int w = io.nextInt();
        int t = io.nextInt();
        int min=Math.min(h, w);
        int[][] forest=new int[h][w];
        int sqw[][] = new int[w+2][w+2];
        int sqh[][] = new int[h+2][h+2];

        int answer=0;
        boolean stop = false;

        
       
        
        int iq=0;
        
        while(iq<h) {
            String newline = io.next();
            for (int j = 0; j < w; j++) {
                if (newline.charAt(j) == '*') {
                    forest[iq][j]=1;
                } else {
                    forest[iq][j]=0;
                }
            }
            iq++;
        }
        
int s=0;
boolean overload=false;

int a=0;
/*

        for (int i = 1; i < min; i++) {
            
            for (int j = i ; j < w; j++) {
                //System.out.println(forest[i][j][0]);
               
               
                
                a=0;
                for (int k = 1; k < i+1; k++) {
                    
                    s=forest[i][j][0];
                    a+=forest[i-k][j][0]+forest[i][j-k][0];
                    if(forest[i-1][j-1][k-1]==-1){
                        forest[i][j][k]=-1; 
                       break;
                    }
                    s+=a+forest[i-1][j-1][k-1];
                    if(s>t){
                       forest[i][j][k]=-1; 
                       break;
                    }
                    forest[i][j][k]=s;
                    
                    if(s==t){
                        answer++;
                    }
                }
                s=0;
                a=0;
            }
            for (int j = i+1; j < h; j++) {
                //System.out.println(forest[j][i][0]);
                 
                
               
                a=0;
                for (int k = 1; k < i+1; k++) {
                    s=forest[j][i][0];
                    a+=forest[j-k][i][0]+forest[j][i-k][0];
                    if(forest[j-1][i-1][k-1]==-1){
                        forest[j][i][k]=-1; 
                       break;
                    }
                    s+=a+forest[j-1][i-1][k-1];
                    if(s>t){
                       forest[j][i][k]=-1; 
                       break;
                    }
                    forest[j][i][k]=s;
                    
                    if(s==t){
                        answer++;
                    }
                }
                s=0;
                a=0;
                
            }
        }


*/
        for (int i = 0; i < w; i++) {
            sqw[i][0]=forest[0][i];
        }

        for (int i = 1; i < h; i++) {
            sqh[i][0]=forest[i][0];
        }
        
        int x=0;
        int y=0;
        int z=0;
 for (int i = 1; i < min; i++) {
            
            for (int j = i ; j < w; j++) {
                //System.out.println(forest[i][j][0]);
                
                z=sqw[j-1][0];
                y=sqw[j-1][1];
                a=forest[i][j];
                for (int k = 1; k < i+1; k++) {
                    
                    a+=forest[i-k][j]+forest[i][j-k];
                    x=y;
                    x=sqw[j-1][k];
                    if(sqw[j-1][k]==-1||a+y>t){
                        sqw[j-1][k]=-1;
                    }
                    sqw[j-1][k]=a+y;
                    if(sqw[j-1][k]==t){
                        answer++;
                    }
                     
                }
                sqw[j-1][0]=z+forest[i][j];
                s=0;
                a=0;
            }
            
            for (int j = i+1; j < h; j++) {
                //System.out.println(forest[j][i][0]);
                 z=sqh[j][0];
                y=sqh[j][1];
                a=forest[j][i];
                
                for (int k = 1; k < i+1; k++) {
                    
                    a+=forest[j-k][i]+forest[j][i-k];
                    x=y;
                    x=sqh[j][k];
                     if(sqw[j][k]==-1||a+y>t){
                        sqw[j][k]=-1;
                    }
                    sqh[j][k]=a+y;
                    if(sqh[j][k]==t){
                        answer++;
                    }
                     
                }
                sqw[j][0]=z+forest[j][1];
                s=0;
                a=0;   
            }
            
        }






        io.println(answer);
        io.close();
    }
    static class IO extends PrintWriter {
	private BufferedReader r;
	private StringTokenizer s;
	
	public IO() {
		super(new BufferedOutputStream(System.out));
		r = new BufferedReader(new InputStreamReader(System.in));
	}
	
	public String nextLine() {
		String s = null;
		try {
			s = r.readLine();
		} catch (Exception e) {}
		if(s == null) throw new NoSuchElementException();
		return s;
	}
	
	public String next() {
		while (s == null || !s.hasMoreElements()) {
			s = new StringTokenizer(nextLine());
		}
		return s.nextToken();
	}
        public int nextInt() {
		return Integer.parseInt(next());
	}
}
}


Test details

Test 1

Group: 1

Verdict: WRONG ANSWER

input
10 10 1
......*...
.......*..
*..*....*.
*....*....
...
view   save

correct output
94

view   save

user output
99

view   save

Test 2

Group: 1

Verdict: WRONG ANSWER

input
10 10 5
**********
**********
**********
**********
...
view   save

correct output
0

view   save

user output
6

view   save

Test 3

Group: 1

Verdict: WRONG ANSWER

input
10 10 10
**...*...*
*..*.**.*.
...**.*..*
*...**.*..
...
view   save

correct output
4

view   save

user output
26

view   save

Test 4

Group: 1

Verdict: WRONG ANSWER

input
10 10 5
****......
*.*.**..**
....*.*..*
...*.***..
...
view   save

correct output
16

view   save

user output
31

view   save

Test 5

Group: 1

Verdict: WRONG ANSWER

input
10 10 2
**.***..*.
...*.*....
.***.*...*
***.***..*
...
view   save

correct output
30

view   save

user output
38

view   save

Test 6

Group: 2

Verdict: WRONG ANSWER

input
500 500 1
.................................
view   save

correct output
9552040

view   save

user output
522007

view   save

Test 7

Group: 2

Verdict: WRONG ANSWER

input
500 500 5
.................................
view   save

correct output
1536063

view   save

user output
13859

view   save

Test 8

Group: 2

Verdict: WRONG ANSWER

input
500 500 25000
**...*...**..*.*..*.**.*..*.*....
view   save

correct output
288

view   save

user output
0

view   save

Test 9

Group: 2

Verdict: WRONG ANSWER

input
500 500 12500
**.**.*..*...*.**...*.***........
view   save

correct output
786

view   save

user output
0

view   save

Test 10

Group: 2

Verdict: WRONG ANSWER

input
500 500 5000
.*.*.**..*.*.**.**..*..**...*....
view   save

correct output
1763

view   save

user output
0

view   save

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
2000 2000 1
.................................
view   save

correct output
489611392

view   save

user output
(empty)

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
2000 2000 5
.................................
view   save

correct output
120725884

view   save

user output
(empty)

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
2000 2000 400000
..*..**.**.**.*.***...**.*..**...
view   save

correct output
1849

view   save

user output
(empty)

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
2000 2000 200000
***.*....*.*..*....**..*..*.*....
view   save

correct output
2665

view   save

user output
(empty)

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
2000 2000 80000
**.**...*.***.**....**.*....*....
view   save

correct output
5587

view   save

user output
(empty)