hiho week 147 register

Ended

Participants:514

Verdict:Time Limit Exceeded
Score:40 / 100
Submitted:2017-04-27 10:10:19

Lang:Java

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
import java.util.BitSet;
import java.util.Scanner;
import java.io.File;
import java.io.FileNotFoundException;
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[][] list = new int[n][5];
        for(int i=0;i<list.length;i++){
            for(int j=0;j<list[i].length;j++){
                list[i][j= in.nextInt();
            }
        }
        BitSet[][] tag = new BitSet[n][5];
        for(int i=0;i<list.length;i++){
            for(int j=0;j<list[i].length;j++){
                int rank = list[i][j];
                tag[i][j]=new BitSet(n);
                for(int k=0;k<n;k++){
                    if(k != i){
                        if(list[k][j]<ranktag[i][j].set(k);
                    }
                }
            }
        }
        int[] rs= new int[n];
        for(int i=0;i<tag.length;i++){
            BitSet temp = tag[i][0];
            for(int j=1;j<tag[i].length;j++){
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX