hiho week 140 register

Ended

Participants:351

Verdict:Time Limit Exceeded
Score:20 / 100
Submitted:2017-03-07 15:46:37

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.ArrayList;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
class Post {
    int x1y1;
    int x2y2;
    ArrayList<Post> overlap;
}
public class Main {
    
    static int width;
    static int height;
    static int number;
    static ArrayList<Post> postList;
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String line;
        String[] items;
        line = sc.nextLine();
        items = line.split(" ");
        width = Integer.parseInt(items[0]);
        height = Integer.parseInt(items[1]);
        number = Integer.parseInt(items[2]);
        postList = new ArrayList<>();
        for (int i = 0i < numberi++) {
            line = sc.nextLine();
            items = line.split(" ");
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX