이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "robots.h"
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int>> toy;
vector<int> w, s;
multiset<int> in;
bool pos(int t){
in.clear();
int now = 0;
for(int i = 0; i < w.size(); i++){
while(now < toy.size() && toy[now].first <= w[i]){
in.insert(toy[now].second);
now++;
}
for(int j = 0; j < t; j++){
if(in.empty()) break;
in.erase(--in.end());
}
}
for(int i = 0; i < s.size(); i++){
for(int j = 0; j < t; j++){
if(in.empty()) return 1;
if(*in.begin() > s[i]) break;
in.erase(in.begin());
}
}
if(in.empty()) return 1;
return 0;
}
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
for(int i = 0; i < T; i++)
toy.push_back({W[i], S[i]});
for(int i = 0; i < A; i++)
w.push_back(X[i]);
for(int i = 0; i < B; i++)
s.push_back(Y[i]);
sort(toy.begin(), toy.end());
sort(w.begin(), w.end());
sort(s.begin(), s.end());
int l = 0, r = 1000001;
int m;
while(l != r){
m = (l + r) >> 1;
if(pos(m)) r = m;
else l = m + 1;
}
if(r == 1000001) return -1;
return r;
}
컴파일 시 표준 에러 (stderr) 메시지
robots.cpp: In function 'bool pos(int)':
robots.cpp:13:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < w.size(); i++){
~~^~~~~~~~~~
robots.cpp:14:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while(now < toy.size() && toy[now].first <= w[i]){
~~~~^~~~~~~~~~~~
robots.cpp:25:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < s.size(); i++){
~~^~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |