Submission #993017

---

Source Code Expand

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.NoSuchElementException;

public class Main {
	private static void solve() {
		int n = nei();
		int m = nei();
		ArrayList<Integer> xs = new ArrayList<Integer>();
		for (int i = 0; i < n; i++) {
			xs.add(nei());
		}
		Collections.sort(xs, (a, b) -> a % m - b % m);
		int[] ns = new int[m];
		int[] ss = new int[m];
		boolean skp = false;
		for (int i = 0; i < n; i++) {
			int x = xs.get(i);
			int g = x % m;
			ns[g]++;
			if (!skp) {
				if (i < n - 1 && x == xs.get(i + 1)) {
					ss[g]++;
					skp = true;
				}
			} else
				skp = false;
		}
		int ans = 0;
		ans += ns[0] >> 1;
		if (m % 2 == 0) {
			int mid = m / 2;
			ans += ns[mid] >> 1;
			for (int i = 1; i < mid; i++) {
				int j = m - i;
				int maxp = min(ns[i], ns[j]);
				ans += maxp;
				ns[i] -= maxp;
				ns[j] -= maxp;
				while (ns[i] >= 2 && ss[i] > 0) {
					ns[i] -= 2;
					ss[i]--;
					ans++;
				}
				while (ns[j] >= 2 && ss[j] > 0) {
					ns[j] -= 2;
					ss[j]--;
					ans++;
				}
			}
		} else {
			int mid = (m + 1) >> 1;
			for (int i = 1; i < mid; i++) {
				int j = m - i;
				int maxp = min(ns[i], ns[j]);
				ans += maxp;
				ns[i] -= maxp;
				ns[j] -= maxp;
				while (ns[i] >= 2 && ss[i] > 0) {
					ns[i] -= 2;
					ss[i]--;
					ans++;
				}
				while (ns[j] >= 2 && ss[j] > 0) {
					ns[j] -= 2;
					ss[j]--;
					ans++;
				}
			}
		}
		out(ans);
	}

	static int abs(int x) {
		return x < 0 ? -x : x;
	}

	static long abs(long x) {
		return x < 0 ? -x : x;
	}

	static int min(int a, int b) {
		return a < b ? a : b;
	}

	static long min(long a, long b) {
		return a < b ? a : b;
	}

	static int max(int a, int b) {
		return a > b ? a : b;
	}

	static long max(long a, long b) {
		return a > b ? a : b;
	}

	static int clamp(int a, int min, int max) {
		return a < min ? min : a > max ? max : a;
	}

	static long clamp(long a, long min, long max) {
		return a < min ? min : a > max ? max : a;
	}

	static void out(String val) {
		IO.out(val);
	}

	static void out(Object val) {
		IO.out(String.valueOf(val));
	}

	static void out(int val) {
		IO.out(String.valueOf(val));
	}

	static void out(long val) {
		IO.out(String.valueOf(val));
	}

	static void out(char val) {
		IO.out(String.valueOf(val));
	}

	static void out(float val) {
		IO.out(String.valueOf(val));
	}

	static void out(double val) {
		IO.out(String.valueOf(val));
	}

	static void out(boolean val) {
		IO.out(String.valueOf(val));
	}

	static String nes() {
		return IO.next();
	}

	static int nei() {
		return IO.nextInt();
	}

	static long nel() {
		return IO.nextLong();
	}

	static int parseInt(String val) {
		return Integer.parseInt(val);
	}

	static int parseInt(char val) {
		return Integer.parseInt(String.valueOf(val));
	}

	static long parseLong(String val) {
		return Long.parseLong(val);
	}

	public static void main(String[] args) {
		solve();
		IO.flush();
	}
}

final class IO {
	private static final InputStream in = System.in;
	private static final PrintWriter out = new PrintWriter(System.out, false);
	private static final byte[] buffer = new byte[1024];
	private static int ptr = 0;
	private static int len = 0;

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

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

	static boolean hasNext() {
		byte c;
		while (hasNextByte() && ((c = buffer[ptr]) < '!' || c > '~'))
			ptr++;
		return hasNextByte();
	}

	static String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while (b >= '!' && b <= '~') {
			sb.append((char) b);
			b = readByte();
		}
		return sb.toString();
	}

	static long nextLong() {
		if (!hasNext())
			throw new NoSuchElementException();
		long n = 0;
		int sign = 1;
		int b = readByte();
		if (b == '-') {
			sign = -1;
			b = readByte();
		}
		if (b < '0' || '9' < b)
			throw new NumberFormatException();
		while (true) {
			if ('0' <= b && b <= '9')
				n = n * 10 + b - '0';
			else if (b == -1 || b < '!' || b > '~')
				return n * sign;
			else
				throw new NumberFormatException();
			b = readByte();
		}
	}

	static int nextInt() {
		if (!hasNext())
			throw new NoSuchElementException();
		int n = 0;
		int sign = 1;
		int b = readByte();
		if (b == '-') {
			sign = -1;
			b = readByte();
		}
		if (b < '0' || '9' < b)
			throw new NumberFormatException();
		while (true) {
			if ('0' <= b && b <= '9')
				n = n * 10 + b - '0';
			else if (b == -1 || b < '!' || b > '~')
				return n * sign;
			else
				throw new NumberFormatException();
			b = readByte();
		}
	}

	static void out(String val) {
		out.println(val);
	}

	static void flush() {
		out.flush();
	}
}

Submission Info

Judge Result