제출 #462588

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
462588		julian33	로봇 (IOI13_robots)	C++14	0 / 100	231 ms	19684 KiB

robots

#include <bits/stdc++.h>
#include "robots.h"

using namespace std;

#ifdef LOCAL
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {
    cerr<<vars<<" = ";
    string delim="";
    (...,(cerr<<delim<<values,delim=", "));
    cerr<<"\n";
}
#else
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {}
#endif

#define pb push_back
#define sz(x) (int)(x.size())
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<typename T> inline void maxa(T& a,T b){a=max(a,b);}
template<typename T> inline void mina(T& a,T b){a=min(a,b);} 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int mxN=1e5+5; //make sure this is right
const int mod=1e9+7;


int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]){
    int ans=1; int active=0; int total=0;
    vector<pii> toys;
    priority_queue<int> small,weak;
    for(int i=0;i<A;i++)
        weak.push(X[i]);
    for(int i=0;i<B;i++)
        small.push(Y[i]);
    for(int i=0;i<T;i++)
        toys.pb({W[i],S[i]});
    sort(toys.begin(),toys.end(),[&](auto a,auto b){return a.first>b.first;});
    for(auto &[w,s]:toys){
        while(sz(weak) && w<weak.top()){
            active++; total++;
            weak.pop();
        }
        while(sz(small) && s<small.top()){
            assert(false);
            small.pop();
        }
        if(total==0)
            return -1;
        if(active==0){
            ans++;
            active=total;
        }
        active--;
    }
    return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

robots.cpp: In function 'int putaway(int, int, int, int*, int*, int*, int*)':
robots.cpp:45:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   45 |     for(auto &[w,s]:toys){
      |               ^

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