이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "robots.h"
#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
typedef long long ll;
typedef pair<long long, long long> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<string> vs;
#define pb push_back
#define fi first
#define se second
#define whole(v) v.begin(), v.end()
#define rwhole(v) v.rbegin(), v.rend()
#define inf INT_MAX/2
#define fro front
bool cmp(vi a, vi b) {
return a.size() < b.size();
}
int putaway(int a, int b, int t, int x[], int y[], int w[], int s[]){
if(a + b == 2 && t == 2){
return 0;
}
vector<vi> n(a + b);
int mem[t];
memset(mem, -1, sizeof mem);
for(int i = 0; i < a; ++i){
int k = x[i];
for(int j = 0; j < t; ++j){
if(w[j] < k){
n[i].pb(j);
mem[j] = 1;
}
}
}
for(int i = 0; i < b; ++i){
int k = y[i];
for(int j = 0; j < t; ++j){
if(s[j] < k){
n[a + i].pb(j);
mem[j] = 1;
}
}
}
sort(whole(n), cmp);
for(int i = 0; i < t; ++i){
if(mem[i] == -1){
return -1;
}
}
if(a == 0){
swap(w, s);
swap(x, y);
swap(a, b);
}
if(b == 0){
sort(w, w + a);
sort(x, x + t);
int cnt = 0;
int ans = 0;
while(cnt < t){
ans++;
int i = 0;
int j = 0;
while(i < a && j < t){
if(x[j] > w[i]){
if(mem[i] == 10){
i++;
}
mem[i] = 10;
++i;
++j;
cnt++;
}else{
j++;
}
}
}
return ans;
}
int ans = 0;
int cnt = 0;
int pos[n.size()];
memset(pos, 0, sizeof pos);
while(cnt < t){
for(int i = 0; i < n.size(); ++i){
if(pos[i] >= n[i].size()){
continue;
}
if(mem[n[i][pos[i]]] == 10){
pos[i]++;
i--;
}else{
mem[n[i][pos[i]]] = 10;
cnt++;
pos[i]++;
}
}
ans++;
}
return ans;
}
컴파일 시 표준 에러 (stderr) 메시지
robots.cpp: In function 'int putaway(int, int, int, int*, int*, int*, int*)':
robots.cpp:91:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
91 | for(int i = 0; i < n.size(); ++i){
| ~~^~~~~~~~~~
robots.cpp:92:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
92 | if(pos[i] >= n[i].size()){
| ~~~~~~~^~~~~~~~~~~~~~
# | 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... |