Submission #859717

#	Time	Username	Problem	Language	Result	Execution time	Memory
859717		green_gold_dog	Coin Collecting (JOI19_ho_t4)	C++17	100 / 100	39 ms	8396 KiB

joi2019_ho_t4

//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,abm,popcnt,mmx")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;
typedef long double ldb;
typedef complex<double> cd;

constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007;
constexpr db PI = acos(-1);
constexpr bool IS_FILE = false, IS_TEST_CASES = false;

random_device rd;
mt19937 rnd32(rd());
mt19937_64 rnd64(rd());

template<typename T>
bool assign_max(T& a, T b) {
        if (b > a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
bool assign_min(T& a, T b) {
        if (b < a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
T square(T a) {
        return a * a;
}

template<>
struct std::hash<pair<ll, ll>> {
        ll operator() (pair<ll, ll> p) const {
                return ((__int128)p.first * MOD + p.second) % INF64;
        }
};

void solve() {
        ll n;
        cin >> n;
        vector<ll> col1(n, 0), col2(n, 0);
        ll ans = 0;
        for (ll i = 0; i < n * 2; i++) {
                ll x, y;
                cin >> x >> y;
                if (x < 1) {
                        ans += 1 - x;
                        x = 1;
                }
                if (x > n) {
                        ans += x - n;
                        x = n;
                }
                x--;
                if (y >= 2) {
                        col2[x]++;
                        ans += y - 2;
                } else {
                        col1[x]++;
                        ans += 1 - y;
                }
        }
        vector<ll> pref1(1, 0), pref2(1, 0);
        for (ll i = 0; i < n; i++) {
                pref1.push_back(pref1.back() + col1[i] - 1);
                pref2.push_back(pref2.back() + col2[i] - 1);
        }
        ll add1 = 0, add2 = 0;
        for (ll i = 1; i <= n; i++) {
                pref1[i] += add1;
                pref2[i] += add2;
                while (pref1[i] > 0 && pref2[i] < 0) {
                        pref1[i]--;
                        add1--;
                        pref2[i]++;
                        add2++;
                        ans++;
                }
                while (pref1[i] < 0 && pref2[i] > 0) {
                        pref1[i]++;
                        add1++;
                        pref2[i]--;
                        add2--;
                        ans++;
                }
                ans += abs(pref1[i]) + abs(pref2[i]);
        }
        cout << ans << '\n';
}

int main() {
        if (IS_FILE) {
                freopen("", "r", stdin);
                freopen("", "w", stdout);
        }
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);
        ll t = 1;
        if (IS_TEST_CASES) {
                cin >> t;
        }
        for (ll i = 0; i < t; i++) {
                solve();
        }
}

Compilation message (stderr)

joi2019_ho_t4.cpp: In function 'int main()':
joi2019_ho_t4.cpp:105:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  105 |                 freopen("", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~
joi2019_ho_t4.cpp:106:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  106 |                 freopen("", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~

• Subtask 1: 8 / 8
• Subtask 2: 29 / 29
• Subtask 3: 63 / 63