# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1150012 | jhwest2 | Cultivation (JOI17_cultivation) | C++20 | 2095 ms | 9964 KiB |
#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9 + 10;
int main() {
cin.tie(0); ios_base::sync_with_stdio(0);
int r, c, n;
cin >> r >> c >> n;
vector<pii> V;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
V.push_back({--x, --y});
}
sort(V.begin(), V.end());
int X[n], Y[n];
for (int i = 0; i < n; i++) {
tie(X[i], Y[i]) = V[i];
}
set<int> K;
for (int i = 0; i < n; i++) {
# | 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... |