1141E - Superhero Battle - CodeForces Solution


math *1700

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
#define MOD 1000000007
#define MAX 200000
using namespace std;
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	long long h;
	int n;
	cin>>h>>n;
	vector<int> v(n);
	for(int &x:v)cin>>x;
	long long rem = 0;
	for(int i=0;i<n;++i)
	{
		rem += v[i];
		if(h+rem<=0)
		{
			cout<<i+1<<endl;
			return 0;
		}
	}
	if(rem<0)
	{
		long long ans = n*h, sm = 0;
		rem *= -1;
		for(int i=0;i<n;++i)
			sm += v[i], ans = min(ans,i+1+(h+sm+rem-1)/rem*n);
		cout<<ans<<endl;
	}
	else cout<<"-1"<<endl;
	return 0;
}


Comments

Submit
0 Comments
More Questions

1620B - Triangles on a Rectangle
999C - Alphabetic Removals
1634C - OKEA
1368C - Even Picture
1505F - Math
1473A - Replacing Elements
959A - Mahmoud and Ehab and the even-odd game
78B - Easter Eggs
1455B - Jumps
1225C - p-binary
1525D - Armchairs
1257A - Two Rival Students
1415A - Prison Break
1271A - Suits
259B - Little Elephant and Magic Square
1389A - LCM Problem
778A - String Game
1382A - Common Subsequence
1512D - Corrupted Array
667B - Coat of Anticubism
284B - Cows and Poker Game
1666D - Deletive Editing
1433D - Districts Connection
2B - The least round way
1324A - Yet Another Tetris Problem
246B - Increase and Decrease
22E - Scheme
1566A - Median Maximization
1278A - Shuffle Hashing
1666F - Fancy Stack