forked from keshavnandan/Topcoder
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathWorldPeace.cpp
74 lines (68 loc) · 3.72 KB
/
WorldPeace.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
74
#include <iostream>
#include <sstream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <cstring>
#include <climits>
#include <cstdio>
#include <numeric>
using namespace std;
typedef pair<int,int> pi;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef vector<vs> vvs;
typedef long long ll;
class WorldPeace{
public:
bool valid(int k, vi c, ll lim){
ll s = 0;
for(int x : c)
if(x <= lim) s += x;
else s += lim;
if(s >= k*lim) return true;
return false;
}
ll numGroups(int k, vi c) {
ll sum = accumulate(c.begin(), c.end(), 0ll);
ll lim = sum/k;
if(valid(k, c, lim)) return lim;
ll low = 1, high = lim, mid = lim;
while(low <= high){
mid = (low+high)/2;
if(valid(k, c, mid)){
if(!valid(k, c, mid+1)) return mid;
low = mid+1;
}
else high = mid-1;
}
return mid;
}
// 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(); if ((Case == -1) || (Case == 4)) test_case_4(); }
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 long long &Expected, const long long &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 Arg0 = 4; int Arr1[] = { 4,4,4,4,4 }; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); long long Arg2 = 5LL; verify_case(0, Arg2, numGroups(Arg0, Arg1)); }
void test_case_1() { int Arg0 = 5; int Arr1[] = { 1,2,3,4,5,6 }; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); long long Arg2 = 3LL; verify_case(1, Arg2, numGroups(Arg0, Arg1)); }
void test_case_2() { int Arg0 = 2; int Arr1[] = { 1000000000, 1000000000, 1000000000, 1000000000, 1000000000, 1000000000 }; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); long long Arg2 = 3000000000LL; verify_case(2, Arg2, numGroups(Arg0, Arg1)); }
void test_case_3() { int Arg0 = 7; int Arr1[] = { 96, 17, 32, 138, 112, 50, 7, 19, 412, 23, 14, 50, 47, 343, 427, 22, 39 }; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); long long Arg2 = 166LL; verify_case(3, Arg2, numGroups(Arg0, Arg1)); }
void test_case_4() { int Arg0 = 10; int Arr1[] = { 638074479, 717901019, 910893151, 924124222, 991874870, 919392444, 729973192, 607898881,
838529741, 907090878, 632877562, 678638852, 749258866, 949661738, 784641190, 815740520,
689809286, 711327114, 658017649, 636727234, 871088534, 964608547, 867960437, 964911023,
642411618, 868318236, 793328473, 849540177, 960039699, 998262224, 775720601, 634685437,
743766982, 826321850, 846671921, 712570181, 676890302, 814283264, 958273130, 899003369,
909973864, 921987721, 978601888, 633027021, 896400011, 725078407, 662183572, 629843174,
617774786, 695823011 }; vector <int> Arg1(Arr1, Arr1 + (sizeof(Arr1) / sizeof(Arr1[0]))); long long Arg2 = 3983180234LL; verify_case(4, Arg2, numGroups(Arg0, Arg1)); }
// END CUT HERE
};
// BEGIN CUT HERE
int main(){
WorldPeace ___test;
___test.run_test(-1);
}
// END CUT HERE