제출 #1062950

#제출 시각아이디문제언어결과실행 시간메모리
1062950jundiSnail (NOI18_snail)C++17
0 / 100
2 ms348 KiB
#include <bits/stdc++.h> using namespace std; int main(){ double h; int n; cin>>h>>n; vector<double> a(n); double maxx=0; double one=0; for(int i=0;i<n;i++){ cin>>a[i]; maxx=max(maxx,a[i]); one+=a[i]; } int day=ceil((h-maxx)/one); h-=(one*day); int re=0; for(int i=0;i<n;i++){ re+=a[i]; if(re>=h){cout<<day<<" "<<i; return 0;} } cout<<-1<<" "<<-1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...