# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
307223 | quocnguyen1012 | Robots (IOI13_robots) | C++14 | 1000 ms | 18724 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.
#ifndef LOCAL
#include"robots.h"
#endif // LOCAL
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ar array
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int maxn = 2e5 + 5;
vector<int> query[maxn];
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[])
{
sort(X, X + A); sort(Y, Y + B);
int n = A + B;
for(int i = 0; i < T; ++i){
int l = upper_bound(X, X + A, W[i]) - X;
int r = upper_bound(Y, Y + B, S[i]) - Y;
r = B - r - 1;
r += A;
query[l].eb(r);
# | 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... |