| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1211498 | Sofiatpc | 로봇 (IOI13_robots) | C++20 | 0 ms | 528 KiB |
#include "robots.h"
#include <bits/stdc++.h>
using namespace std;
int putaway(int a, int b, int t, int x[], int y[], int w[], int s[]) {
sort(x,x+a);
multiset<int> st;
for(int i = 0; i < t; i++)st.insert(w[i]);
if(*prev(st.end()) > x[a-1])return -1;
int qtd = 0;
while(st.size() > 0){
qtd++;
for(int i = a-1; i >= 0; i--){
auto it = st.upper_bound(x[i]);
if(it != st.begin()){
it--;
st.erase(it);
}
}
}
return qtd;
}
| # | 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... | ||||
