Submission #1177416
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 HashMap<>(); for (int i = 0; i < n; i++) { x[i] = sc.nextInt(); int mod = x[i] % m; if (!hm.containsKey(mod)) { hm.put(mod, new HashMap<>()); } 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; 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) { Map<Integer, Integer> hmtmp2 = hm.get(mod2); int tmp = 0; int ecnt = 0; for (int ee : hmtmp.values()) { tmp += ee; if (ee % 2 == 1) { ecnt++; } } int tmp2 = 0; int ecnt2 = 0; for (int ee : hmtmp2.values()) { tmp2 += ee; if (ee % 2 == 1) { ecnt2++; } } if (ecnt >= ecnt2) { ret += ecnt2; tmp2 -= ecnt2; tmp -= ecnt2; ecnt -= ecnt2; ecnt2 = 0; int tmptmp = Math.min(ecnt, tmp2); ret += tmptmp; ecnt -= tmptmp; tmp -= tmptmp; tmp2 -= tmptmp; ret += tmp / 2 + tmp2 / 2; } else { ret += ecnt; tmp -= ecnt; tmp2 -= ecnt; ecnt2 -= ecnt; ecnt = 0; int tmptmp = Math.min(ecnt2, tmp); ret += tmptmp; ecnt2 -= tmptmp; tmp -= tmptmp; tmp2 -= tmptmp; ret += tmp / 2 + tmp2 / 2; } } else { break; } } pr.println(ret); } // --------------------------------------------------- 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 | 5860 Byte |
Status | RE |
Exec Time | 321 ms |
Memory | 66188 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 | 73 ms | 19924 KB |
01-02.txt | AC | 211 ms | 28680 KB |
01-03.txt | AC | 210 ms | 32520 KB |
01-04.txt | AC | 229 ms | 32536 KB |
01-05.txt | AC | 229 ms | 31716 KB |
01-06.txt | AC | 208 ms | 29024 KB |
01-07.txt | AC | 218 ms | 33832 KB |
01-08.txt | AC | 222 ms | 35004 KB |
01-09.txt | AC | 283 ms | 39028 KB |
01-10.txt | RE | 250 ms | 49448 KB |
01-11.txt | RE | 234 ms | 50972 KB |
01-12.txt | RE | 171 ms | 28520 KB |
01-13.txt | RE | 186 ms | 36072 KB |
01-14.txt | AC | 228 ms | 36524 KB |
01-15.txt | AC | 221 ms | 32644 KB |
01-16.txt | AC | 284 ms | 42312 KB |
01-17.txt | AC | 222 ms | 39008 KB |
01-18.txt | AC | 252 ms | 46960 KB |
01-19.txt | AC | 249 ms | 47200 KB |
01-20.txt | AC | 321 ms | 66188 KB |
01-21.txt | AC | 188 ms | 30576 KB |
01-22.txt | AC | 185 ms | 29984 KB |
01-23.txt | AC | 182 ms | 29712 KB |
01-24.txt | RE | 183 ms | 32664 KB |
01-25.txt | RE | 187 ms | 32612 KB |
01-26.txt | WA | 192 ms | 29192 KB |
01-27.txt | RE | 206 ms | 53092 KB |
01-28.txt | RE | 94 ms | 21844 KB |
01-29.txt | RE | 79 ms | 19408 KB |
01-30.txt | AC | 72 ms | 20308 KB |
sample-01.txt | AC | 71 ms | 18644 KB |
sample-02.txt | AC | 72 ms | 21460 KB |