Submission #3434135


Source Code Expand

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.List;
import java.util.StringTokenizer;

public class Main {

	public static void main(String[] args) throws IOException {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskX solver = new TaskX();
		solver.solve(1, in, out);
		out.close();
	}

	static int INF = 1 << 30;
	static long LINF = 1L << 55;
	static int MOD = 1000000007;
	static int[] mh4 = { 0, -1, 1, 0 };
	static int[] mw4 = { -1, 0, 0, 1 };
	static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };
	static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };

	static class TaskX {

		int l = 1 << 19;
		public void solve(int testNumber, InputReader in, PrintWriter out) {

			int n = in.nextInt(), m = in.nextInt();
			int[] seg = new int[l];
			int[] acc = new int[l];

			int[] a = new int[m], b = new int[m];
			for (int i = 0; i < m; i++) {
				a[i] = in.nextInt();
				b[i] = in.nextInt();
			}

			for (int i = 0; i < m; i++) {
				seg[a[i]]++;
				seg[b[i]+1]--;
			}
			Arrays.parallelPrefix(seg, Math::addExact);

			for (int i = 0; i < l; i++) {
				if (seg[i] <= 1) acc[i] = 1;
			}
			Arrays.parallelPrefix(acc, Math::addExact);

			List<Integer> list = new ArrayList<>();
			for (int i = 0; i < m; i++) {
				if (acc[b[i]] - acc[a[i]-1] == 0) {
					list.add(i+1);
				}
			}

			out.println(list.size());
			for (int i : list) {
				out.println(i);
			}

		}
	}

	static class InputReader {
		BufferedReader in;
		StringTokenizer tok;

		public String nextString() {
			while (!tok.hasMoreTokens()) {
				try {
					tok = new StringTokenizer(in.readLine(), " ");
				} catch (IOException e) {
					throw new InputMismatchException();
				}
			}
			return tok.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(nextString());
		}

		public long nextLong() {
			return Long.parseLong(nextString());
		}

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

		public int[] nextIntArray(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt();
			}
			return res;
		}

		public int[] nextIntArrayDec(int n) {
			int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt() - 1;
			}
			return res;
		}

		public int[] nextIntArray1Index(int n) {
			int[] res = new int[n + 1];
			for (int i = 0; i < n; i++) {
				res[i + 1] = nextInt();
			}
			return res;
		}

		public long[] nextLongArray(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong();
			}
			return res;
		}

		public long[] nextLongArrayDec(int n) {
			long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong() - 1;
			}
			return res;
		}

		public long[] nextLongArray1Index(int n) {
			long[] res = new long[n + 1];
			for (int i = 0; i < n; i++) {
				res[i + 1] = nextLong();
			}
			return res;
		}

		public double[] nextDoubleArray(int n) {
			double[] res = new double[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextDouble();
			}
			return res;
		}

		public InputReader(InputStream inputStream) {
			in = new BufferedReader(new InputStreamReader(inputStream));
			tok = new StringTokenizer("");
		}
	}

}

Submission Info

Submission Time
Task B - ドキドキデート大作戦高橋君
User tutuz
Language Java8 (OpenJDK 1.8.0)
Score 100
Code Size 3703 Byte
Status AC
Exec Time 463 ms
Memory 51200 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 3
AC × 12
AC × 20
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.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, subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt
All subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.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, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 305 ms 33720 KB
subtask0_sample_02.txt AC 222 ms 32724 KB
subtask0_sample_03.txt AC 234 ms 32432 KB
subtask1_01.txt AC 370 ms 50180 KB
subtask1_02.txt AC 461 ms 50072 KB
subtask1_03.txt AC 396 ms 47084 KB
subtask1_04.txt AC 419 ms 48292 KB
subtask1_05.txt AC 428 ms 47836 KB
subtask1_06.txt AC 246 ms 34636 KB
subtask1_07.txt AC 251 ms 31284 KB
subtask1_08.txt AC 219 ms 32020 KB
subtask1_09.txt AC 218 ms 32100 KB
subtask2_01.txt AC 458 ms 51164 KB
subtask2_02.txt AC 450 ms 51188 KB
subtask2_03.txt AC 240 ms 30568 KB
subtask2_04.txt AC 259 ms 31508 KB
subtask2_05.txt AC 256 ms 33300 KB
subtask2_06.txt AC 249 ms 32256 KB
subtask2_07.txt AC 244 ms 32444 KB
subtask2_08.txt AC 463 ms 51200 KB