-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathContest.cpp
More file actions
77 lines (56 loc) · 1.62 KB
/
Contest.cpp
File metadata and controls
77 lines (56 loc) · 1.62 KB
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
75
76
77
#include <bits/stdc++.h>
using namespace std;
bool isPossible(int n, vector<vector<int>> &arr, int B,int mid){
int tCount = 0 , fcount=1;
for(int i = 1;i<n;i++){
for(int j = 0;j<arr.size();j++){
if((tCount + arr[i][j])<=mid){
tCount+=arr[i][j];
}
else{
fcount++;
if(fcount>n || arr[i][j]>mid ){
return false;
}
}
tCount = arr[i][j];
}
}
// cout<<"The value of mid is :"<<mid<<endl;
// cout<<"The value of tCount is :"<<tCount<<endl;
return true;
}
int findMaxX(int n, vector<vector<int>> &arr, int B)
{
int s =0, sum=0;
for(int i =0;i<n;i++){
for(int j = 0;j<arr.size();j++){
sum+=arr[i][j];
}
}
int e = sum;
int mid = s + (e-s)/2;
int ans = 0;
while(s<=e){
if(isPossible(n,arr,B,mid)){
ans = mid;
// cout<<"The value of ans is :"<<ans<<endl;
e = mid - 1;
// cout<<"The value of e is "<<e<<endl;
}
else{
s = mid + 1;
// cout<<"The value of s is "<<s<<endl;
}
mid = s + (e-s)/2;
// cout<<"The value of mid is:"<<mid<<endl;
}
cout<<"The value of answer is : "<<ans;
return ans;
}
int main(){
vector < vector<int> > arr ={{3 ,1, 2, 3},
{3 ,4 ,2, 3},
{3 ,1, 10, 2}};
findMaxX(3,arr,20);
}