Submission #497072

#	Time	Username	Problem	Language	Result	Execution time	Memory
497072		xynex	Coin Collecting (JOI19_ho_t4)	C++17	0 / 100	1 ms	204 KiB

joi2019_ho_t4

/*
* Author: xynex
* Created: 22.12.2021 09:52
* Why am I so stupid? :c
* Slishkom slab
*/
 
#include <bits/stdc++.h>
 
// #pragma GCC optimize("inline")
// #pragma GCC optimize("-fgcse,-fgcse-lm")
// #pragma GCC optimize("-ftree-pre,-ftree-vrp")
// #pragma GCC optimize("-ffast-math")
// #pragma GCC optimize("-fipa-sra")
// #pragma GCC optimize("-fpeephole2")
// #pragma GCC optimize("-fsched-spec")
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("unroll-loops")
 
using namespace std;
 
#define ll long long
#define dl double long
#define ull unsigned long long
#define pr pair
#define vt vector
#define ff first
#define ss second
#define mp make_pair
#define sz(a) (int)a.size()
#define pb push_back
#define pf push_front
#define popB pop_back
#define popF pop_front
#define bit_count __builtin_popcount
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sp(x) fixed << setprecision(x)
 
template<typename T> T get_rand(T l, T r) {
    random_device rd;
    mt19937 gen(rd());
    return uniform_int_distribution<T>(l, r)(gen);
}
 
template<typename T> T lcm(T a, T b) { return a * (b / __gcd(a, b)); }
 
template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(array<A, S>& a);
template<class T> void read(T& x) { cin >> x; }
void read(double& d) { string t; read(t); d = stod(t); }
void read(long double& d) { string t; read(t); d = stold(t); }
template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); }
template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); }
template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); }
 
string to_string(char c) { return string(1, c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; }
template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; }
template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; }
 
template<class A> void write(A x) { cout << to_string(x); }
template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); }
 
void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); }
 
void freop(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
 
const int MOD = 1e9 + 7;
const int N = 3e6 + 5;
const ll INF = 9e18;
const int M = 3e3 + 5;
const dl pi = acos(-1);
const dl eps = 1e-12;
const int sq = 700;
 
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
/* ll vs int*/
 
void precalc() {
 
}
 
struct point {
    int x, y;
} a[N];
ll cnt[N][3], cnt1[N][3];
void solve() {
    int n; read(n);
    ll ans = 0;
    for(int i = 1; i <= 2 * n; ++i) {
        int x, y; read(x, y);
        if(y > 2) ans += y - 2, y = 2;
        if(y < 1) ans += 1 - y, y = 1;
        if(x > n) ans += x - n, x = n;
        if(x < 1) ans += 1 - x, x = 1;
        cnt[x][y]++;
    }
  //  print(ans);
    ll ans1 = ans;
    set<int> al, a1;
    for(int i = 1; i <= n; ++i) {
        for(int j = 1; j <= 2; ++j) {
            if(cnt[i][j]) al.insert(i), a1.insert(i);
            cnt1[i][j] = cnt[i][j];
        }
    }
   // print(ans);
    for(int i = 1; i <= n; ++i) {
        for(int j = 1; j <= 2; ++j) {
            auto beg = *al.begin();
            if(cnt[beg][j]) {
                cnt[beg][j]--;
                if(!cnt[beg][j]) {
                    if(!cnt[beg][3 - j]) al.erase(beg);
                }
                ans += abs(i - beg);
            }
            else {
                cnt[beg][3 - j]--;
                if(!cnt[beg][3 - j]) al.erase(beg);
                ans += abs(i - beg) + 1;
            }
        }
    }
    for(int i = 1; i <= n; ++i) {
        for(int j = 1; j <= 2; ++j) {
            auto en = *a1.end();
            en--;
            if(cnt1[en][j]) {
                cnt1[en][j]--;
                if(!cnt1[en][j]) {
                    if(!cnt1[en][3 - j]) a1.erase(en);
                }
                ans1 += abs(i - en);
            }
            else {
                cnt1[en][3 - j]--;
                if(!cnt1[en][3 - j]) a1.erase(en);
                ans1 += abs(i - en) + 1;
            }
        }
    }
    print(min(ans, ans1));
}
 
int main() {
    //freop("");
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    //read(t);
    precalc();
    for (int i = 1; i <= t; ++i) {
        //write("Case #" + to_string(i) + ": ");
        solve();
    }
    return 0;
}

Compilation message (stderr)

joi2019_ho_t4.cpp: In function 'void freop(std::string)':
joi2019_ho_t4.cpp:73:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t4.cpp:74:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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