Submission #1211498

#TimeUsernameProblemLanguageResultExecution timeMemory
1211498SofiatpcRobots (IOI13_robots)C++20
0 / 100
0 ms528 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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...