Submission #3819589


Source Code Expand

//#pragma GCC optimize(2)
//#pragma GCC optimize(3)
//#pragma GCC optimize(4)
//#pragma GCC optimize("unroll-loops")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
#define fi first
#define se second
#define db double
#define mp make_pair
#define pb push_back
#define pi acos(-1.0)
#define ll long long
#define vi vector<int>
#define mod 998244353
#define ld long double
//#define C 0.5772156649
#define ls l,m,rt<<1
#define rs m+1,r,rt<<1|1
#define pll pair<ll,ll>
#define pil pair<int,ll>
#define pli pair<ll,int>
#define pii pair<int,int>
#define ull unsigned long long
//#define base 1000000000000000000
#define fin freopen("a.txt","r",stdin)
#define fout freopen("a.txt","w",stdout)
#define fio ios::sync_with_stdio(false);cin.tie(0)
inline ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
inline void sub(ll &a,ll b){a-=b;if(a<0)a+=mod;}
inline void add(ll &a,ll b){a+=b;if(a>=mod)a-=mod;}
template<typename T>inline T const& MAX(T const &a,T const &b){return a>b?a:b;}
template<typename T>inline T const& MIN(T const &a,T const &b){return a<b?a:b;}
inline ll qp(ll a,ll b){ll ans=1;while(b){if(b&1)ans=ans*a%mod;a=a*a%mod,b>>=1;}return ans;}
inline ll qp(ll a,ll b,ll c){ll ans=1;while(b){if(b&1)ans=ans*a%c;a=a*a%c,b>>=1;}return ans;}

using namespace std;

const ull ba=233;
const db eps=1e-8;
const ll INF=0x3f3f3f3f3f3f3f3f;
const int N=200000+10,maxn=200000+10,inf=0x3f3f3f3f;

ll a[N];
map<ll,ll>ma;
int main()
{
    int n,ans=0;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)scanf("%lld",&a[i]),ma[a[i]]++;
    sort(a+1,a+1+n);
    for(int i=n;i>=1;i--)
    {
        ll now=1;
        while(now<=a[i])now<<=1;
        if(now==a[i]*2)
        {
            if(ma[a[i]]>=2)ans++,ma[a[i]]-=2;
        }
        else if(ma[now-a[i]]>=1&&ma[a[i]]>=1)ans++,ma[now-a[i]]--,ma[a[i]]--;
    }
    printf("%d\n",ans);
    return 0;
}
/********************

********************/

Submission Info

Submission Time
Task B - Powers of two
User walfy
Language C++14 (GCC 5.4.1)
Score 600
Code Size 2098 Byte
Status AC
Exec Time 216 ms
Memory 26752 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:51:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
./Main.cpp:52:56: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     for(int i=1;i<=n;i++)scanf("%lld",&a[i]),ma[a[i]]++;
                                                        ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 600 / 600
Status
AC × 2
AC × 19
Set Name Test Cases
Sample sample01.txt, sample02.txt
All sample01.txt, sample02.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, sample01.txt, sample02.txt
Case Name Status Exec Time Memory
in01.txt AC 204 ms 26752 KiB
in02.txt AC 216 ms 26752 KiB
in03.txt AC 202 ms 26752 KiB
in04.txt AC 198 ms 20480 KiB
in05.txt AC 213 ms 20480 KiB
in06.txt AC 56 ms 2048 KiB
in07.txt AC 53 ms 2048 KiB
in08.txt AC 2 ms 256 KiB
in09.txt AC 1 ms 256 KiB
in10.txt AC 2 ms 256 KiB
in11.txt AC 2 ms 256 KiB
in12.txt AC 2 ms 256 KiB
in13.txt AC 32 ms 1792 KiB
in14.txt AC 33 ms 1792 KiB
in15.txt AC 32 ms 1792 KiB
sample01.txt AC 1 ms 256 KiB
sample02.txt AC 1 ms 256 KiB