UVa Problem Solution: 10132 - File Fragmentation

I solve this problem in a manner that seems not straight forward. I let the fragments to "vote" on each bit if it is '0' or '1'. Specifically, for each fragment, it is either the head or tail of the file. We let it to vote as both. Thus, for each bit, there are exactly as many votes as the number of fragments, which is twice the number of files. Within these votes, we know that there are at least the number of files votes that are correct, since for each fragment, it has voted once as the correct part. Therefore, the number of correct votes is greater than or equal to the number of wrong votes. With the vote results in hand, we can reproduce the content of the original file easily.

Code:

1. /*************************************************************************
2.  * Copyright (C) 2008 by liukaipeng                                      *
3.  * liukaipeng at gmail dot com                                           *
4.  *************************************************************************/
6. /* @JUDGE_ID 00000 10132 C++ "File Fragmentation" */
8. #include <iostream>
9. #include <fstream>
10. #include <string>
11. #include <vector>
13. using namespace std;
14.      
15. int const filecount = 150;
16. int const filesize = 300;
18. void recover_file(char fragments[][filesize], int nfragments, char file[])
19. {
20.   int votes[filesize][2] = {{0}};
21.   int lens[filecount*2] = {0};
22.   int len = 0;
23.   for (int i = 0; i < nfragments; ++i) {
24.     for (int j = 0; fragments[i][j] != '/0'; ++j) {
25.       ++votes[j][fragments[i][j] - '0'];
26.       ++lens[i];
27.       ++len;
28.     }
29.   }
30.   len = len * 2 / nfragments;
31.   for (int i = 0; i < nfragments; ++i) {
32.     for (int j = 0; fragments[i][j] != '/0'; ++j) {
33.       ++votes[len-lens[i]+j][fragments[i][j] - '0'];
34.     }
35.   }
36.   for (int i = 0; i < len; ++i) {
37.     file[i] = votes[i][0] > votes[i][1] ? '0' : '1';
38.   }
39. }
40.           
41. int main(int argc, char *argv[])
42. {
43. #ifndef ONLINE_JUDGE
44.   filebuf in, out;
45.   cin.rdbuf(in.open((string(argv[0]) + ".in").c_str(), ios_base::in));
46.   cout.rdbuf(out.open((string(argv[0]) + ".out").c_str(), ios_base::out));
47. #endif
49.   int ncases;
50.   cin >> ncases;
51.   cin.ignore(2048, '/n').ignore(2048, '/n');
52.   while (ncases-- > 0) {
53.     char fragments[filecount*2][filesize] = {{0}};
54.     int nfragments = 0;
55.     while (cin.getline(fragments[nfragments], filesize) && 
56.            fragments[nfragments][0] != '/0') {
57.       ++nfragments;
58.     }
60.     char file[filesize] = {0};
61.     recover_file(fragments, nfragments, file);
63.     cout << file << '/n';
64.     if (ncases > 0) cout << '/n';
65.   }
67.   return 0;
68. }
69.