forked from keshavnandan/Topcoder
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathHeatDeath.cpp
73 lines (66 loc) · 2.75 KB
/
HeatDeath.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
#include <iostream>
#include <sstream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <cstring>
#include <climits>
#include <cstdio>
using namespace std;
typedef pair<int,int> pi;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
class HeatDeath{
public:
int maxTime(vi e){
int n = e.size();
int t = 0;
while(true){
sort(e.begin(), e.end());
bool done = false;
for(int i = 0; i+1 < n; i++)
if(e[i+1]-e[i] >= 2){
int m1 = (e[i+1]+e[i])/2, m2 = (e[i+1]+e[i]+1)/2;
t += (m1-e[i]);
e[i] = m1;
e[i+1] = m2;
done = true;
i = n;
}
if(done) continue;
int j = 1;
while(j < n && e[j] <= e[0]+1) j++;
if(j < n){
e[0]++;
e[j]--;
t++;
}
else break;
}
return t;
}
// BEGIN CUT HERE
public:
void run_test(int Case) { if ((Case == -1) || (Case == 0)) test_case_0(); if ((Case == -1) || (Case == 1)) test_case_1(); if ((Case == -1) || (Case == 2)) test_case_2(); if ((Case == -1) || (Case == 3)) test_case_3(); }
private:
template <typename T> string print_array(const vector<T> &V) { ostringstream os; os << "{ "; for (typename vector<T>::const_iterator iter = V.begin(); iter != V.end(); ++iter) os << '\"' << *iter << "\","; os << " }"; return os.str(); }
void verify_case(int Case, const int &Expected, const int &Received) { cerr << "Test Case #" << Case << "..."; if (Expected == Received) cerr << "PASSED" << endl; else { cerr << "FAILED" << endl; cerr << "\tExpected: \"" << Expected << '\"' << endl; cerr << "\tReceived: \"" << Received << '\"' << endl; } }
void test_case_0() { int Arr0[] = { 5, 7, 9 }; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 3; verify_case(0, Arg1, maxTime(Arg0)); }
void test_case_1() { int Arr0[] = { 5, 6, 5, 6 }; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 0; verify_case(1, Arg1, maxTime(Arg0)); }
void test_case_2() { int Arr0[] = { 1, 1, 1, 1, 1, 999, 999, 999, 999, 999 }; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 12435; verify_case(2, Arg1, maxTime(Arg0)); }
void test_case_3() { int Arr0[] = { 354, 903, 100, 951, 669, 311, 339, 500, 942, 72, 712, 54, 64,
572, 7, 977, 74, 524, 314, 160, 526, 729, 114, 691, 771, 704,
288, 47, 735, 85, 694, 124, 349, 905, 611, 371, 885, 738, 165,
442, 138, 348, 605, 239, 535, 33, 142, 946, 4, 231 }
; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 214090; verify_case(3, Arg1, maxTime(Arg0)); }
// END CUT HERE
};
// BEGIN CUT HERE
int main(){
HeatDeath ___test;
___test.run_test(-1);
}
// END CUT HERE