제출 #993175

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

robots

#include "robots.h"
#include "bits/stdc++.h"
using namespace std;
vector<pair<int,int>>v;
void slv(deque<int>dq){
    map<pair<int,int>,int>mp;
    priority_queue<pair<int,int>>pq;
    int l=0;
    for(int i=0;i<dq.size();i++){
        while(l<v.size()&&dq[i]>v[l].first){
            pq.push({v[l].second,v[l].first});
            l++;
        }
        if(pq.size()){
            mp[{pq.top().second,pq.top().first}]++;
            pq.pop();
        }
    }
    vector<pair<int,int>>vec;
    for(auto &i:v){
        if(mp[i]){
            mp[i]--;
        }else vec.push_back(i);
    }
}
int putaway(int A, int B, int t, int x[], int y[], int w[], int s[]) {
    for(int i=0;i<t;i++)v.push_back({w[i],s[i]});
    deque<int>a,b;
    for(int i=0;i<A;i++)a.push_back(x[i]);
    for(int i=0;i<B;i++)b.push_back(y[i]);
    int sz=t+1,cnt=0;
    while(v.size()&&sz!=v.size()){
        cnt++;
        sz=v.size();
        sort(v.begin(),v.end());
        slv(a);
        for(auto &i:v)swap(i.first,i.second);
        sort(v.begin(),v.end());
        slv(b);
        for(auto &i:v)swap(i.first,i.second);
    }
    if(v.size())cnt=-1;
    return cnt;
}

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

robots.cpp: In function 'void slv(std::deque<int>)':
robots.cpp:9:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |     for(int i=0;i<dq.size();i++){
      |                 ~^~~~~~~~~~
robots.cpp:10:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |         while(l<v.size()&&dq[i]>v[l].first){
      |               ~^~~~~~~~~
robots.cpp: In function 'int putaway(int, int, int, int*, int*, int*, int*)':
robots.cpp:32:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |     while(v.size()&&sz!=v.size()){
      |                     ~~^~~~~~~~~~

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