Cod sursa(job #2666053)

Utilizator marcumihaiMarcu Mihai marcumihai Data 31 octombrie 2020 19:12:40
Problema Oite Scor 60
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.08 kb
#include <bits/stdc++.h>

using namespace std;

ifstream f ("oite.in");
ofstream g ("oite.out");

const int MOD=666013;
int n , s;
int cont=0;
int a[700050];
struct val{
 int suma;
 int a;
 int b;
};
vector <val> v[MOD+5];

void citire()
{
    f>>n>>s;
    for(int i=1;i<=n;++i)
        f>>a[i];
}

int cauta(int x , int k , int t)
{
    int nr=0;
    int r=x%MOD;
    for(int i=0;i<v[r].size();++i)
    {
        if(x==v[r][i].suma && k!=v[r][i].a && t!=v[r][i].b && t!=v[r][i].a && k!=v[r][i].b)
            ++nr;
    }
    return nr;
}
void rezolvare()
{
    for(int i=1;i<=n;++i)
    {
        for(int j=i+1;j<=n;++j)
        {
            int sum=a[i]+a[j];
            v[sum%MOD].push_back( {sum , i , j});
        }
    }
    for(int i=1;i<=n;++i)
    {
        for(int j=i+1;j<=n;++j)
        {
            int sum=a[i]+a[j];
            if(s>sum && !v[(s-sum)%MOD].empty() && cauta(s-sum , i , j)>0)
                cont+=cauta(s-sum , i , j);

        }
    }
    g<<cont/6;
}
int main()
{
    citire();
    rezolvare();
    return 0;
}