結果
問題 | No.193 筒の数式 |
ユーザー | heno239 |
提出日時 | 2020-08-14 15:01:49 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,697 bytes |
コンパイル時間 | 1,212 ms |
コンパイル使用メモリ | 120,256 KB |
実行使用メモリ | 19,912 KB |
最終ジャッジ日時 | 2024-10-10 11:57:54 |
合計ジャッジ時間 | 2,096 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 6 ms
19,776 KB |
testcase_01 | AC | 7 ms
19,780 KB |
testcase_02 | AC | 7 ms
19,776 KB |
testcase_03 | AC | 7 ms
19,780 KB |
testcase_04 | AC | 6 ms
19,908 KB |
testcase_05 | AC | 6 ms
19,904 KB |
testcase_06 | AC | 7 ms
19,904 KB |
testcase_07 | AC | 6 ms
19,784 KB |
testcase_08 | AC | 7 ms
19,780 KB |
testcase_09 | AC | 6 ms
19,784 KB |
testcase_10 | AC | 7 ms
19,908 KB |
testcase_11 | AC | 7 ms
19,780 KB |
testcase_12 | AC | 7 ms
19,912 KB |
testcase_13 | AC | 7 ms
19,784 KB |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
ソースコード
#include<iostream>#include<string>#include<cstdio>#include<vector>#include<cmath>#include<algorithm>#include<functional>#include<iomanip>#include<queue>#include<ciso646>#include<random>#include<map>#include<set>#include<bitset>#include<stack>#include<unordered_map>#include<utility>#include<cassert>#include<complex>#include<numeric>using namespace std;//#define int long longtypedef long long ll;typedef unsigned long long ul;typedef unsigned int ui;constexpr ll mod = 1000000007;const ll INF = mod * mod;typedef pair<int, int>P;#define stop char nyaa;cin>>nyaa;#define rep(i,n) for(int i=0;i<n;i++)#define per(i,n) for(int i=n-1;i>=0;i--)#define Rep(i,sta,n) for(int i=sta;i<n;i++)#define rep1(i,n) for(int i=1;i<=n;i++)#define per1(i,n) for(int i=n;i>=1;i--)#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)#define all(v) (v).begin(),(v).end()typedef pair<ll, ll> LP;typedef double ld;typedef pair<ld, ld> LDP;const ld eps = 1e-12;const ld pi = acos(-1.0);ll mod_pow(ll x, ll n, ll m = mod) {ll res = 1;while (n) {if (n & 1)res = res * x % m;x = x * x % m; n >>= 1;}return res;}struct modint {ll n;modint() :n(0) { ; }modint(ll m) :n(m) {if (n >= mod)n %= mod;else if (n < 0)n = (n % mod + mod) % mod;}operator int() { return n; }};bool operator==(modint a, modint b) { return a.n == b.n; }modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }modint operator+(modint a, modint b) { return a += b; }modint operator-(modint a, modint b) { return a -= b; }modint operator*(modint a, modint b) { return a *= b; }modint operator^(modint a, ll n) {if (n == 0)return modint(1);modint res = (a * a) ^ (n / 2);if (n % 2)res = res * a;return res;}ll inv(ll a, ll p) {return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);}modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }const int max_n = 1 << 20;modint fact[max_n], factinv[max_n];void init_f() {fact[0] = modint(1);for (int i = 0; i < max_n - 1; i++) {fact[i + 1] = fact[i] * modint(i + 1);}factinv[max_n - 1] = modint(1) / fact[max_n - 1];for (int i = max_n - 2; i >= 0; i--) {factinv[i] = factinv[i + 1] * modint(i + 1);}}modint comb(int a, int b) {if (a < 0 || b < 0 || a < b)return 0;return fact[a] * factinv[b] * factinv[a - b];}ll gcd(ll a, ll b) {if (a < b)swap(a, b);while (b) {ll r = a % b; a = b; b = r;}return a;}bool isord(char c) {return c == '+' || c == '-';}void solve() {string s; cin >> s;ll ans = 0;rep(i, s.size()) {string t;rep(j, s.size()) {t.push_back(s[(i + j) % s.size()]);}if (isord(t[0]) || isord(t.back()))continue;//cout << "! "<<t << "\n";ll cur = 0;vector<char> c;vector<ll> num;int le = 0;rep(j, t.size()) {if (isord(t[j])) {c.push_back(t[j]);string u = t.substr(le, j-le);//cout << u <<" "<< le<<" "<<j<<"\n";num.push_back(stoll(u));le = j + 1;}}string u = t.substr(le, t.size() - le);num.push_back(stoll(u));//cout << num[0] << " " << num[1] << " " << c[0] << "\n";cur = num[0];rep(i, c.size()) {ll val = num[i + 1];if (c[i] == '+')cur += val;else cur -= val;}//cout << t << " " << cur << "\n";ans = max(ans, cur);}cout << ans << "\n";}signed main() {ios::sync_with_stdio(false);cin.tie(0);//cout << fixed << setprecision(10);//init_f();//init();//expr();//int t; cin >> t; rep(i, t)solve();return 0;}