# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1109175 | juliany2 | Cultivation (JOI17_cultivation) | C++17 | 1 ms | 504 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;
using ll = long long;
#define all(x) (x).begin(), (x).end()
const int N = 307;
int n, m;
int k;
array<int, 2> a[N];
vector<int> b[N];
array<int, 3> c[N];
int main() {
cin.tie(0)->sync_with_stdio(false);
cin >> n >> m >> k;
vector<int> v;
for (int i = 1; i <= k; i++) {
cin >> a[i][0] >> a[i][1];
v.push_back(a[i][0]);
}
sort(all(v));
v.erase(unique(all(v)), v.end());
int l = v.size();
auto get = [&](int x) {
return lower_bound(all(v), x) - v.begin();
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |