Sicily 2370. Just The Simple Fax

2370. Just The Simple Fax

Constraints

Time Limit: 1 secs, Memory Limit: 256 MB

Description

Fax machines use a form of compression based on run-length encoding. Run-length encoding (RLE) is a very simple form of data compression in which runs of data (that is, sequences in which the same data value occurs in many consecutive data elements) are stored as a single data value and count, rather than as the original run. This is most useful on data that contains many such runs: for example, relatively simple graphic images such as icons, text, and line drawings. It is not useful with files that don't have many runs as it could potentially double the file size (photograph, for example).

For this problem, you will write a program that encodes a block of data using a very simple RLE algorithm. A run is encoded using a two byte sequence. The first byte of the sequence contains the count, and the second contains the value to repeat. The count is encoded using an 8 bit value with the high order bit set to 1. The remaining 7 bits represent the count-3. This gives a maximum run count of 130 per 2 byte sequence. (This implies that the minimum run count is 3). Bytes that are not part of a run are encoded as-is with a prefix byte indicating the count of bytes in the non-run minus 1, 0 through 127, representing a range of 1 - 128 (the high order bit will always be 0 in the case of non-run data).

If a run contains more than 130 bytes, then it must be encoded using multiple sequences, the first of which will always be a run of 130. All runs of 3 or more must be encoded as a run. If a non-run contains more than 128 bytes, then multiple non-run sequences must be used. For example, a run of 262 would be encoded as two runs of 130 followed by a non-run of 2.

Input

The first line of input contains a single integer P, (1P1000), which is the number of data sets that follow. Each data set consists of multiple lines. The first line contains two (2) decimal integer values: the problem number, followed by a space, followed by the number of bytes B, (1B5000), to encode. The remaining line(s) contain(s) the data to be encoded. Each line of data to encode will contain 80 hexadecimal digits (except the last line, which may contain less). 2 hexadecimal digits are used to represent each byte. Hexadecimal digits are: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F.

Output

For each data set, there are multiple lines of output. The first line contains a decimal integer giving the data set number followed by a single space, followed by a decimal integer giving the total number of encoded bytes. The remaining lines contain the encoded data each with 80 hexadecimal digits, except the last, which may contain less.

Sample Input

4 1 1 07 2 5 F4A5A5A5A5 3 44 0000000000000000FFFFFF66665A5A5A5A5A71727374758008011011135555555555555501020399 777777CC 4 40 68686868686868686868686868686868686868686868686868686868686868686868686868686868

Sample Output

1 2 0007 2 4 00F481A5 3 32 850080FF016666825A0A717273747580080110111384550301020399807700CC 4 2 A568

Problem Source

每周一赛第一场

// Problem#: 2370// Submission#: 3375194// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/// All Copyright reserved by Informatic Lab of Sun Yat-sen University#include <stdio.h>#include <iostream>#include <vector>#include <string>#include <stack>#include <iomanip>#include <algorithm>#include <queue>#include <functional>#include <map>#include <string.h>#include <math.h>using namespace std;string text;string ans;char h[17] = "0123456789ABCDEF";string alone;int aloneNum;void checkAlone() {    if (alone != "") {        int shang = aloneNum / 128;        int yu = aloneNum % 128;        int k = 0;        while (shang--) {            ans += "7F";            for (int k = 0; k < 128 * 2; k++) {                ans.push_back(alone[k]);            }            alone = alone.substr(2 * 128, alone.size() - 2 * 128);        }        if (yu) {            yu--;            char c2 = h[yu % 16];            yu /= 16;            char c1 = h[yu % 16];            ans.push_back(c1);            ans.push_back(c2);            ans += alone;        }        aloneNum = 0;        alone = "";    }}int main() {    std::ios::sync_with_stdio(false);    int caseNum;    cin >> caseNum;    while (caseNum--) {        int counter, N;        cin >> counter >> N;        N *= 2;        for (int i = 0; i < N / 80 + (N % 80 ? 1 : 0); i++) {            string temp;            cin >> temp;            text += temp;        }        int s = text.size();        ans = "";        for (int i = 0; i < s; ) {            int j, num = 1;            for (j = i + 2; j < s && text[j] == text[j - 2] && text[j + 1] == text[j - 1]; j += 2) {                num++;            }            if (num == 1) {                aloneNum++;                alone += text.substr(i, 2);            } else if (num == 2) {                aloneNum += 2;                alone += text.substr(i, 2) + text.substr(i, 2);            } else {                checkAlone();                int shang = num / 130;                int yu = num % 130;                while (shang--) {                    ans += "FF" + text.substr(i, 2);                }                if (yu) {                    if (yu < 3) {                        aloneNum += yu;                        while (yu--) alone += text.substr(i, 2);                    } else {                        yu -= 3;                        char c2 = h[yu % 16];                        yu /= 16;                        yu += 8;                        char c1 = h[yu % 16];                        ans.push_back(c1);                        ans.push_back(c2);                        ans += text.substr(i, 2);                    }                }            }            i = j;        }        checkAlone();        cout << counter << " " << ans.size() / 2 << endl;        for (int i = 0, j = 0; i < ans.size(); i++) {            cout << ans[i];            j++;            if (j == 80) {                cout << endl;                j = 0;            }        }        if (ans.size() % 80) cout << endl;        text.clear();        ans.clear();    }    return 0;}