oj.uz

답안 #334939

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
334939 2020-12-10T11:47:10 Z HoneyBadger Coin Collecting (JOI19_ho_t4) C++17
0 / 100
 20 ms 31980 KB 
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <bitset>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#include <algorithm>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <ctime>
#include <chrono>


/*
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,tune=native")
*/


#ifdef LOCAL
    #define dbg(x) cout << #x << " : " << x << endl;
#else
    #define dbg(x)
#endif

#define int long long
#define pb push_back
#define ppb pop_back()
#define mp make_pair
#define fi(a, b) for (int i = a; i < b; i++)
#define fj(a, b) for (int j = a; j < b; j++)
#define fk(a, b) for (int k = a; k < b; k++)
#define fi1(a, b) for (int i = a - 1; i >= b; i--)
#define fj1(a, b) for (int j = a - 1; j >= b; j--)
#define fk1(a, b) for (int k = a - 1; k >= b; k--)
#define fx(x, a) for (auto& x : a)
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define rep1(i, a, b) for (int i = a - 1; i >= b; --i)
#define siz(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

using namespace std;

template<typename T1, typename T2>inline void mine(T1 &x, const T2 &y) { if (y < x) x = y; }
template<typename T1, typename T2>inline void maxe(T1 &x, const T2 &y) { if (x < y) x = y; }

ostream& operator << (ostream &out, const vector<int> &b) {
    for (auto k : b) out << k << ' ';
    return out;
}

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef char ch;
typedef string str;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<ch> vch;
typedef vector<vch> vvch;
typedef vector<str> vs;



const int MOD = 1000000007;
const int INF = 1000000050;
const long long BIG = (long long)2e18 + 50;
const int MX = 2010;
const double EPS = 1e-9;


mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int a[MX][2];
int dp[MX][MX];
int ps[MX][2];
vi pos[2];

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin >> n;
    int ans  = 0;
    for (int it = 0; it < 2 * n; ++it) {
    	int x, y;
    	cin >> x >> y;
    	ans += max(0ll, 1 - x);
    	maxe(x, 1);
    	ans += max(0ll, x - n);
    	mine(x, n);
    	ans += max(0ll, 1 - y);
    	maxe(y, 1);
    	ans += max(0ll, y - 2);
    	mine(y, 2);
    	++a[x - 1][y - 1];
    }
    /*dbg(ans);
    fi(0, 2) {
        fj(0, n) {
            cout << a[j][i] << ' ';
        }
        cout << '\n';
    }*/
    fi(0, n) {
        fj(0, 2) {
            ps[i][j] = a[i][j] + (i ? ps[i - 1][j] : 0);
            while(a[i][j]--)
                pos[j].pb(i);
        }
    }

    int s0 = siz(pos[0]);
    int s1 = siz(pos[1]);
   	ans += abs(s0 - s1) / 2;
    fi(0, MX) fj(0, MX) dp[i][j] = INF;
    dp[0][0] = 0;
    fi(0, n) {
        for (int was = 0; was <= 2 * i; ++was) {
            int was1 = 2 * i - was;
            for (int up = 0; up <= 2 && was + up <= s0; ++up) {
                int down = 2 - up;
                int cnt = was + up;
                int cnt1 = was1 + down;
                if (cnt1 > s1) continue;
                int w = 0;
                if (ps[i][0] >= cnt)
                    w += ps[i][0] - cnt;
                else {
                    for (int it = was; it < cnt; ++it) {
                        w += max(0ll, pos[0][it] - i); 
                    }
                }
                if (ps[i][1] >= cnt1)
                    w += ps[i][1] - cnt1;
                else {
                    for (int it = 2 * i - was; it < cnt1; ++it) {
                        w += max(0ll, pos[1][it] - i);
                    }
                }
                mine(dp[i + 1][cnt], dp[i][was] + w);
            }
        }
    }
    ans += dp[n][s0];
   	cout << ans << '\n';
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 31980 KB Output is correct
2 Correct 19 ms 31980 KB Output is correct
3 Correct 20 ms 31980 KB Output is correct
4 Correct 20 ms 31980 KB Output is correct
5 Correct 19 ms 31980 KB Output is correct
6 Incorrect 19 ms 31980 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 31980 KB Output is correct
2 Correct 19 ms 31980 KB Output is correct
3 Correct 20 ms 31980 KB Output is correct
4 Correct 20 ms 31980 KB Output is correct
5 Correct 19 ms 31980 KB Output is correct
6 Incorrect 19 ms 31980 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 31980 KB Output is correct
2 Correct 19 ms 31980 KB Output is correct
3 Correct 20 ms 31980 KB Output is correct
4 Correct 20 ms 31980 KB Output is correct
5 Correct 19 ms 31980 KB Output is correct
6 Incorrect 19 ms 31980 KB Output isn't correct
7 Halted 0 ms 0 KB -