제출 #1090065

#제출 시각아이디문제언어결과실행 시간메모리
1090065dpsaveslivesSnail (NOI18_snail)C++17
37 / 100
2 ms692 KiB
#include <bits/stdc++.h> #define ll long long using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll H; int N; cin >> H >> N; vector<ll> phases(N); vector<ll> pref(N); for(int i = 0;i<N;++i){ cin >> phases[i]; if(i == 0) pref[i] = max(0ll,phases[i]); else pref[i] = max(0ll,phases[i]+pref[i-1]); } if(pref[N-1] == 0){ for(int i = 0;i<N;++i){ if(pref[i] >= H){ cout << 0 << " " << i << "\n"; return 0; } } cout << -1 << " " << -1 << "\n"; return 0; } ll ans = -1, p = -1; for(int i = 0;i<N;++i){ ll cur = H-pref[i]; if(cur <= 0){ if(ans == -1 || 0 < ans){ ans = 0; p = i; } continue; } ll d = cur/pref[N-1]; if(cur % pref[N-1] != 0){ ++d; } if(ans == -1 || d < ans){ ans = d; p = i; } } cout << ans << " " << p << "\n"; return 0; }
#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...