Submission #43602617

Source Code Expand

import std;

void main () {
    int N = readln.chomp.to!int;
    char[][] S = new char[][](N, 0);
    foreach (i; 0..N) {
        S[i] = readln.chomp.dup;
    }

    solve(N, S);
}

void solve (int N, char[][] S) {
    int[string] Map;
    foreach (s; S) {
        Map[cast(string) s.dup]++;
    }

    foreach (s; S) {
        if (s == s.dup.reverse) {
            continue;
        }
        if (s.dup.reverse in Map) {
            Map.remove(cast(string) s);
        }
    }

    writeln(Map.length);
}

Submission Info

Submission Time
Task C - Reversible
User InTheBloom
Language D (DMD 2.091.0)
Score 300
Code Size 535 Byte
Status AC
Exec Time 110 ms
Memory 15052 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 1
AC × 23
Set Name Test Cases
Sample example0.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, example0.txt
Case Name Status Exec Time Memory
000.txt AC 11 ms 4584 KiB
001.txt AC 7 ms 4324 KiB
002.txt AC 109 ms 14972 KiB
003.txt AC 110 ms 15052 KiB
004.txt AC 63 ms 12940 KiB
005.txt AC 57 ms 12476 KiB
006.txt AC 8 ms 4660 KiB
007.txt AC 9 ms 4540 KiB
008.txt AC 9 ms 4612 KiB
009.txt AC 77 ms 12764 KiB
010.txt AC 37 ms 6252 KiB
011.txt AC 37 ms 6560 KiB
012.txt AC 43 ms 6776 KiB
013.txt AC 77 ms 12528 KiB
014.txt AC 15 ms 4676 KiB
015.txt AC 16 ms 4672 KiB
016.txt AC 12 ms 4668 KiB
017.txt AC 8 ms 4676 KiB
018.txt AC 12 ms 4548 KiB
019.txt AC 9 ms 4696 KiB
020.txt AC 7 ms 4920 KiB
021.txt AC 7 ms 4796 KiB
example0.txt AC 2 ms 3560 KiB