Submission #1211493

#TimeUsernameProblemLanguageResultExecution timeMemory
1211493SofiatpcRobots (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); sort(w,w+t); int l = 1, r = t+1; while(l!=r){ int mid = (l+r)/2; multiset<int> st; int cur = a-1, p = 1; for(int i = t-1; i >= 0; i--){ while(cur >= 0 && x[cur] >= w[i]){ st.insert(0); cur--; } if(st.size() == 0){p = 0; break;} int e = *st.begin(); st.erase(st.begin()); if(e+1 < mid)st.insert(e+1); } if(p)r = mid; else l = mid+1; } if(l == t+1)l = -1; return l; }
#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...