제출 #962961

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
962961		serkanrashid	로봇 (IOI13_robots)	C++14	14 / 100	200 ms	21900 KiB

robots

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

using namespace std;

struct toy
{
    int w,s;
    toy(){};
    toy(int wi, int si)
    {
        w = wi;
        s = si;
    }
};

const int maxt = 1e6;
const int maxr = 5e4;

int t;
toy k[maxt];

int a,b,x[maxr],y[maxr];

bool cmp2(toy p1, toy p2)
{
    if(p1.s==p2.s) return p1.w>p2.w;
    return p1.s<p2.s;
}

bool check(int z)
{
    int p = 0;
    for(int i = 0; i < a; i++)
    {
        int br = 0;
        while(br<z&&p<t&&k[p].w<=x[i])
        {
            br++;
            p++;
        }
    }
    vector<toy>pom;
    for(int i = p; i < t; i++) pom.push_back(k[i]);
    sort(pom.begin(),pom.end(),cmp2);
    p = 0;
    for(int i = 0; i < b; i++)
    {
        int br = 0;
        while(br<z&&p<pom.size()&&k[p].s<=y[i])
        {
            br++;
            p++;
        }
    }
    return p>=pom.size();
}

bool cmp1(toy p1, toy p2)
{
    if(p1.w==p2.w) return p1.s>p2.s;
    return p1.w<p2.w;
}

int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[])
{
    a = A;
    b = B;
    for(int i = 0; i < A; i++) x[i] = X[i]-1;
    for(int i = 0; i < B; i++) y[i] = Y[i]-1;
    t = T;
    for(int i = 0; i < T; i++)
    {
        k[i].w = W[i];
        k[i].s = S[i];
    }
    if(a) sort(x,x+a);
    if(b) sort(y,y+b);
    for(int i = 0; i < T; i++) if((!a||W[i]>x[a-1])&&(!b||S[i]>y[b-1])) return -1;
    sort(k,k+t,cmp1);
    int l = 1, r = t;
    int mid;
    while(l<=r)
    {
        mid = (l+r)/2;
        if(check(mid)) r = mid-1;
        else l = mid+1;
    }
    return l;
}

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

robots.cpp: In function 'bool check(int)':
robots.cpp:50:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<toy>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |         while(br<z&&p<pom.size()&&k[p].s<=y[i])
      |                     ~^~~~~~~~~~~
robots.cpp:56:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<toy>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |     return p>=pom.size();
      |            ~^~~~~~~~~~~~

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