Submission #74670564
Source Code Expand
#include<bits/extc++.h>
#pragma GCC optimize("O3","unroll-loops")
#pragma GCC target("avx,avx2")
#include<iostream>
#include<queue>
#include<vector>
#include<cmath>
#include<map>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define coutc "\033[48;5;196m\033[38;5;15m"
#define endc "\033[0m"
#define M(_1, _2, _3, _4, NAME, ...) NAME
#define rep(...) \
M(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rep4(_, x, n, s) \
for (int _ = x; (s < 0) ? _ > n : _ < n; _ += s)
#define rep3(_, x, n) rep4(_, x, n, (x < n ? 1 : -1))
#define rep2(_, n) rep3(_, 0, n)
#define rep1(n) rep2(i, n)
#define FOR(i, a, b) for (int i=a; i<b; i++)
#define F0R(i, a) for (int i=0; i<a; i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a*b/gcd(a,b)
#define mp make_pair
// #define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define endl "\n"
// #define cin fin
// #define cout fout
// ifstream fin("word.in");
// ofstream fout("word.out");
const int inf = INT_MAX;
const int MOD = 1000000007;
double PI = 4*atan(1);
#ifdef DEBUG
string to_string(char c) { return string({c}); }
// 7
template<class... Ts>
ostream& operator<<(ostream& o, tuple<Ts...> t) {
string s = "(";
apply([&](auto&&... r) {
((s += to_string(r) + ", "), ...); }, t);
return o << s.substr(0, len(s) - 2) + ")";
}
// 3
ostream& operator<<(ostream &o, pair<auto, auto> p) {
return o << "(" << p.fi << ", " << p.se << ")";
}
// 7
template<class C, class T = typename C::value_type,
typename std::enable_if<!std::is_same<C, std::string>
::value>::type* = nullptr>
ostream& operator<<(ostream &o, C c) {
for (auto e : c) o << setw(7) << right << e;
return o << endc << endl << coutc;
}
// 7
void debug(const auto &e, const auto &... r) {
cout << coutc << e;
((cout << " " << r), ..., (cout << endc << endl));
}
#else
#define debug(...)
#endif
map<string,int> mon;
map<int,string> inp;
void _main(int tc) {
int n, m;
cin >> n >> m;
vector<ll> a(n + 1), b(m + 1), p(n + 1);
ll tot = 0;
int i = 1;
while (i <= n) {
cin >> a[i];
p[i] = p[i - 1] + a[i];
tot += 1LL * i * a[i];
i++;
}
i = 1;
while (i <= m) {
cin >> b[i];
i++;
}
const ll md = 998244353;
ll ans = 0;
int j = 1;
while (j <= m) {
ll cur = tot;
int t = 1;
while (1LL * t * j <= n) {
int l = t * j;
int r = min(n, (t + 1) * j - 1);
ll sm = p[r] - p[l - 1];
cur -= 1LL * j * t * sm;
t++;
}
ans += (cur % md) * (b[j] % md);
ans %= md;
j++;
}
cout << ans % md << endl;
}
// 5
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
_main(0), exit(0);
int tc; cin >> tc; rep(i, tc) _main(i + 1);
}
Submission Info
| Submission Time |
|
| Task |
E - You WILL Like Sigma Problem |
| User |
zaahir |
| Language |
C++23 (GCC 15.2.0) |
| Score |
450 |
| Code Size |
3286 Byte |
| Status |
AC |
| Exec Time |
49 ms |
| Memory |
15020 KiB |
Compile Error
./Main.cpp: In function 'void _main(int)':
./Main.cpp:92:16: warning: unused parameter 'tc' [-Wunused-parameter]
92 | void _main(int tc) {
| ~~~~^~
Judge Result
| Set Name |
Sample |
All |
| Score / Max Score |
0 / 0 |
450 / 450 |
| Status |
|
|
| Set Name |
Test Cases |
| Sample |
00-sample-01.txt, 00-sample-02.txt |
| All |
00-sample-01.txt, 00-sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt |
| Case Name |
Status |
Exec Time |
Memory |
| 00-sample-01.txt |
AC |
1 ms |
3464 KiB |
| 00-sample-02.txt |
AC |
1 ms |
3492 KiB |
| 01-01.txt |
AC |
1 ms |
3516 KiB |
| 01-02.txt |
AC |
1 ms |
3576 KiB |
| 01-03.txt |
AC |
1 ms |
3480 KiB |
| 01-04.txt |
AC |
1 ms |
3704 KiB |
| 01-05.txt |
AC |
1 ms |
3616 KiB |
| 01-06.txt |
AC |
1 ms |
3504 KiB |
| 01-07.txt |
AC |
1 ms |
3672 KiB |
| 01-08.txt |
AC |
1 ms |
3552 KiB |
| 01-09.txt |
AC |
49 ms |
15008 KiB |
| 01-10.txt |
AC |
49 ms |
14984 KiB |
| 01-11.txt |
AC |
19 ms |
7188 KiB |
| 01-12.txt |
AC |
20 ms |
7172 KiB |
| 01-13.txt |
AC |
19 ms |
7188 KiB |
| 01-14.txt |
AC |
22 ms |
8408 KiB |
| 01-15.txt |
AC |
49 ms |
15020 KiB |
| 01-16.txt |
AC |
48 ms |
14924 KiB |
| 01-17.txt |
AC |
48 ms |
14980 KiB |
| 01-18.txt |
AC |
48 ms |
14968 KiB |
| 01-19.txt |
AC |
19 ms |
11100 KiB |
| 01-20.txt |
AC |
33 ms |
11784 KiB |