Submission #1771634

---

Source Code Expand

#include <iostream>
using namespace std;

const int mod = (int)(7 + (10e9));

int *initial_sort(int &max);
void cal (int *a1, int *a2 ,int *b, int max);
void cal (int *a1, int *a2, int max);
int sum (int *a, int *b,int max);

int main(void) {
    int max = 1;
    int *a1;
    a1 = initial_sort(max);
    int *a2 = new int[(max/2)/2+1];
    int *a3 = new int[max/2+1];
    int *a4 = new int[max+1];

    cal (a1,a2,(max/2)/2);
    cal (a2,a3,a1,max/2);
    cal (a3,a4,a1,max);

    cout << sum (a4,a1,max) << endl;

    return 0;
}

void cal (int *a1, int *a2 ,int *b, int max)
{
    a2[0] = a2[1] = 0;
    for (int i = 2;i <= max;i ++){
        a2[i] = a2[i-2] + a1[i/2]*b[i/2];
    }
}

void cal (int *a1, int *a2, int max)
{
    a2[0] = a2[1] = 0;
    for (int i = 2;i <= max;i++){
        a2[i] = a2[i-2] + a1[i/2];
    }
}

int sum (int *a, int *b, int max)
{
    int result = 0;
    for (int i = 0;i <= max;i ++){
        result += a[i]*b[i];
        result = result % 1000000007;
    }
    return result;
}

int *initial_sort(int &max)
{
    int N,M;
    cin >> N;
    int *init = new int[1+(int)10e5];
    for (int i = 0;i <= 10e5;i ++) init[i] = 0;
    for (int i = 0;i < N;i ++){
        cin >> M;
        if (max < M) max = M;
        init[M] ++;
    }
    return init;
}

Submission Info

Judge Result