Skip to content

提出 #169

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

提出 #169

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
6 commits
Select commit Hold shift + click to select a range
df7a34d
revised
oikawashunya Jun 27, 2022
2ebc7cc
revised
oikawashunya Jun 27, 2022
c70f490
revised
oikawashunya Jun 27, 2022
6a1571b
revised
oikawashunya Jun 28, 2022
9402603
revised
oikawashunya Jun 28, 2022
c5a85f7
Delete apple.c
oikawashunya Jun 28, 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
17 changes: 0 additions & 17 deletions src/apple.c
View file
Open in desktop

This file was deleted.

15 changes: 12 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,17 @@ int main(){
for(i = 0; i < n; i++){
scanf("%d", &A[i]);
}



lb=-1;
ub=n;
while(ub-lb>1){
int mid =(lb +ub/2);
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.

正しくないです．

if(A[mid]>=k){
ub=mid;
}
else {
lb=mid;
}
}
printf("%d\n", ub);
return 0;
}
24 changes: 21 additions & 3 deletions src/spear.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 i,sum;
sum=0;
for (i=0;i<n;i++){
sum +=A[i]/x;
}
return sum >= 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;
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 =(lb +ub/2);
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.

ここもです．

if(p(mid)){
ub=mid;
}
else {
lb=mid;
}
}
printf("%d\n", ub);
return 0;
}
}
31 changes: 29 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,41 @@ int n;
int k;
int A[100000];

int p(int x){
int i,j,sum;
sum=0;
j=1;
for(i=0;i<n;i++){
if(A[i]>x)return 0;
if(j+A[i]<=x){
j+=A[i];
}
else{
j++;
sum=A[i];
}
}
return j<=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;
while(ub-lb>1){
int mid =(lb +ub/2);
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.

ここもです．

if(p(mid)){
ub=mid;
}
else {
lb=mid;
}
}
printf("%d\n", ub);
return 0;
}