Submission #1276343

#TimeUsernameProblemLanguageResultExecution timeMemory
1276343k12_khoiRobots (IOI13_robots)C++17
14 / 100
3094 ms43860 KiB
#include "robots.h"

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

const int N=1e6+5;
const int oo=1e9+1;

int n,m,request;
int a[N],b[N],W[N],S[N],cnt[N],dem[N];

int putaway(int n,int m,int request,int a[],int b[],int W[],int S[])
{
    int res=oo;


    function<void(int)> ql = [&] (int i) -> void
    {
        if (i==request)
        {
            res=min(res,max(*max_element(cnt,cnt+n),*max_element(dem,dem+m)));
            return;
        }

        for (int j=0;j<n;j++)
        if (W[i]<a[j])
        {
            cnt[j]++;
            ql(i+1);
            cnt[j]--;
        }

        for (int j=0;j<m;j++)
        if (S[i]<b[j])
        {
            dem[j]++;
            ql(i+1);
            dem[j]--;
        }

    };

    ql(0);


    if (res==oo) res=-1;

    return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...