Submission #71519022

---

Source Code Expand

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.NoSuchElementException;
import java.util.TreeSet;

class Main {
    static TreeSet<Pair> set = new TreeSet<>();
    static int answer;
    public static void main(String[] args) {
        PrintWriter out = new PrintWriter(System.out);
        FastScanner sc = new FastScanner();

        int N = sc.nextInt();
        answer = N;
        int Q = sc.nextInt();
        set.add(new Pair(-100,-100));
        set.add(new Pair(2000000000,2000000000));

        for (int i = 0; i < Q; i++) {
            int L = sc.nextInt();
            int R = sc.nextInt();

            // System.out.println(L);

            addPair(L,R);

            System.out.println(answer);
        }

        out.flush();
    }

    private static void addPair(int L,int R){
        Pair pair = set.lower(new Pair(L+1,R));
        // System.out.println(L + " " + R + " " + pair.l + " " + pair.r);
        if (L - 1 <= pair.r){
            // System.out.println(1007);
            set.remove(pair);
            answer += (pair.r - pair.l + 1);
            addPair(Math.min(L,pair.l) , Math.max(R,pair.r));

            // answer -= (Math.max(R,pair.r) - Math.min(L,pair.l) + 1) - (pair.r - pair.l + 1);
        }else {
            set.add(new Pair(L,R));
            answer -= (R - L + 1);
        }

        Pair pair1 = set.lower(new Pair(R + 2,R+2));
        // System.out.println(1009 + " " + L + " " + R + " " + pair1.l + " " + pair1.r);
        if (L == pair1.l && R == pair1.r){
            return;
        }
        if (R >= pair1.l - 1){
            // System.out.println(998);
            set.remove(pair1);
            answer += (pair1.r - pair1.l + 1);
            addPair(Math.min(L,pair1.l) , Math.max(R,pair1.r));

            // answer -= (Math.max(R,pair1.r) - Math.min(L,pair1.l) + 1) - (pair1.r - pair1.l + 1);
        }else {
            set.add(new Pair(L,R));
            answer -= (R - L + 1);
        }
    }

    private static class Pair implements Comparable<Pair>{
        int l,r;
        public Pair(int L,int R){
            l = L;
            r = R;
        }

        @Override
        public int compareTo(Pair o) {
            return Integer.compare(l,o.l);
        }
    }

    private static class FastScanner {
        private final InputStream in = System.in;
        private final byte[] buffer = new byte[1024];
        private int ptr = 0;
        private int buflen = 0;

        private boolean hasNextByte() {
            if (ptr < buflen) {
                return true;
            } else {
                ptr = 0;
                try {
                    buflen = in.read(buffer);
                } catch (IOException e) {
                    e.printStackTrace();
                }
                return buflen > 0;
            }
        }

        private int readByte() {
            if (hasNextByte()) return buffer[ptr++];
            else return -1;
        }

        private static boolean isPrintableChar(int c) {
            return 33 <= c && c <= 126;
        }

        public boolean hasNext() {
            while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
            return !hasNextByte();
        }

        public String next() {
            if (hasNext()) throw new NoSuchElementException();
            StringBuilder sb = new StringBuilder();
            int b = readByte();
            while (isPrintableChar(b)) {
                sb.appendCodePoint(b);
                b = readByte();
            }
            return sb.toString();
        }

        public 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();
            }
        }

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

        public double nextDouble() {
            return Double.parseDouble(next());
        }
    }
}

Submission Info

Judge Result