Submission #1177916
Source Code Expand
import java.io.*; import java.util.*; import java.util.Map.*; public class Main { private static Scanner sc; private static Printer pr; private static void solve() { int n = sc.nextInt(); int m = sc.nextInt(); int[] x = new int[n]; Map<Integer, Map<Integer, Integer>> hm = new TreeMap<>(); for (int i = 0; i < n; i++) { x[i] = sc.nextInt(); int mod = x[i] % m; if (!hm.containsKey(mod)) { hm.put(mod, new TreeMap<>()); } Map<Integer, Integer> hmtmp = hm.get(mod); if (!hmtmp.containsKey(x[i])) { hmtmp.put(x[i], 0); } hmtmp.put(x[i], hmtmp.get(x[i]) + 1); } int ret = 0; int ret2 = 0; for (Entry<Integer, Map<Integer, Integer>> e : hm.entrySet()) { int mod = e.getKey(); int mod2 = (m - mod) % m; Map<Integer, Integer> hmtmp = e.getValue(); if (mod == mod2) { int tmp = 0; for (int ee : hmtmp.values()) { tmp += ee; } ret += tmp / 2; // } else if (mod < mod2) { } else { if (!hm.containsKey(mod2)) { continue; } Map<Integer, Integer> hmtmp2 = hm.get(mod2); int ecnt = 0; int ocnt = 0; for (int ee : hmtmp.values()) { ecnt += ee; if (ee % 2 == 1) { ocnt++; ecnt--; } } int ecnt2 = 0; int ocnt2 = 0; for (int ee : hmtmp2.values()) { ecnt2 += ee; if (ee % 2 == 1) { ocnt2++; ecnt2--; } } if (ecnt + ocnt >= ecnt2 + ocnt2) { ret2 += ecnt2 + ocnt2; int tmp = Math.min(ocnt, ecnt2 + ocnt2); ocnt -= tmp; ecnt -= ecnt2 + ocnt2 - tmp; ret2 += ecnt / 2; } else { ret2 += ecnt + ocnt; int tmp = Math.min(ocnt2, ecnt + ocnt); ocnt2 -= tmp; ecnt2 -= ecnt + ocnt - tmp; ret2 += ecnt2 / 2; } // } else { // break; } } pr.println(ret + ret2 / 2); } // --------------------------------------------------- public static void main(String[] args) { sc = new Scanner(System.in); pr = new Printer(System.out); solve(); pr.close(); sc.close(); } @SuppressWarnings("unused") private static class Scanner { BufferedReader br; Scanner (InputStream in) { br = new BufferedReader(new InputStreamReader(in)); } private boolean isPrintable(int ch) { return ch >= '!' && ch <= '~'; } private boolean isCRLF(int ch) { return ch == '\n' || ch == '\r' || ch == -1; } private int nextPrintable() { try { int ch; while (!isPrintable(ch = br.read())) { if (ch == -1) { throw new NoSuchElementException(); } } return ch; } catch (IOException e) { throw new NoSuchElementException(); } } String next() { try { int ch = nextPrintable(); StringBuilder sb = new StringBuilder(); do { sb.appendCodePoint(ch); } while (isPrintable(ch = br.read())); return sb.toString(); } catch (IOException e) { throw new NoSuchElementException(); } } int nextInt() { try { // parseInt from Integer.parseInt() boolean negative = false; int res = 0; int limit = -Integer.MAX_VALUE; int radix = 10; int fc = nextPrintable(); if (fc < '0') { if (fc == '-') { negative = true; limit = Integer.MIN_VALUE; } else if (fc != '+') { throw new NumberFormatException(); } fc = br.read(); } int multmin = limit / radix; int ch = fc; do { int digit = ch - '0'; if (digit < 0 || digit >= radix) { throw new NumberFormatException(); } if (res < multmin) { throw new NumberFormatException(); } res *= radix; if (res < limit + digit) { throw new NumberFormatException(); } res -= digit; } while (isPrintable(ch = br.read())); return negative ? res : -res; } catch (IOException e) { throw new NoSuchElementException(); } } long nextLong() { try { // parseLong from Long.parseLong() boolean negative = false; long res = 0; long limit = -Long.MAX_VALUE; int radix = 10; int fc = nextPrintable(); if (fc < '0') { if (fc == '-') { negative = true; limit = Long.MIN_VALUE; } else if (fc != '+') { throw new NumberFormatException(); } fc = br.read(); } long multmin = limit / radix; int ch = fc; do { int digit = ch - '0'; if (digit < 0 || digit >= radix) { throw new NumberFormatException(); } if (res < multmin) { throw new NumberFormatException(); } res *= radix; if (res < limit + digit) { throw new NumberFormatException(); } res -= digit; } while (isPrintable(ch = br.read())); return negative ? res : -res; } catch (IOException e) { throw new NoSuchElementException(); } } float nextFloat() { return Float.parseFloat(next()); } double nextDouble() { return Double.parseDouble(next()); } String nextLine() { try { int ch; while (isCRLF(ch = br.read())) { if (ch == -1) { throw new NoSuchElementException(); } } StringBuilder sb = new StringBuilder(); do { sb.appendCodePoint(ch); } while (!isCRLF(ch = br.read())); return sb.toString(); } catch (IOException e) { throw new NoSuchElementException(); } } void close() { try { br.close(); } catch (IOException e) { // throw new NoSuchElementException(); } } } private static class Printer extends PrintWriter { Printer(PrintStream out) { super(out); } } }
Submission Info
Submission Time | |
---|---|
Task | D - Pair Cards |
User | garnacha |
Language | Java8 (OpenJDK 1.8.0) |
Score | 0 |
Code Size | 5803 Byte |
Status | WA |
Exec Time | 372 ms |
Memory | 61728 KB |
Judge Result
Set Name | sample | all | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 700 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
sample | sample-01.txt, sample-02.txt |
all | sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt, sample-01.txt, sample-02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 80 ms | 18772 KB |
01-02.txt | AC | 249 ms | 30268 KB |
01-03.txt | AC | 251 ms | 31300 KB |
01-04.txt | AC | 237 ms | 32364 KB |
01-05.txt | AC | 259 ms | 32080 KB |
01-06.txt | AC | 248 ms | 34256 KB |
01-07.txt | AC | 253 ms | 31604 KB |
01-08.txt | AC | 249 ms | 31784 KB |
01-09.txt | AC | 250 ms | 37504 KB |
01-10.txt | WA | 296 ms | 48460 KB |
01-11.txt | WA | 313 ms | 50320 KB |
01-12.txt | WA | 164 ms | 30220 KB |
01-13.txt | WA | 163 ms | 33380 KB |
01-14.txt | AC | 268 ms | 32620 KB |
01-15.txt | AC | 268 ms | 32940 KB |
01-16.txt | AC | 293 ms | 32180 KB |
01-17.txt | AC | 285 ms | 36612 KB |
01-18.txt | AC | 277 ms | 38164 KB |
01-19.txt | AC | 286 ms | 48356 KB |
01-20.txt | AC | 372 ms | 61728 KB |
01-21.txt | AC | 210 ms | 27992 KB |
01-22.txt | AC | 199 ms | 30352 KB |
01-23.txt | AC | 208 ms | 30488 KB |
01-24.txt | WA | 212 ms | 31044 KB |
01-25.txt | WA | 203 ms | 30748 KB |
01-26.txt | WA | 219 ms | 31880 KB |
01-27.txt | AC | 211 ms | 36344 KB |
01-28.txt | WA | 107 ms | 21460 KB |
01-29.txt | AC | 83 ms | 20564 KB |
01-30.txt | AC | 74 ms | 19284 KB |
sample-01.txt | AC | 73 ms | 21460 KB |
sample-02.txt | AC | 75 ms | 21076 KB |