Submission #385139

#	Time	Username	Problem	Language	Result	Execution time	Memory
385139		ACmachine	Cultivation (JOI17_cultivation)	C++17	0 / 100	2083 ms	364 KiB

cultivation

#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)

const double EPS = 1e-9;
const int MOD = 1e9+7;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

void DBG(){cout << "]" << endl;}
template<typename T, typename ...U> void DBG(const T& head, const U... args){ cout << head << "; "; DBG(args...); }
#define dbg(...) cout << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__);
#define chk() cout << "Check at line(" << __LINE__ << ") hit." << endl;

template<class T, unsigned int U>
ostream& operator<<(ostream& out, const array<T, U> &v){out << "[";  REP(i, U) out << v[i] << ", ";  out << "]"; return out;}
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}

template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }

int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
 	auto solve_small_r = [](){
        int r, c;
        cin >> r >> c;
        int n; cin >> n;
        vector<array<int, 2>> cells(n);
        REP(i, n){
            cin >> cells[i][0] >> cells[i][1];
        }
        vector<int> pos_cols;
        REP(i, n){
            pos_cols.pb(cells[i][1]);
        }
        sort(all(pos_cols));
        pos_cols.erase(unique(all(pos_cols)), pos_cols.end());
        vector<vector<int>> comp_cols(pos_cols.size());
        int id = 0;
        for(int cc : pos_cols){
            REP(i, n){
                if(cells[i][1] == cc)
                    comp_cols[id].pb(cells[i][0]);
            }
            sort(all(comp_cols[id]));
            ++id;
        }
        ll ans = INFF + 5;
        auto solve_rows = [&](vector<int> &cols) -> ll{
            int left = cols[0] - 1;
            int right = c - cols.back();
            int res = 0;
            REP(i, (int)cols.size() -1){
                int diff = cols[i + 1] - cols[i];
                diff = diff - 1 - left - right;
                res = max(res, diff);
            }
            return res + left + right;
        };
        vector<int> cols;
        auto get_cols = [&](int up, int down){
            cols.clear();
            int id = 0;
            for(auto &v : comp_cols){
                int prv = 1;
                bool can = true;
                REP(j, v.size()){
                    int beg = v[j] - up;
                    if(beg > prv)
                        can = false;
                    prv = v[j] + down + 1;
                }
                if(prv < n + 1)
                    can = false;
                if(can)
                    cols.pb(pos_cols[id]);
                id++;
            }
        };
        REP(i, r){
            REP(j, r){
                get_cols(i, j);
                if(cols.size() == 0)
                    continue;
                ans = min(ans, i + j + solve_rows(cols));
            }
        }
        cout << ans << "\n";
 	};
 	solve_small_r();
    return 0;
}

Compilation message (stderr)

cultivation.cpp: In lambda function:
cultivation.cpp:19:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
cultivation.cpp:21:18: note: in expansion of macro 'FOR'
   21 | #define REP(i,b) FOR(i,0,b,1)
      |                  ^~~
cultivation.cpp:103:17: note: in expansion of macro 'REP'
  103 |                 REP(j, v.size()){
      |                 ^~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 30
• Subtask 5: 0 / 20
• Subtask 6: 0 / 20