제출 #426572

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
426572		SAAD	로봇 (IOI13_robots)	C++17	0 / 100	3066 ms	304 KiB

robots

#define F first
#define S second
#define rep(i,a,b) for(int i=a;!(a==b&&i!=b)&&((i<=b&&b>=a)||(i>=b&&a>=b));i+=(a<=b?1:-1))
#define pb push_back
#define Fbitl __builtin_ffs
#define bit1 __builtin_popcount
//#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string.h>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include "robots.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
int putaway(int A,int B,int T,int X[],int Y[],int W[],int S[]) {
    vector <pair<int,int>> x;
    for (int i = 0 ; i < T;i++)
        x.pb({W[i],S[i]});
    int c = A , res = 0 ;
    sort(x.begin(),x.end());
    while ( T ) {
        c = A ;
        for (int i = T-1; i >= 0&&c;i--){
            if ( x[i].F < X[c-1] ) {
                T--;
                x[i] = {0,0} ;
                c--;
            }
        }
        c = B;
        for (int i = T-1; i >= 0&&c;i--){
            if ( x[i].S < Y[c-1] ) {
                T--;
                x[i] = {0,0} ;
                c--;
            }
        }
        res++;
        sort(x.begin(),x.end());
    }
    return res ;
}

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