제출 #1002912

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1002912		Cabralbonzao	Cigle (COI21_cigle)	C++17	9 / 100	641 ms	444 KiB

cigle

#include<bits/stdc++.h>
using namespace std;

#define N 110
#define INFLL 2000000000000000020
#define pb push_back

typedef long long ll;
typedef pair<ll,ll> pll;

vector<ll>vec;
vector<ll>nvec;
map<ll,ll>freq;
ll vet[N];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    ll n,i=0,ans=0,resp,dir=1,last=0,j;

    cin >> n;
    while(i<n)
    {
        cin >> vet[i];
        i++;
    }
    for(i=0;i<(1<<n);i++)
    {
        resp=0;
        last=0;
        vec.clear();
        nvec.clear();
        for(j=0;j<=n;j++)
        {
            if(i&(1LL<<j) || j==n)
            {
                if(!nvec.empty())
                    nvec.pop_back();
                freq.clear();
                for(auto x : vec)
                {
                    freq[x]++;
                }
                for(auto x : nvec)
                {
                    freq[x]++;
                    resp+=(bool)(freq[x]==2);
                }
                vec.clear();
                for(auto x : nvec)
                    vec.pb(x);
                nvec.clear();
                dir*=-1;
            }
            last+=vet[j]*dir;
            nvec.pb(last);
        }
        ans=max(ans,resp);
    }
    cout << ans << endl;

    return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 0 / 11
• Subtask 3: 0 / 13
• Subtask 4: 0 / 15
• Subtask 5: 0 / 52