Submission #1790855


Source Code Expand

import java.util.*;
import java.io.*;

public class Main {
    private static IO io = new IO();
    
    public static void main(String[] args) {
        int imo[] = new int[1000010];
        int n = io.nextInt();
        for (int i = 0; i < n; i++) {
            int a = io.nextInt();
            int b = io.nextInt();
            imo[a]++;
            imo[b+1]--;
        }        int ans = 0;
        for (int i = 0; i < 1000005; i++) {
            imo[i+1] += imo[i];
            ans = Math.max(ans, imo[i+1]);
        }

        System.out.println(ans);
    }

    static class IO extends PrintWriter {
        private final InputStream in;
        private final byte[] buffer = new byte[1024];
        private int ptr = 0;
        private int buflen = 0;

        IO() {
            this(System.in);
        }

        IO(InputStream source) {
            super(System.out);
            this.in = source;
        }

        boolean hasNextByte() {
            if (ptr < buflen) return true;
            else {
                ptr = 0;
                try {
                    buflen = in.read(buffer);
                } catch (IOException e) {
                    e.printStackTrace();
                }
                if (buflen <= 0) return false;
            }
            return true;
        }
        int readByte() {
            if (hasNextByte()) return buffer[ptr++];
            else return -1;
        }
        boolean isPrintableChar(int c) {return 33<=c &&c <=126;}
        void skipUnprintable() {while(hasNextByte() && !isPrintableChar(buffer[ptr]))ptr++;}
        boolean hasNext() {
            skipUnprintable();
            return hasNextByte();
        }

        long nextLong() {
            if (!hasNext()) throw new NoSuchElementException();
            long n = 0;
            boolean minus = false;
            int b = readByte();
            if (b == '-') {
                minus = true;
                b = readByte();
            }
            if (b < '0' || '9' < b) throw new NumberFormatException();
            while (true) {
                if ('0' <= b && b <= '9') {
                    n *= 10;
                    n += b - '0';
                } else if (b == -1 || !isPrintableChar(b)) return minus ? -n : n;
                else throw new NumberFormatException();
                b = readByte();
            }
        }

        int nextInt() {
            long nl = nextLong();
            if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
            return (int) nl;
        }

        public void close() {
            super.close();
            try {
                in.close();
            } catch (IOException ignored) {
            }
        }
    }
}

Submission Info

Submission Time
Task C - AtColor
User creep04
Language Java8 (OpenJDK 1.8.0)
Score 0
Code Size 2844 Byte
Status WA
Exec Time 132 ms
Memory 28552 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 30 0 / 70
Status
AC × 2
AC × 16
WA × 1
AC × 41
WA × 1
Set Name Test Cases
Sample subtask0_sample01.txt, subtask0_sample02.txt
Subtask1 subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask0_sample01.txt, subtask0_sample02.txt
Subtask2 subtask0_sample01.txt, subtask0_sample02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt
Case Name Status Exec Time Memory
subtask0_sample01.txt AC 79 ms 21972 KB
subtask0_sample02.txt AC 79 ms 25300 KB
subtask1_01.txt AC 80 ms 23636 KB
subtask1_02.txt WA 80 ms 25428 KB
subtask1_03.txt AC 90 ms 25284 KB
subtask1_04.txt AC 92 ms 23728 KB
subtask1_05.txt AC 84 ms 22228 KB
subtask1_06.txt AC 92 ms 21040 KB
subtask1_07.txt AC 83 ms 23764 KB
subtask1_08.txt AC 90 ms 24260 KB
subtask1_09.txt AC 102 ms 26536 KB
subtask1_10.txt AC 92 ms 23984 KB
subtask1_11.txt AC 89 ms 24624 KB
subtask1_12.txt AC 91 ms 24624 KB
subtask1_13.txt AC 92 ms 24624 KB
subtask1_14.txt AC 91 ms 23984 KB
subtask1_15.txt AC 89 ms 24236 KB
subtask2_01.txt AC 105 ms 23712 KB
subtask2_02.txt AC 107 ms 22624 KB
subtask2_03.txt AC 105 ms 28552 KB
subtask2_04.txt AC 107 ms 24644 KB
subtask2_05.txt AC 106 ms 24736 KB
subtask2_06.txt AC 106 ms 24736 KB
subtask2_07.txt AC 106 ms 23496 KB
subtask2_08.txt AC 107 ms 24592 KB
subtask2_09.txt AC 111 ms 23536 KB
subtask2_10.txt AC 107 ms 26512 KB
subtask2_11.txt AC 129 ms 24660 KB
subtask2_12.txt AC 107 ms 26576 KB
subtask2_13.txt AC 132 ms 26668 KB
subtask2_14.txt AC 106 ms 24736 KB
subtask2_15.txt AC 111 ms 23420 KB
subtask2_16.txt AC 110 ms 24912 KB
subtask2_17.txt AC 109 ms 23912 KB
subtask2_18.txt AC 110 ms 24400 KB
subtask2_19.txt AC 109 ms 25924 KB
subtask2_20.txt AC 110 ms 24688 KB
subtask2_21.txt AC 107 ms 22936 KB
subtask2_22.txt AC 112 ms 23576 KB
subtask2_23.txt AC 117 ms 26868 KB
subtask2_24.txt AC 109 ms 23380 KB
subtask2_25.txt AC 110 ms 24708 KB