# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71733 | chobo (#119) | Angelic Hourglass (FXCUP3_hourglass) | C++98 | 4 ms | 620 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <queue>
#include <algorithm>
using namespace std;
int ans[5555];
queue<int> q;
int main(){
int n;
scanf("%d",&n);
for(int i=1;i<=5000;i++) ans[i]=1e9;
q.push(0);
while(!q.empty()){
int p=q.front(); q.pop();
if(p==n){
printf("%d",ans[p]);
return 0;
}
if(ans[p+3]>ans[p]+1) ans[p+3]=ans[p]+1,q.push(p+3);
if(ans[p+5]>ans[p]+1) ans[p+5]=ans[p]+1,q.push(p+5);
}
printf("-1");
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |