Submission #526053

#	Time	Username	Problem	Language	Result	Execution time	Memory
526053		Deepesson	Robots (IOI13_robots)	C++17	76 / 100	3007 ms	17224 KiB

robots

#include <bits/stdc++.h>
#include "robots.h"
typedef std::pair<int,int> pii;
int putaway(int A,int B,int T,int X[],int Y[],int W[],int S[]){
    std::sort(X,&X[A]);
    std::sort(Y,&Y[B]);
    int pesos[T]={};
    for(int i=0;i!=A;++i){
        for(int j=0;j!=T;++j){
            if(W[j]<X[i]){
                pesos[j]++;
            }
        }
    }
    for(int i=0;i!=B;++i){
        for(int j=0;j!=T;++j){
            if(S[j]<Y[i]){
                pesos[j]++;
            }
        }
    }
    for(auto&x:pesos)if(!x)return -1;
    int count=0,retirou=0;
    bool pegou[T]={};
    for(;;){
        ++count;
        for(int i=0;i!=A;++i){
            int pos=-1,valor = 1e9;
            for(int j=0;j!=T;++j){
                if(pegou[j])continue;
                if(W[j]<X[i]){
                    if(pesos[j]<valor){
                        valor=pesos[j];
                        pos=j;
                    }
                }
            }
            if(pos!=-1){
                pegou[pos]=true;
                ++retirou;
            }
        }
        for(int i=0;i!=B;++i){
            int pos=-1;
            pii valor = {1e9,-1};
            for(int j=0;j!=T;++j){
                if(pegou[j])continue;
                if(S[j]<Y[i]){
                    if(pii(pesos[j],1e9-S[j])<valor){
                        valor={pesos[j],1e9-S[j]};
                        pos=j;
                    }
                }
            }
            if(pos!=-1){
                pegou[pos]=true;
                ++retirou;
            }
        }
        if(retirou==T){
            break;
        }
    }
    return count;
}

• Subtask 1: 14 / 14
• Subtask 2: 0 / 14
• Subtask 3: 25 / 25
• Subtask 4: 37 / 37
• Subtask 5: 0 / 10