oj.uz

Submission #496833

# Submission time Handle Problem Language Result Execution time Memory
496833 2021-12-22T05:05:07 Z xynex Coin Collecting (JOI19_ho_t4) C++17
100 / 100
 59 ms 7296 KB 
/*
* 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);
    pr<int, int> add;
    for(int i = 1; i <= n; ++i) {
        cnt[i][1] += add.ff - 1, cnt[i][2] += add.ss - 1;
        for(int j = 1; j <= 2; ++j) {
            if(cnt[i][j] < 0 && cnt[i][3 - j] > 0) {
                ll mn = min(-cnt[i][j], cnt[i][3 - j]);
                ans += mn;
                cnt[i][j] += mn;
                cnt[i][3 - j] -= mn;
            }
        }
        add = {cnt[i][1], cnt[i][2]};
        for(int j = 1; j <= 2; ++j) ans += abs(cnt[i][j]);
    }
    print(ans);
}

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

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

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 0 ms 316 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 316 KB Output is correct
18 Correct 0 ms 320 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 208 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 324 KB Output is correct
27 Correct 0 ms 208 KB Output is correct
28 Correct 0 ms 324 KB Output is correct
29 Correct 0 ms 208 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 208 KB Output is correct

Subtask #2
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 0 ms 316 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 316 KB Output is correct
18 Correct 0 ms 320 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 208 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 324 KB Output is correct
27 Correct 0 ms 208 KB Output is correct
28 Correct 0 ms 324 KB Output is correct
29 Correct 0 ms 208 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 1 ms 324 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 380 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 328 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 328 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 1 ms 336 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 1 ms 332 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 1 ms 332 KB Output is correct
61 Correct 1 ms 332 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 1 ms 332 KB Output is correct

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 0 ms 316 KB Output is correct
9 Correct 1 ms 316 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 316 KB Output is correct
18 Correct 0 ms 320 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 208 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 324 KB Output is correct
27 Correct 0 ms 208 KB Output is correct
28 Correct 0 ms 324 KB Output is correct
29 Correct 0 ms 208 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 1 ms 208 KB Output is correct
34 Correct 1 ms 324 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 380 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 328 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 328 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 1 ms 336 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 1 ms 332 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 1 ms 332 KB Output is correct
61 Correct 1 ms 332 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 1 ms 332 KB Output is correct
65 Correct 26 ms 4176 KB Output is correct
66 Correct 55 ms 7296 KB Output is correct
67 Correct 59 ms 5836 KB Output is correct
68 Correct 46 ms 5840 KB Output is correct
69 Correct 59 ms 5836 KB Output is correct
70 Correct 48 ms 5836 KB Output is correct
71 Correct 47 ms 5836 KB Output is correct
72 Correct 37 ms 5804 KB Output is correct
73 Correct 38 ms 5796 KB Output is correct
74 Correct 41 ms 5796 KB Output is correct
75 Correct 41 ms 5700 KB Output is correct
76 Correct 38 ms 5816 KB Output is correct
77 Correct 38 ms 5700 KB Output is correct
78 Correct 42 ms 5820 KB Output is correct
79 Correct 39 ms 5808 KB Output is correct
80 Correct 37 ms 5824 KB Output is correct
81 Correct 40 ms 5816 KB Output is correct
82 Correct 40 ms 5828 KB Output is correct
83 Correct 41 ms 5832 KB Output is correct
84 Correct 37 ms 5792 KB Output is correct
85 Correct 39 ms 5788 KB Output is correct
86 Correct 40 ms 5828 KB Output is correct
87 Correct 44 ms 5756 KB Output is correct
88 Correct 57 ms 5856 KB Output is correct
89 Correct 43 ms 5724 KB Output is correct
90 Correct 44 ms 5712 KB Output is correct
91 Correct 50 ms 5844 KB Output is correct
92 Correct 38 ms 5836 KB Output is correct
93 Correct 41 ms 5828 KB Output is correct
94 Correct 45 ms 5716 KB Output is correct
95 Correct 50 ms 5724 KB Output is correct
96 Correct 43 ms 5828 KB Output is correct
97 Correct 43 ms 5880 KB Output is correct
98 Correct 40 ms 5828 KB Output is correct
99 Correct 43 ms 5828 KB Output is correct
100 Correct 43 ms 5820 KB Output is correct
101 Correct 46 ms 5748 KB Output is correct
102 Correct 42 ms 5804 KB Output is correct
103 Correct 43 ms 5824 KB Output is correct