結果

問題 No.297 カードの数式
ユーザー heno239heno239
提出日時 2020-08-23 11:59:38
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 4 ms / 1,000 ms
コード長 4,113 bytes
コンパイル時間 1,121 ms
コンパイル使用メモリ 122,024 KB
実行使用メモリ 7,620 KB
最終ジャッジ日時 2024-10-15 18:06:07
合計ジャッジ時間 1,905 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
7,296 KB
testcase_01 AC 3 ms
7,552 KB
testcase_02 AC 3 ms
7,492 KB
testcase_03 AC 3 ms
7,492 KB
testcase_04 AC 3 ms
7,296 KB
testcase_05 AC 3 ms
7,424 KB
testcase_06 AC 3 ms
7,496 KB
testcase_07 AC 2 ms
7,424 KB
testcase_08 AC 4 ms
7,552 KB
testcase_09 AC 3 ms
7,492 KB
testcase_10 AC 3 ms
7,552 KB
testcase_11 AC 3 ms
7,424 KB
testcase_12 AC 3 ms
7,368 KB
testcase_13 AC 4 ms
7,360 KB
testcase_14 AC 3 ms
7,296 KB
testcase_15 AC 3 ms
7,364 KB
testcase_16 AC 3 ms
7,424 KB
testcase_17 AC 3 ms
7,552 KB
testcase_18 AC 3 ms
7,424 KB
testcase_19 AC 4 ms
7,424 KB
testcase_20 AC 3 ms
7,620 KB
testcase_21 AC 3 ms
7,552 KB
testcase_22 AC 4 ms
7,296 KB
testcase_23 AC 3 ms
7,424 KB
testcase_24 AC 3 ms
7,424 KB
testcase_25 AC 3 ms
7,424 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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>
#include<array>
using namespace std;

//#define int long long
typedef 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 = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m) {
	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 << 18;
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];
}

void solve() {
	int n; cin >> n;
	vector<char>c(n);
	rep(i, n)cin >> c[i];
	int cp = 1, cn = 0;
	string s;
	rep(i, n) {
		if (c[i] == '+')cp++;
		else if (c[i] == '-')cn++;
		else {
			s.push_back(c[i]);
		}
	}
	sort(all(s));
	ll ansma = -INF, ansmi = INF;
	//max
	if (cp > 0) {
		vector<string> v(cp + cn);
		int r = s.size() - (cp + cn);
		int loc = 0;
		rep1(i, v.size() - 1) {
			v[i].push_back(s[loc]); loc++;
		}
		while (loc < s.size()) {
			v[0].push_back(s[loc]); loc++;
		}
		rep(i, v.size())reverse(all(v[i]));
		ll sum = stoll(v[0]);
		rep(i, cn) {
			sum -= stoll(v[1 + i]);
		}
		for (int i = 1 + cn; i < v.size(); i++) {
			sum += stoll(v[i]);
		}
		ansma = sum;
	}
	//min
	if (cn > 0) {
		vector<string> v(cp + cn);
		int r = s.size() - (cp + cn);
		int loc = 0;
		per1(i, (int)v.size() - 1) {
			v[i].push_back(s[loc]); loc++;
		}
		while (loc < s.size()) {
			v[0].push_back(s[loc]); loc++;
		}
		rep(i, v.size())reverse(all(v[i]));
		ll sum = -stoll(v[0]);
		rep(i, cn-1) {
			sum -= stoll(v[1 + i]);
		}
		for (int i = cn; i < v.size(); i++) {
			sum += stoll(v[i]);
		}
		ansmi = sum;
	}
	else {
		vector<string> v(cp);
		rep(i, s.size()) {
			v[i % cp].push_back(s[s.size() - 1 - i]);
		}
		rep(i, v.size())reverse(all(v[i]));
		ll sum = 0;
		rep(i, cp)sum += stoll(v[i]);
		ansmi = sum;
	}
	cout << ansma << " " << ansmi << "\n";
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(10);
	//init_f();
	//expr();
	//int t; cin >> t; rep(i, t)
	//while (cin >> n >> m>>s1>>s2>>t, n)
	solve();
	return 0;
}
0