# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
46519 | ikura355 | Cultivation (JOI17_cultivation) | C++14 | 204 ms | 1420 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;
#define pii pair<int,int>
#define X first
#define Y second
const int maxn = 300 + 5;
const int inf = 1e9;
int n,R,C;
pii p[maxn];
vector<int> forup, fordown;
int szx, szy;
int rec[maxn];
map<int,int> mpx, mpy;
int cnt[maxn*2][maxn];
int main() {
scanf("%d%d%d",&R,&C,&n);
for(int i=1;i<=n;i++) scanf("%d%d",&p[i].X,&p[i].Y);
//prep
sort(&p[1],&p[n+1]);
for(int i=1;i<=n;i++) mpy[p[i].Y];
for(auto &t : mpy) {
t.second = ++szy;
rec[szy] = t.first;
}
for(int i=1;i<=n;i++) {
forup.push_back(p[i].X-1);
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... |