Skip to content

提出 #115

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
KanaiTaichi wants to merge 1 commit into
base: main
Choose a base branch
from
Open

提出 #115

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
24 changes: 23 additions & 1 deletion src/apple.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,12 +6,34 @@ int A[100000];


int main(){
int i, lb, ub;
int i, max;
scanf("%d%d", &n, &k);
for(i = 0; i < n; i++){
scanf("%d", &A[i]);

}
for(i = 0; i < n; i++){
if(A[i] > max) max = A[i];
}

int lb = 0;
int ub = max;
while (ub - lb > 1){
int mid = (lb + ub ) / 2;
int bag=0;
for(i = 0;i < n; i++){
int j = 1;
while(j*mid < A[i]){
j++;
}
bag += j;
}

if (k >= bag) ub = mid ;
else lb = mid ;
}

printf("%d", ub);

return 0;
}
11 changes: 9 additions & 2 deletions src/array.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,12 +6,19 @@ int A[100000];


int main(){
int i, lb, ub;
int i;
scanf("%d%d", &n, &k);
for(i = 0; i < n; i++){
scanf("%d", &A[i]);
}

int lb = -1;
int ub = n;
while (ub - lb > 1){
int mid = (lb + ub ) / 2;
if (A[ mid ] >= k) ub = mid ;
else lb = mid ;
}
printf("%d",ub);


return 0;
Expand Down
19 changes: 16 additions & 3 deletions src/spear.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,12 +6,25 @@ int A[100000];


int main(){
int i, lb, ub;
int i,max=0;
scanf("%d%d", &n, &k);
for(i = 0; i < n; i++){
scanf("%d", &A[i]);
}


for(i = 0; i < n; i++){
if(A[i] > max) max = A[i];
}
int lb = 0;
int ub = max;
Copy link
Copy Markdown

@nanashima nanashima Jul 2, 2022

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

初期値が不適切です．

while (ub - lb > 1){
int mid = (lb + ub ) / 2;
int s = 0;
for(i = 0; i < n; i++){
s += A[i] / mid;
}
if (s < k) ub = mid ;
else lb = mid ;
}
printf("%d", lb);
return 0;
}
28 changes: 26 additions & 2 deletions src/works.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,14 +4,38 @@ int n;
int k;
int A[100000];

int work(int timelimits, int people){
int workingtime = 0;
int humans = 1;
for(int i = 0; i < n; i++){
if(A[i] > timelimits)return 0;


workingtime += A[i];

if(workingtime > timelimits){
humans += 1;
workingtime = A[i];
}
}
if(people >= humans) return 1;
else return 0;
}

int main(){
int i, lb, ub;
int i;
scanf("%d%d", &n, &k);
for(i = 0; i < n; i++){
scanf("%d", &A[i]);
}
int lb = 0;
int ub = 1000000000;
while (ub - lb > 1){
int mid = (lb + ub ) / 2;


if (work(mid,k)) ub = mid ;
else lb = mid ;
}
printf("%d", ub);
return 0;
}