結果
問題 | No.805 UMG |
ユーザー | spihill |
提出日時 | 2019-03-22 21:33:59 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 5 ms / 2,000 ms |
コード長 | 2,923 bytes |
コンパイル時間 | 1,475 ms |
コンパイル使用メモリ | 166,816 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-11-18 13:15:30 |
合計ジャッジ時間 | 2,342 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 25 |
ソースコード
#include "bits/stdc++.h" using ll = long long; using namespace std; #define int ll //0 -> a-1 #define rep(i, a) for (int i = 0; (i) < (int)(a); (i)++) //a -> b-1 #define reps(i, a, b) for (int i = (int)(a); (i) < (int)(b); (i)++) //a-1 -> 0 #define rrep(i, a) for (int i = (int)a - 1; (i) >= 0; (i)--) //a-1 -> b #define rreps(i, a, b) for (int i = (int)(a)-1; (i) >= (int)(b); (i)--) #define MP(a, b) make_pair((a), (b)) #define PB(a) push_back((a)) #define all(v) (v).begin(), (v).end() //next_permutation(all(v)) #define PERM(v) next_permutation(all(v)) /*sort(all(v)); (v).erase(unique(all(v)), v.end())*/ #define UNIQUE(v) \ sort(all(v)); \ (v).erase(unique(all(v)), v.end()) #define CIN(type, x) \ type x; \ cin >> x #define YES(f) if ((f)) {cout << "YES" << endl;} else {cout << "NO" << endl;} #define Yes(f) if ((f)) {cout << "Yes" << endl;} else {cout << "No" << endl;} #define MINV(v) min_element(all(v)) #define MAXV(v) max_element(all(v)) #define MIN3(a, b, c) min(min(a, b), c) #define MIN4(a, b, c, d) min(MIN3(a, b, c), d) #define MIN5(a, b, c, d, e) min(MIN4(a, b, c, d), e) #define MIN6(a, b, c, d, e, f) min(MIN5(a, b, c, d, e), f) #define MAX3(a, b, c) max(max(a, b), c) #define MAX4(a, b, c, d) max(MAX3(a, b, c), d) #define MAX5(a, b, c, d, e) max(MAX4(a, b, c, d), e) #define MAX6(a, b, c, d, e, f) max(MAX5(a, b, c, d, e), f) //b is [a, c) #define RANGE(a, b, c) ((a) <= (b) && (b) < (c)) //c is [a, e) && d is [b, f) #define RANGE2D(a, b, c, d, e, f) (RANGE((a), (c), (e)) && RANGE((b), (d), (f))) #define chmin(a, b) a = min(a, (b)) #define chmin3(a, b, c) a = MIN3(a, (b), (c)) #define chmin4(a, b, c, d) a = MIN4(a, (b), (c), (d)) #define chmin5(a, b, c, d, e) a = MIN5(a, (b), (c), (d), (e)) #define chmin6(a, b, c, d, e, f) a = MIN6(a, (b), (c), (d), (e), (f)) #define chmax(a, b) a = max(a, (b)) #define chmax3(a, b, c) a = MAX3(a, (b), (c)) #define chmax4(a, b, c, d) a = MAX4(a, (b), (c), (d)) #define chmax5(a, b, c, d, e) a = MAX5(a, (b), (c), (d), (e)) #define chmax6(a, b, c, d, e, f) a = MAX6(a, (b), (c), (d), (e), (f)) #define fcout cout << fixed << setprecision(12) #define RS resize #define CINV(v, N) \ do \ { \ v.RS(N); \ rep(i, N) cin >> v[i]; \ } while (0); #define RCINV(v, N) \ do \ { \ v.RS(N); \ rrep(i, N) cin >> v[i]; \ } while (0); #define MOD 1000000007 template <class T> inline T GET() { T x; cin >> x; return x; } void init(); void solve(); signed main() { init(); solve(); } void init() { int n; string s; cin >> n >> s; int u=0, m=0, g=0; ll res = 0; int l = s.length(); rep(i, l) { if (s[i] == 'M') { reps(j, 1, 100000) { if (i-j < 0 || l <= i+j) break; if (s[i-j] == 'U' && s[i+j] == 'G') res++; } } } cout << res << endl; } void solve() { }