#include<bits/stdc++.h>
using namespace std;
int main() {
    int t;
    cin >> t;
    while (t--) {
        int n, m;
        cin >> n >> m;
        vector< int > vc(400), last_order(401), occu(401);
        for (int i = 0; i < m; i++) {
            cin >> vc[i];
            last_order[vc[i]] = i;
        }
        //occu[vc[i]] = 0, if customer is not already sitting on some table
        //occu[vc[i]] = 1, if customer has occupied some table
 
        int free_tables = n, clean = 0;
 
        for (int i = 0; i < m; i++) {
            if (occu[vc[i]] == 0) {
                if (free_tables) {
                    occu[vc[i]] = 1;
                    free_tables--;
                    clean++;

The paragraph in the first section is not showing the same result with the same settings. But when I apply percentage margin it becomes correct.

Below is the image when I apply the same margin settings as given in the solution.

I have changed the code but the judge is showing WA. Can you help with flaw in my logic. Thanks.

#include<bits/stdc++.h>
using namespace std;
vector<int> vc;
vector<vector<int>> sw;
int n;
int supw(int ind, int rest)
{
    if(ind == n) return 0;
    if(rest == 3) return INT_MAX;
    if(sw[ind][rest] == -1)
    {
        sw[ind][rest] = min(vc[ind]+supw(ind+1, 0), supw(ind+1, rest+1));
        return(sw[ind][rest]);
    }
    else return(sw[ind][rest]);
}
int main()
{
    cin>>n;
    vector<int>v(n);

What is the problem with this code. It shows segmentation fault.

#include<bits/stdc++.h>
using namespace std;
int n;
vector<int> ar;
vector<vector<int>>sw;
int supw(int rest, int days)
{
    if(days == n) return 0;
    if(rest == 3) return(INT_MAX);
    if(sw[days][rest] != -1) return sw[days][rest];
    else
    {
        sw[days][rest] = min(ar[i] + supw(0, days+1), supw(rest+1, days+1));
        return(sw[days][rest]);
    }
 
}
int main()
{
    cin>>n;
    int x;
    vector<vector<int>> sw(n, vector<int> (3));

No, on codechef you just have to submit your code or or your file in which you have written your code. No specific file name is required.

Thank you for your answer but I actually want to know what is wrong with my code. I am not able to figure out any. Can you help me with that please.

Thanks.

Only 5 test cases are correct for this code. Can you help me please.

#include<iostream>
using namespace std;
int main()
{
    int n,h,k,f=0;
    cin>>n>>h;
    int ar[n];
    for(int i=0;i<n;i++)
        cin>>ar[i];
        int x=0;
    for(;;)
    {
        cin>>k;
        switch(k)
        {
            case 1: if(x>=0)
                       --x;
                    break;
            case 2: if(x<(n-1))
                       ++x;
                    break;
            case 3: if(ar[x]>0&&f==0)

I have written this code but the IARCS compiler is showing "fatal" state every time. Can anyone help me with this.

#include<iostream>
#include<cmath>
using namespace std;
int main()
{
    int n,p1,p2,p1t=0,p2t=0,d,m=0,p;
    cin>>n;
    for(int i=0;i<n;i++)
    {
        cin>>p1>>p2;
        p1t+=p1;
        p2t+=p2;
        d=p1t-p2t;
        if(m<abs(d))
        {
            m=abs(d);
            p=d>0?1:2;
        }
    }
    cout<<p<<" "<<m;

Yes