제출 #528061

#제출 시각아이디문제언어결과실행 시간메모리
528061srivatsav_kannanSnail (NOI18_snail)C++14
0 / 100
1079 ms460 KiB
#include <iostream> #include <fstream> #include <vector> #include <set> #include <queue> #include <cmath> #include <map> #include <algorithm> #include <numeric> #include <stack> #include <cstring> #include <bitset> #include <climits> #include <valarray> #include <list> #define INF 1000000000 #define endl '\n' #define int long long using namespace std; signed main(){ ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int k,n; cin >> k >> n; int sum = 0; int ar[n]; for (int i = 0; i < n; i++){ cin >> ar[i]; sum += ar[i]; if (sum >= k) { cout << 0 << " " << i << endl; return 0; } } if (sum <= 0){ cout << "-1 -1\n"; return 0; } if(n == 1){ long double one = k, two = sum; cout << ceil(one/two)-1 << " " << 0 << endl; return 0; } int cur = 0; int day = -1, phase = 0; while (cur < k) { day++; for (int i = 0; i < n; i++){ phase = i; cur += ar[i]; if (cur >= k) break; } } cout << day << " " << phase << endl; }
#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...