# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
46553 | ikura355 | Cultivation (JOI17_cultivation) | C++14 | 534 ms | 1172 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 sz;
map<int,int> mp;
vector<int> have[maxn*2];
int main() {
// freopen("try.txt","w",stdout);
scanf("%d%d%d",&R,&C,&n);
for(int i=1;i<=n;i++) scanf("%d%d",&p[i].X,&p[i].Y);
int ans = inf;
for(int i=1;i<=n;i++) forup.push_back(p[i].X-1), fordown.push_back(R-p[i].X);
sort(forup.begin(),forup.end());
sort(fordown.begin(),fordown.end());
forup.erase(unique(forup.begin(),forup.end()),forup.end());
fordown.erase(unique(fordown.begin(),fordown.end()),fordown.end());
sort(&p[1],&p[n+1]);
for(auto up : forup) {
for(auto down : fordown) {
mp.clear(); sz = 0;
for(int x=1;x<=n;x++) {
mp[max(1,p[x].X-up)];
mp[min(R,p[x].X+down)+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... |