#include <iostream> #include <climits> using namespace std; const int SIZE = 1000000+5; int coins[SIZE], tab[SIZE], toAdd[SIZE]; long long gcd(long long a, long long b) { long long helper; while(b != 0) { helper = b; b = a%b; a = helper; } return a; } int main() { ios_base::sync_with_stdio(false); long long n, m; cin >> n; for(int i=0; i<n; ++i) { cin >> coins[i]; tab[i] = coins[i]; } cin >> m; char c; for(int i=0; i<m; ++i) { cin >> c; if(c == 'W') toAdd[i] = 1; else toAdd[i] = -1; } long long lcm = n*m/gcd(n, m); for(long long i=0; i<lcm; ++i) { tab[i%n] += toAdd[i%m]; if(tab[i%n] == 0) { cout << i+1 << endl; return 0; } } long long minVal = LONG_LONG_MAX, minInd = 0; long long toAddMin = LONG_LONG_MAX; for(int i=0; i<n; ++i) { if(tab[i] < coins[i] && minVal > tab[i]) { minVal = tab[i]; minInd = i; toAddMin = (toAddMin > tab[i]-coins[i]) ? tab[i]-coins[i] : toAddMin; } } if(toAddMin >= 0) { cout << -1 << endl; return 0; } cout << (coins[minInd] + tab[minInd])*n + minInd+1 << endl; return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 | #include <iostream> #include <climits> using namespace std; const int SIZE = 1000000+5; int coins[SIZE], tab[SIZE], toAdd[SIZE]; long long gcd(long long a, long long b) { long long helper; while(b != 0) { helper = b; b = a%b; a = helper; } return a; } int main() { ios_base::sync_with_stdio(false); long long n, m; cin >> n; for(int i=0; i<n; ++i) { cin >> coins[i]; tab[i] = coins[i]; } cin >> m; char c; for(int i=0; i<m; ++i) { cin >> c; if(c == 'W') toAdd[i] = 1; else toAdd[i] = -1; } long long lcm = n*m/gcd(n, m); for(long long i=0; i<lcm; ++i) { tab[i%n] += toAdd[i%m]; if(tab[i%n] == 0) { cout << i+1 << endl; return 0; } } long long minVal = LONG_LONG_MAX, minInd = 0; long long toAddMin = LONG_LONG_MAX; for(int i=0; i<n; ++i) { if(tab[i] < coins[i] && minVal > tab[i]) { minVal = tab[i]; minInd = i; toAddMin = (toAddMin > tab[i]-coins[i]) ? tab[i]-coins[i] : toAddMin; } } if(toAddMin >= 0) { cout << -1 << endl; return 0; } cout << (coins[minInd] + tab[minInd])*n + minInd+1 << endl; return 0; } |