제출 #409256

#제출 시각아이디문제언어결과실행 시간메모리
409256Belgutei로봇 (IOI13_robots)C++17
14 / 100
647 ms38888 KiB
#include "robots.h" #include<bits/stdc++.h> using namespace std; #define ll long long multiset<ll> s,s1; multiset<ll> :: iterator it; ll ans; int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) { if(B==0){ for(int i=0; i<T; i++){ s.insert(W[i]); } sort(X,X+A); while(s.size()>0){ ans++; bool ok=0; for(int i=A-1; i>=0; i--){ it=s.lower_bound(X[i]); if(it==s.begin()) continue; ok=1; it--; s.erase(it); } if(ok==0) return -1; } } return ans; }
#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...