Codeforces Round #428 B

#include "iostream"
#include "string.h"
#include "stack"
#include "queue"
#include "string"
#include "vector"
#include "set"
#include "map"
#include "algorithm"
#include "stdio.h"
#include "math.h"
#pragma comment(linker, "/STACK:102400000,102400000")
#define ll long long
#define endl ("\n")
#define bug(x) cout<<x<<" "<<"UUUUU"<<endl;
#define mem(a,x) memset(a,x,sizeof(a))
#define mp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define ft first
#define sd second
#define lrt (rt<<1)
#define rrt (rt<<1|1)
using namespace std;
const long long INF = 1e18+1LL;
const int inf = 1e9+1e8;
const int N=1e5+100;
const ll mod=1e9+7;

int f,t,m,n,k;
int main(){
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    cin>>n>>k;
    for(int i=1; i<=k; ++i){
        int x; cin>>x;
        m+=x/4;
        if(x%4==1) f++;
        if(x%4==2) t++;
        if(x%4==3) f++,t++;
    }
    int z=n,b=2*n;
    if(m<=n){
        z-=m;
        if(t<=b){
            b-=t;
            if(f<=z*2+b){
                cout<<"YES";
            }
            else cout<<"NO";
        }
        else{
            t-=b;
            if(t<=z){
                z-=t;
                f-=t;
                if(f<=z*2){
                    cout<<"YES";
                }
                else cout<<"NO";
            }
            else{
                f-=z;
                t-=z;
                f+=t*2;
                if(f<=0){
                    cout<<"YES";
                }
                else cout<<"NO";
            }
        }
    }
    else{
        m-=n;
        m*=2;
        t+=m;
        if(t+f<=b){
            cout<<"YES";
        }
        else cout<<"NO";
    }
    return 0;
}