結果
問題 | No.457 (^^*) |
ユーザー |
![]() |
提出日時 | 2020-06-04 17:50:54 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 2,442 bytes |
コンパイル時間 | 1,888 ms |
コンパイル使用メモリ | 196,632 KB |
最終ジャッジ日時 | 2025-01-10 21:15:27 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 20 |
ソースコード
#include <bits/stdc++.h>#define rep(i, n) for (int i = 0; i < int(n); i++)#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)#define reps(i, n) for (int i = 1; i <= int(n); i++)#define rreps(i, n) for (int i = int(n); i >= 1; i--)#define repc(i, n) for (int i = 0; i <= int(n); i++)#define rrepc(i, n) for (int i = int(n); i >= 0; i--)#define repi(i, a, b) for (int i = int(a); i < int(b); i++)#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)#define all(a) (a).begin(), (a).end()#define bit32(x) (1 << (x))#define bit64(x) (1ll << (x))#define sz(v) ((int) v.size())using namespace std;using i64 = long long;using f80 = long double;using vi32 = vector<int>;using vi64 = vector<i64>;using vf80 = vector<f80>;using vstr = vector<string>;void yes() { cout << "Yes" << endl; exit(0); }void no() { cout << "No" << endl; exit(0); }template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};template <typename T> void amax(T &x, T y) { x = max(x, y); }template <typename T> void amin(T &x, T y) { x = min(x, y); }template <typename T> T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }template <typename T> istream& operator>>(istream &is, vector<T> &v) { for (auto &x : v) is >> x; return is; }template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }const int INF = 1001001001;const int dx[] = {1, 0, -1, 0};const int dy[] = {0, 1, 0, -1};void solve() {string s;cin >> s;int n = sz(s);vi64 c(4);i64 ans_a = 0;rep(i, n) {if (s[i] == '(') {c[0] += 1;}if (s[i] == '^') {c[2] += c[1], c[1] = 0;c[1] += c[0], c[0] = 0;}if (s[i] == '*') {c[3] += c[2], c[2] = 0;}if (s[i] == ')') {ans_a += c[3];}}c = {0, 0, 0, 0};i64 ans_b = 0;rep(i, n) {if (s[i] == '(') {c[0] += 1;}if (s[i] == '*') {c[1] += c[0], c[0] = 0;}if (s[i] == '^') {c[3] += c[2], c[2] = 0;c[2] += c[1], c[1] = 0;}if (s[i] == ')') {ans_b += c[3];}}cout << ans_a << " " << ans_b << endl;}