# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
259617 | dantoh000 | Santa Claus (RMI19_santa) | C++14 | 1091 ms | 816 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int n;
int x[6000], h[6000], v[6000];
bool test(int l, int r){
multiset<int> ms;
for (int i = 0; i < l; i++){
if (h[i]){
auto it = ms.lower_bound(v[i]);
if (it != ms.end()) ms.erase(it);
}
else{
ms.insert(v[i]);
}
}
for (int i = l; i <= r; i++){
if (h[i] == 0) ms.insert(v[i]);
}
for (int i = l; i <= r; i++){
if (h[i] == 1){
auto it = ms.lower_bound(v[i]);
if (it != ms.end()) ms.erase(it);
}
}
return ms.empty();
}
int main(){
int tc;
scanf("%d",&tc);
while (tc--){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |