Skip to content

提出 #133

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
gotoryoto wants to merge 4 commits into
base: main
Choose a base branch
from
Open

提出 #133

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
00792bb
revised
gotoryoto Jun 27, 2022
357b078
revised
gotoryoto Jun 27, 2022
0051b5a
revised
gotoryoto Jun 27, 2022
1a2ee14
revised
gotoryoto Jun 27, 2022
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
22 changes: 20 additions & 2 deletions src/apple.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,14 +4,32 @@ int n;
int k;
int A[100000];

int p(int x){
int bag = 0;
for(int i = 0; i < n; i++){
bag += (A[i] + x -1)/x;
}
return (long long int) bag <= k;
}


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


lb = 0;
ub = 100000 + 1;
Copy link

@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 = (ub + lb) / 2;
if(p(mid)){
ub = mid;
}
else{
lb = mid;
};
}
printf("%d\n",ub);
return 0;
}
11 changes: 8 additions & 3 deletions src/array.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -11,8 +11,13 @@ int main(){
for(i = 0; i < n; i++){
scanf("%d", &A[i]);
}



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

int p(int x){
int spear = 0;
for(int i = 0; i < n; i++){
spear += A[i]/x;
}
return (long long int) spear >= k;
}

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


lb = 0;
ub = 1000000000 + 1;
while(ub - lb > 1){
int mid = (ub + lb) / 2;
if(p(mid)){
lb = mid;
} /* lbはp(lb)が成り立つことがわかっている最大の数*/
else{
ub = mid;
};/* ubはp(ub)が成り立たないことがわかっている最小の数*/
}
printf("%d\n",lb);
return 0;
}
2 changes: 1 addition & 1 deletion src/works.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,7 +4,7 @@ int n;
int k;
int A[100000];


/*わかりませんでした。*/
int main(){
int i, lb, ub;
scanf("%d%d", &n, &k);
Expand Down