#975699 (C++17) No.2734 Addition and Multiplication in yukicoder (Hard)

• 問題: No.2734 Addition and Multiplication in yukicoder (Hard)
• ユーザー: 👑 binap
• 提出日時: 2024-04-20 19:08:02
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 1,267 ms / 5,000 ms
• コード長: 1,822 bytes
• コンパイル時間: 4,358 ms
• コンパイル使用メモリ: 266,104 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-10-12 16:32:46
• 合計ジャッジ時間: 24,269 ms
• ジャッジサーバーID （参考情報）: judge5 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	AC	2 ms; 5,248 KB
testcase_04	AC	2 ms; 5,248 KB
testcase_05	AC	2 ms; 5,248 KB
testcase_06	AC	2 ms; 5,248 KB
testcase_07	AC	2 ms; 5,248 KB
testcase_08	AC	2 ms; 5,248 KB
testcase_09	AC	2 ms; 5,248 KB
testcase_10	AC	2 ms; 5,248 KB
testcase_11	AC	2 ms; 5,248 KB
testcase_12	AC	2 ms; 5,248 KB
testcase_13	AC	2 ms; 5,248 KB
testcase_14	AC	2 ms; 5,248 KB
testcase_15	AC	2 ms; 5,248 KB
testcase_16	AC	2 ms; 5,248 KB
testcase_17	AC	395 ms; 5,248 KB
testcase_18	AC	418 ms; 5,248 KB
testcase_19	AC	2 ms; 5,248 KB
testcase_20	AC	2 ms; 5,248 KB
testcase_21	AC	2 ms; 5,248 KB
testcase_22	AC	1,224 ms; 5,248 KB
testcase_23	AC	1,198 ms; 5,248 KB
testcase_24	AC	1,229 ms; 5,248 KB
testcase_25	AC	1,267 ms; 5,248 KB
testcase_26	AC	1,211 ms; 5,248 KB
testcase_27	AC	1,007 ms; 5,248 KB
testcase_28	AC	1,216 ms; 5,248 KB
testcase_29	AC	1,167 ms; 5,248 KB
testcase_30	AC	866 ms; 5,248 KB
testcase_31	AC	1,187 ms; 5,248 KB
testcase_32	AC	1,076 ms; 5,248 KB
testcase_33	AC	566 ms; 5,248 KB
testcase_34	AC	815 ms; 5,248 KB
testcase_35	AC	323 ms; 5,248 KB
testcase_36	AC	326 ms; 5,248 KB
testcase_37	AC	705 ms; 5,248 KB
testcase_38	AC	616 ms; 5,248 KB

ソースコード

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

using mint = modint998244353;

int main(){
	int n;
	cin >> n;
	vector<long long> a(n);
	cin >> a;
	sort(a.begin(), a.end(), [](long long left, long long right){
		string s_left = to_string(left);
		string s_right = to_string(right);
		string s_left_right = s_left + s_right;
		string s_right_left = s_right + s_left;
		return s_left_right < s_right_left;
	});
	mint ans = 0;
	rep(i, n){
		int d = to_string(a[i]).size();
		ans *= mint(10).pow(d);
		ans += a[i];
	}
	cout << ans << "\n";
	return 0;
}