oj.uz

답안 #385145

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
385145 2021-04-03T11:01:40 Z ACmachine Cultivation (JOI17_cultivation) C++17
30 / 100
 146 ms 620 KB 
#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];
        }
        auto comp = [](array<int, 2> lhs, array<int, 2> rhs){
            return tie(lhs[1], lhs[0]) < tie(rhs[1], rhs[0]);
        };
        sort(all(cells), comp);
        ll ans = INFF + 5;
        auto solve_row = [&](vector<int> &cols, int left, int right) -> ll{
            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;
        };
        vector<vector<int>> cols(r + 1);
        auto go = [&](int up, int down) -> ll{
            REP(i, r + 1)
                cols[i].clear();
            REP(i, n){
                int lo = max(1, cells[i][0] - up); int hi = min(cells[i][0] + down + 1, r + 1);
                FOR(j, lo, hi, 1){
                    cols[j].pb(cells[i][1]);
                }
            }
            ll res = 0;
            int left = 0;
            int right = 0;
            FOR(j, 1, r + 1, 1){
                if(cols[j].empty()) return INFF + 5;
                left = max(left, cols[j][0] - 1);
                right = max(right, c - cols[j].back());
            }
            FOR(j, 1, r + 1, 1){
                res = max(res, solve_row(cols[j], left, right));
            }
            ll ans = res + up + down + left + right;
            return ans;
        };
        REP(i, r){
            REP(j, r){
                ans = min(ans, go(i, j));
            }
        }
        cout << ans << "\n";
 	};
 	solve_small_r();
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 2 ms 364 KB Output is correct
18 Correct 9 ms 364 KB Output is correct
19 Correct 11 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 24 ms 364 KB Output is correct
22 Correct 55 ms 432 KB Output is correct
23 Correct 14 ms 364 KB Output is correct
24 Correct 90 ms 492 KB Output is correct
25 Correct 69 ms 364 KB Output is correct
26 Correct 139 ms 492 KB Output is correct
27 Correct 134 ms 492 KB Output is correct
28 Correct 84 ms 460 KB Output is correct
29 Correct 118 ms 620 KB Output is correct
30 Correct 134 ms 504 KB Output is correct
31 Correct 138 ms 492 KB Output is correct
32 Correct 137 ms 492 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 2 ms 364 KB Output is correct
18 Correct 9 ms 364 KB Output is correct
19 Correct 11 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 24 ms 364 KB Output is correct
22 Correct 55 ms 432 KB Output is correct
23 Correct 14 ms 364 KB Output is correct
24 Correct 90 ms 492 KB Output is correct
25 Correct 69 ms 364 KB Output is correct
26 Correct 139 ms 492 KB Output is correct
27 Correct 134 ms 492 KB Output is correct
28 Correct 84 ms 460 KB Output is correct
29 Correct 118 ms 620 KB Output is correct
30 Correct 134 ms 504 KB Output is correct
31 Correct 138 ms 492 KB Output is correct
32 Correct 137 ms 492 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 135 ms 484 KB Output is correct
35 Correct 134 ms 492 KB Output is correct
36 Correct 135 ms 492 KB Output is correct
37 Correct 92 ms 492 KB Output is correct
38 Correct 136 ms 492 KB Output is correct
39 Correct 133 ms 492 KB Output is correct
40 Correct 146 ms 492 KB Output is correct
41 Correct 107 ms 492 KB Output is correct
42 Correct 116 ms 492 KB Output is correct
43 Correct 127 ms 512 KB Output is correct
44 Correct 136 ms 492 KB Output is correct

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 620 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 620 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 2 ms 364 KB Output is correct
18 Correct 9 ms 364 KB Output is correct
19 Correct 11 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 24 ms 364 KB Output is correct
22 Correct 55 ms 432 KB Output is correct
23 Correct 14 ms 364 KB Output is correct
24 Correct 90 ms 492 KB Output is correct
25 Correct 69 ms 364 KB Output is correct
26 Correct 139 ms 492 KB Output is correct
27 Correct 134 ms 492 KB Output is correct
28 Correct 84 ms 460 KB Output is correct
29 Correct 118 ms 620 KB Output is correct
30 Correct 134 ms 504 KB Output is correct
31 Correct 138 ms 492 KB Output is correct
32 Correct 137 ms 492 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 135 ms 484 KB Output is correct
35 Correct 134 ms 492 KB Output is correct
36 Correct 135 ms 492 KB Output is correct
37 Correct 92 ms 492 KB Output is correct
38 Correct 136 ms 492 KB Output is correct
39 Correct 133 ms 492 KB Output is correct
40 Correct 146 ms 492 KB Output is correct
41 Correct 107 ms 492 KB Output is correct
42 Correct 116 ms 492 KB Output is correct
43 Correct 127 ms 512 KB Output is correct
44 Correct 136 ms 492 KB Output is correct
45 Runtime error 3 ms 620 KB Execution killed with signal 6
46 Halted 0 ms 0 KB -