# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
213256 | iefnah06 | Harvest (JOI20_harvest) | C++11 | 844 ms | 141644 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
#define DEBUG
#endif
#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;
namespace __gnu_pbds {
template <typename K, typename V=null_type>
using order_statistic_tree = tree<K, V, less<K>, rb_tree_tag, tree_order_statistics_node_update>;
}
using __gnu_pbds::order_statistic_tree;
using ll = long long;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int N, M, L, C; cin >> N >> M >> L >> C;
auto Xtrans = [&](int x) -> int {
return L-1-x;
};
vector<int> A(N);
for (int& x : A) {
cin >> x;
x = Xtrans(x);
}
reverse(A.begin(), A.end());
vector<int> B(M);
for (int& x : B) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |