oj.uz

Submission #653189

# Submission time Handle Problem Language Result Execution time Memory
653189 2022-10-26T03:41:22 Z browntoad Coin Collecting (JOI19_ho_t4) C++14
100 / 100
 70 ms 9632 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define int ll
#define FOR(i,a,b) for (int i = (a); i<(b); i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define RREP(i,n) for (int i=(n)-1; i>=0; i--)
#define f first
#define s second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)(x.size())
#define SQ(x) (x)*(x)
#define pii pair<int, int>
#define pdd pair<double ,double>
#define pcc pair<char, char> 
#define endl '\n'
//#define TOAD
#ifdef TOAD
#define bug(x) cerr<<__LINE__<<": "<<#x<<" is "<<x<<endl
#define IOS()
#else
#define bug(...)
#define IOS() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#endif
 
const ll inf = 1ll<<60;
const int iinf=2147483647;
const ll mod = 1e9+7;
const ll maxn=1e5+5;
const double PI=acos(-1);
 
ll pw(ll x, ll p, ll m=mod){
    ll ret=1;
    while (p>0){
        if (p&1){
            ret*=x;
            ret%=m;
        }
        x*=x;
        x%=m;
        p>>=1;
    }
    return ret;
}
 
ll inv(ll a, ll m=mod){
    return pw(a,m-2);
}
 
//=======================================================================================
 

signed main (){
    IOS();
    int n; cin>>n;
    vector<pii> vc(2*n);
    vector<int> cnt1(n+1);
    vector<int> cnt2(n+1);
    int ans=0;
    REP(i, 2*n){
        cin>>vc[i].f>>vc[i].s;
        pii g;
        if (vc[i].s>=2){
            ans+=vc[i].s-2;
            g.s=2;
        }
        else {
            ans+=1-vc[i].s;
            g.s=1;
        }

        if (vc[i].f<=1){
            ans+=1-vc[i].f;
            g.f=1;
        }
        else if (vc[i].f>=n){
            ans+=vc[i].f-n;
            g.f=n;
        }
        else {
            g.f=vc[i].f;
        }

        if (g.s==1){
            cnt1[g.f]++;
        }
        else cnt2[g.f]++;
    }

    /*REP1(i, n){
        cout<<cnt1[i]<<' ';
    }
    cout<<endl;
    REP1(i, n){
        cout<<cnt2[i]<<' ';
    }
    cout<<endl;
    */
    
    int dx1=0, dx2=0;
    REP1(i, n){
        dx1+=cnt1[i]-1;
        dx2+=cnt2[i]-1;
        int k;
        if (dx1>=0&&dx2<=0){
            k=min(dx1, -dx2);
            ans+=k;
            dx1-=k;
            dx2+=k;
        }
        else if (dx1<=0&&dx2>=0){
            k=min(-dx1, dx2);
            ans+=k;
            dx1+=k;
            dx2-=k;
        }
        ans+=abs(dx1);
        ans+=abs(dx2);
    }
    cout<<ans<<endl;
 
}

Subtask #1
8.0 / 8.0

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

Subtask #2
29.0 / 29.0

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

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 324 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 324 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 316 KB Output is correct
28 Correct 1 ms 320 KB Output is correct
29 Correct 1 ms 324 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 324 KB Output is correct
35 Correct 1 ms 420 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 328 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 336 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 392 KB Output is correct
57 Correct 1 ms 328 KB Output is correct
58 Correct 1 ms 392 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 1 ms 336 KB Output is correct
61 Correct 1 ms 344 KB Output is correct
62 Correct 1 ms 344 KB Output is correct
63 Correct 1 ms 400 KB Output is correct
64 Correct 1 ms 340 KB Output is correct
65 Correct 41 ms 6544 KB Output is correct
66 Correct 70 ms 9632 KB Output is correct
67 Correct 50 ms 8092 KB Output is correct
68 Correct 44 ms 8120 KB Output is correct
69 Correct 39 ms 8080 KB Output is correct
70 Correct 40 ms 8084 KB Output is correct
71 Correct 49 ms 8080 KB Output is correct
72 Correct 42 ms 8204 KB Output is correct
73 Correct 52 ms 8208 KB Output is correct
74 Correct 45 ms 8216 KB Output is correct
75 Correct 40 ms 8084 KB Output is correct
76 Correct 40 ms 8212 KB Output is correct
77 Correct 41 ms 8084 KB Output is correct
78 Correct 50 ms 8140 KB Output is correct
79 Correct 40 ms 8140 KB Output is correct
80 Correct 50 ms 8220 KB Output is correct
81 Correct 42 ms 8144 KB Output is correct
82 Correct 44 ms 8208 KB Output is correct
83 Correct 41 ms 8224 KB Output is correct
84 Correct 39 ms 8268 KB Output is correct
85 Correct 39 ms 8080 KB Output is correct
86 Correct 44 ms 8084 KB Output is correct
87 Correct 41 ms 8200 KB Output is correct
88 Correct 43 ms 8080 KB Output is correct
89 Correct 44 ms 8088 KB Output is correct
90 Correct 44 ms 8072 KB Output is correct
91 Correct 43 ms 8080 KB Output is correct
92 Correct 42 ms 8212 KB Output is correct
93 Correct 43 ms 8208 KB Output is correct
94 Correct 53 ms 8076 KB Output is correct
95 Correct 42 ms 8080 KB Output is correct
96 Correct 53 ms 8216 KB Output is correct
97 Correct 42 ms 8220 KB Output is correct
98 Correct 41 ms 8216 KB Output is correct
99 Correct 40 ms 8216 KB Output is correct
100 Correct 42 ms 8212 KB Output is correct
101 Correct 52 ms 8204 KB Output is correct
102 Correct 44 ms 8200 KB Output is correct
103 Correct 41 ms 8140 KB Output is correct