Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
- // #pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx")
- // #pragma comment(linker, "/stack:200000000"]
- #include <iostream>
- #include <vector>
- #include <cmath>
- #include <algorithm>
- #include <unordered_set>
- #include <unordered_map>
- #include <set>
- #include <map>
- #include <queue>
- #include <deque>
- #include <bitset>
- #include <stack>
- #include <random>
- #include <fstream>
- #include <sstream>
- #include <chrono>
- #define fi first
- #define se second
- #define pb push_back
- #define ll long long
- #define ld long double
- #define hm unordered_map
- #define pii pair<int, int>
- #define sz(a) (int)a.size()
- #define all(a) a.begin(), a.end()
- #define cinv(v) for (auto& x: v) cin >> x
- #define fr(i, n) for (int i = 0; i < n; ++i)
- #define fl(i, l, n) for (int i = l; i < n; ++i)
- #define ull uint64_t
- #define int ll
- using namespace std;
- #ifdef __LOCAL
- #define dbg(x) cerr << #x << " : " << x << '\n'
- const int maxn = 20;
- #else
- #define dbg(x)
- const int maxn = 2e5 + 20;
- #endif
- //tg: @galebickosikasa
- const ll inf = (ll) 2e9;
- const ld pi = asin (1) * 2;
- const ld eps = 1e-8;
- const ll mod = (ll)1e9 + 7;
- const ll ns = 97;
- mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
- signed main () {
- ios_base::sync_with_stdio(false);
- cin.tie(nullptr);
- cout.tie(nullptr);
- int n, t;
- cin >> n >> t;
- vector<ull> goo (n), l2 (n), l3 (n), l6 (n);
- cinv (goo);
- if (goo[0] % (ull)6 == 0) ++l6[0];
- else if (goo[0] % (ull)3 == 0) ++l3[0];
- else if (goo[0] % (ull)2 == 0) ++l2[0];
- fl (i, 1, n) {
- l2[i] = l2[i - 1];
- l3[i] = l3[i - 1];
- if (goo[i] % (ull)6 == 0) ++l6[i];
- else if (goo[i] % (ull)3 == 0) ++l3[i];
- else if (goo[i] % (ull)2 == 0) ++l2[i];
- }
- int ans = 0;
- fl (i, t, n) {
- int x = goo[i];
- if (x % (ull)6 == 0) continue;
- else if (x % (ull)2 == 0) {
- ans += l3[i - t];
- } else if (x % (ull)3 == 0) {
- ans += l2[i - t];
- }
- // dbg (x);
- // dbg (ans);
- }
- fr (i, n) {
- int x = goo[i];
- if (x % (ull)6 == 0) {
- int a = max (0ll, i - t + 1);
- int b = max (0ll, n - i - t);
- ans += a + b;
- dbg (a);
- dbg (b);
- }
- }
- cout << ans;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement