Submission #66591107

---

Source Code Expand

#include <bits/stdc++.h>
#define int long long
const int MAXN = 1e2;
const long long inf = 1e18;
const int MAXS = 7e2;
const int mod = 998244353;
const int zero = 0;
using namespace std;
int32_t main() {
    // freopen("cowtip.in", "r", stdin);
    // freopen("cowtip.out", "w", stdout);
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    int t;
    // cin >> t;
    t = 1;
    while(t--){
        int n, l;
        cin >> n >> l;
        if(l % 3){
            cout << 0 << '\n';
            continue;
        }
        // vector<int> v;
        int x = 0;
        int ampos[l+1];
        bool c[l+1];
        for(int i = 0; i <= l; i++){
            ampos[i] = 0;
            c[i] = 0;
        }
        ampos[x]++;
        for(int i = 0; i < n-1; i++){
            int y;
            cin >> y;
            x += y;
            x %= l;
            ampos[x]++;
        }
        int ans = 0;
        int j = l / 3;
        for(int i = 0; i < l; i++){
            if(c[i] == 0 && c[i+j] == 0 && c[i+j+j] == 0){
                ans += ampos[i] * ampos[i+j] * ampos[i+j+j];
                c[i] = 1;
                c[i+j] = 1;
                c[i+j+j] = 1;
            }
        }
        cout << ans << '\n';
    }
}

Submission Info

Judge Result