Algorithms

Below is the link to the problem and my code. I could only pass case 1 with my code. And other cases are showing wrong answers. It would be of great help if anyone could identify the errors in my code.

#include<bits/stdc++.h>

using namespace std;

vector<long long int>freq(1000000,0);

void merge(vector<long long int>&v,long long int low,long long int mid,long long int high)
{
    long long int count=0;
    long long int i = low,j = mid+1,k=0;
    vector<long long int>temp(high-low+1);
    for(long long int p=low;p<=high;p++)
    {
        if(i>mid)
        {
            temp[k++] = v[j++];
        }
        else if(j>high)
        {
            temp[k++] = v[i];
            freq[v[i]]+=count;
            i++;
        }
        else if(v[i]<=v[j])
        {
            temp[k++] = v[i];
            freq[v[i]]+=count;
            i++;
        }
        else
        {
            temp[k++] = v[j++];
            count++;
        }
    }
    
    
    for(long long int p = 0;p<k;p++)
    {
        v[low+p] = temp[p];
    }
}

void merge_sort(vector<long long int>&v,long long int low,long long int high)
{
    if(low>=high)
    {
        return;
    }
    long long int mid = (low+high)/2;
    merge_sort(v,low,mid);
    merge_sort(v,mid+1,high);
    merge(v,low,mid,high);
}

int main()
{
    long long int t;
    cin>>t;
    while(t--)
    {
        long long int n,x;
        cin>>n;
        vector<long long int> v;
        for(long long int i=0;i<n;i++)
        {
            cin>>x;
            v.push_back(x);
        }
        vector<long long int>w = v;
        merge_sort(v,0,n-1);
        for(long long int i=0;i<n;i++)
        {
            cout<<freq[w[i]]<<" ";
        }
        cout<<endl;
    }
}

<?php
$img = imagecreatefromjpeg("Path to Image that is 480x272");
$width = ImageSX($img);
$height = ImageSY($img);

for ($y = 0; $y < $height; $y++) {
    for ($x = 0; $x < $width; $x++) {
        $c = imageColorAt($img, $x, $y);
        $r = ($c >> 16) & 0xFF;
        $g = ($c >> 8) & 0xFF;
        $b = $c & 0xFF;

        $r = $r >> 3;
        $g = $g >> 2;
        $b = $b >> 3;

        $oc = ($r << 11) | ($g << 5) | $b;
 	echo ("fill $x,$y,1,1,$oc<br>");
    }
}
?>

1. All 1s must be used
2. Same 1s can be used more than once
3. Width and height must be power of 2 (1,2,4)
   that means groups can be (1x1,2x1,1x2,2x2,4x2,2x4,4x1,1x4,4x4)
4. Group can cross over border to get to the other side
   (like folded paper; 0 can be connected with 3 and vice versa)
5. Logically number of areas should be minimum possible
6. Area is defined by it's top left corner and it's bottom right corner
   (In form of point)
7. Optional:
   The times one [1] is used more than once must be maximum possible