oj.uz

Submission #98987

# Submission time Handle Problem Language Result Execution time Memory
98987 2019-02-27T23:18:00 Z Benq Coin Collecting (JOI19_ho_t4) C++14
100 / 100
 113 ms 8556 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define beg(x) x.begin()
#define en(x) x.end()
#define all(x) beg(x), en(x)
#define resz resize

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 100001;
const ld PI = 4*atan((ld)1);

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) { 
        re(first); re(rest...); 
    }

    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}

using namespace input;

namespace output {
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);

    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) { 
        pr(first); pr(rest...); 
    }

    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void prContain(const T& x) {
        pr("{");
        bool fst = 1; trav(a,x) pr(!fst?", ":"",a), fst = 0; 
        pr("}");
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
    
    template<class Arg> void ps(const Arg& first) { pr(first,"\n"); } // print w/ spaces
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) { 
        pr(first," "); ps(rest...); 
    }
}

using namespace output;

namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}

using namespace io;

namespace modOp {
    int ad(int a, int b, int mod = MOD) { return (a+b)%mod; }
    int sub(int a, int b, int mod = MOD) { return (a-b+mod)%mod; }
    int mul(int a, int b, int mod = MOD) { return (ll)a*b%mod; }
    
    int AD(int& a, int b, int mod = MOD) { return a = ad(a,b,mod); }
    int SUB(int& a, int b, int mod = MOD) { return a = sub(a,b,mod); }
    int MUL(int& a, int b, int mod = MOD) { return a = mul(a,b,mod); }
    
    int po (int b, int p, int mod = MOD) { return !p?1:mul(po(mul(b,b,mod),p/2,mod),p&1?b:1,mod); }
    int inv (int b, int mod = MOD) { return po(b,mod-2,mod); }
    
    int invGeneral(int a, int b) { // 0 < a < b, gcd(a,b) = 1
        if (a == 0) return b == 1 ? 0 : -1;
        int x = invGeneral(b%a,a); 
        return x == -1 ? -1 : ((1-(ll)b*x)/a+b)%b;
    }
}

using namespace modOp;

int N, lef[MX], ri[MX];
int co[2][MX][2];
ll ans;
vpi v;

int cur[2];

void process(int l, int r) {
    if (ri[l]) {
        FOR(i,l,r+1) {
            F0R(j,2) {
                cur[j] += co[1][i][j];
                co[1][i][j] = 0;
            }
            F0R(j,2) while (co[0][i][j] && cur[j]) {
                co[0][i][j] --;
                cur[j] --;
            }
            F0R(j,2) while (co[0][i][j] && cur[j^1]) {
                co[0][i][j] --;
                cur[j^1] --;
                ans ++;
            }
        }
    } else {
        FOR(i,l,r+1) {
            F0R(j,2) {
                cur[j] += co[0][i][j];
                co[0][i][j] = 0;
            }
            F0R(j,2) while (co[1][i][j] && cur[j]) {
                co[1][i][j] --;
                cur[j] --;
            }
            F0R(j,2) while (co[1][i][j] && cur[j^1]) {
                co[1][i][j] --;
                cur[j^1] --;
                ans ++;
            }
        }
    }
    if (cur[0]+cur[1] != 0) {
        ps("HUH",l,r,lef[l],ri[l],cur[0],cur[1]);
        // F0R(i,10)
    }
    // assert(cur[0]+cur[1] == 0);
    // ps("WHAT",v,l,r);
    // ps(lef[l],ri[l],cur[0],cur[1],co[1][][],);
}

void init() {
    // you should actually read the stuff at the bottom
    setIO(); re(N);
    F0R(i,2*N) {
        pi p; re(p); p.f --; p.s --;
        if (p.f < 0) {
            ans -= p.f;
            p.f = 0;
        }
        if (p.f > N-1) {
            ans += p.f-(N-1);
            p.f = N-1;
        }
        if (p.s < 0) {
            ans -= p.s;
            p.s = 0;
        }
        if (p.s > 1) {
            ans += p.s-1;
            p.s = 1;
        }
        v.pb(p);
    }
    sort(all(v));
}

int main() {
    init();
    vi a, b; F0R(i,N) a.pb(i), a.pb(i);
    trav(x,v) b.pb(x.f);
    F0R(i,N) F0R(j,2) co[0][i][j] ++;
    trav(x,v) co[1][x.f][x.s] ++;
    F0R(i,2*N) {
        if (a[i] < b[i]) lef[a[i]] ++, lef[b[i]] --;
        else ri[b[i]] ++, ri[a[i]] --;
        ans += abs(a[i]-b[i]);
    }
    FOR(i,1,N) {
        ri[i] += ri[i-1];
        lef[i] += lef[i-1];
    }
    for (int i = 0; i < N; ) {
        int I = i;
        if (lef[i]) {
            while (lef[i]) i ++;
            process(I,i); 
        } else if (ri[i]) {
            while (ri[i]) i ++;
            process(I,i); 
        } else {
            process(i,i);
            i ++;
        }
    }
    // ps(v);
    ps(ans);
    // you should actually read the stuff at the bottom
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?), set tle
    * do smth instead of nothing and stay organized
*/

Compilation message

joi2019_ho_t4.cpp: In function 'void io::setIn(std::__cxx11::string)':
joi2019_ho_t4.cpp:112:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t4.cpp: In function 'void io::setOut(std::__cxx11::string)':
joi2019_ho_t4.cpp:113:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
29.0 / 29.0

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

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 3 ms 384 KB Output is correct
35 Correct 3 ms 512 KB Output is correct
36 Correct 3 ms 384 KB Output is correct
37 Correct 2 ms 384 KB Output is correct
38 Correct 2 ms 384 KB Output is correct
39 Correct 3 ms 512 KB Output is correct
40 Correct 2 ms 384 KB Output is correct
41 Correct 3 ms 384 KB Output is correct
42 Correct 3 ms 384 KB Output is correct
43 Correct 2 ms 384 KB Output is correct
44 Correct 2 ms 384 KB Output is correct
45 Correct 3 ms 384 KB Output is correct
46 Correct 3 ms 384 KB Output is correct
47 Correct 3 ms 384 KB Output is correct
48 Correct 3 ms 384 KB Output is correct
49 Correct 4 ms 512 KB Output is correct
50 Correct 3 ms 512 KB Output is correct
51 Correct 3 ms 512 KB Output is correct
52 Correct 3 ms 512 KB Output is correct
53 Correct 3 ms 512 KB Output is correct
54 Correct 3 ms 512 KB Output is correct
55 Correct 3 ms 384 KB Output is correct
56 Correct 3 ms 512 KB Output is correct
57 Correct 2 ms 384 KB Output is correct
58 Correct 3 ms 512 KB Output is correct
59 Correct 3 ms 384 KB Output is correct
60 Correct 4 ms 384 KB Output is correct
61 Correct 3 ms 512 KB Output is correct
62 Correct 4 ms 384 KB Output is correct
63 Correct 2 ms 512 KB Output is correct
64 Correct 3 ms 384 KB Output is correct
65 Correct 61 ms 8424 KB Output is correct
66 Correct 72 ms 8452 KB Output is correct
67 Correct 77 ms 8428 KB Output is correct
68 Correct 91 ms 8472 KB Output is correct
69 Correct 81 ms 8424 KB Output is correct
70 Correct 78 ms 8424 KB Output is correct
71 Correct 87 ms 8424 KB Output is correct
72 Correct 68 ms 8304 KB Output is correct
73 Correct 65 ms 7784 KB Output is correct
74 Correct 62 ms 8424 KB Output is correct
75 Correct 71 ms 8296 KB Output is correct
76 Correct 67 ms 8296 KB Output is correct
77 Correct 65 ms 7908 KB Output is correct
78 Correct 62 ms 8304 KB Output is correct
79 Correct 65 ms 7932 KB Output is correct
80 Correct 68 ms 7832 KB Output is correct
81 Correct 67 ms 8400 KB Output is correct
82 Correct 59 ms 8168 KB Output is correct
83 Correct 63 ms 8164 KB Output is correct
84 Correct 74 ms 8368 KB Output is correct
85 Correct 62 ms 8424 KB Output is correct
86 Correct 86 ms 8476 KB Output is correct
87 Correct 66 ms 8424 KB Output is correct
88 Correct 71 ms 8444 KB Output is correct
89 Correct 69 ms 8540 KB Output is correct
90 Correct 113 ms 8528 KB Output is correct
91 Correct 73 ms 8424 KB Output is correct
92 Correct 73 ms 8496 KB Output is correct
93 Correct 73 ms 8424 KB Output is correct
94 Correct 77 ms 8556 KB Output is correct
95 Correct 72 ms 8516 KB Output is correct
96 Correct 78 ms 8292 KB Output is correct
97 Correct 71 ms 8268 KB Output is correct
98 Correct 72 ms 8424 KB Output is correct
99 Correct 83 ms 8096 KB Output is correct
100 Correct 69 ms 8300 KB Output is correct
101 Correct 78 ms 8428 KB Output is correct
102 Correct 64 ms 8436 KB Output is correct
103 Correct 99 ms 8424 KB Output is correct