oj.uz

Submission #536829

# Submission time Handle Problem Language Result Execution time Memory
536829 2022-03-14T05:36:32 Z wiwiho Coin Collecting (JOI19_ho_t4) C++14
100 / 100
 98 ms 10444 KB 
#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

ll ifloor(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a < 0) return (a - b + 1) / b;
    else return a / b;
}

ll iceil(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a > 0) return (a + b - 1) / b;
    else return a / b;
}

int main(){
    StarBurstStream

    int n;
    cin >> n;

    vector<vector<int>> a(n + 1, vector<int>(3));

    ll ans = 0;
    for(int i = 1; i <= 2 * n; i++){
        ll x, y;
        cin >> x >> y;
        if(x < 1) ans += 1 - x, x = 1;
        else if(x > n) ans += x - n, x = n;
        if(y < 1) ans += 1 - y, y = 1;
        else if(y > 2) ans += y - 2, y = 2;
        a[x][y]++;
    }
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= 2; j++) a[i][j]--;

    for(int x = 1; x <= n; x++){
        if(a[x][1] < 0 && a[x][2] > 0){
            int tmp = min(-a[x][1], a[x][2]);
            ans += tmp;
            a[x][1] += tmp; a[x][2] -= tmp;
        }
        if(a[x][1] > 0 && a[x][2] < 0){
            int tmp = min(a[x][1], -a[x][2]);
            ans += tmp;
            a[x][1] -= tmp; a[x][2] += tmp;
        }
        if(x == n){
            assert(a[x][1] == 0 && a[x][2] == 0);
            break;
        }
        ans += abs(a[x][1]) + abs(a[x][2]);
        a[x + 1][1] += a[x][1]; a[x][1] = 0;
        a[x + 1][2] += a[x][2]; a[x][2] = 0;
        //cerr << "test " << x << "\n";
        //for(int i = 1; i <= 2; i++){
            //for(int j = 1; j <= n; j++) cerr << a[j][i] << " ";
            //cerr << "\n";
        //}
    }

    cout << ans << "\n";

    return 0;
}

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 0 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 320 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 324 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 320 KB Output is correct
30 Correct 0 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 0 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 0 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 320 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 324 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 320 KB Output is correct
30 Correct 0 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 0 ms 212 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 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 336 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 408 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 336 KB Output is correct
43 Correct 1 ms 412 KB Output is correct
44 Correct 1 ms 336 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 340 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 332 KB Output is correct
51 Correct 1 ms 408 KB Output is correct
52 Correct 1 ms 404 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 336 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 336 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 336 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 1 ms 352 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 332 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 0 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 320 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 324 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 320 KB Output is correct
30 Correct 0 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 0 ms 212 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 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 336 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 408 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 336 KB Output is correct
43 Correct 1 ms 412 KB Output is correct
44 Correct 1 ms 336 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 340 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 332 KB Output is correct
51 Correct 1 ms 408 KB Output is correct
52 Correct 1 ms 404 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 336 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 336 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 336 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 1 ms 352 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 1 ms 340 KB Output is correct
65 Correct 41 ms 7320 KB Output is correct
66 Correct 57 ms 10444 KB Output is correct
67 Correct 58 ms 8856 KB Output is correct
68 Correct 57 ms 8864 KB Output is correct
69 Correct 75 ms 8848 KB Output is correct
70 Correct 76 ms 8880 KB Output is correct
71 Correct 79 ms 8980 KB Output is correct
72 Correct 47 ms 9108 KB Output is correct
73 Correct 44 ms 8992 KB Output is correct
74 Correct 47 ms 8992 KB Output is correct
75 Correct 64 ms 8852 KB Output is correct
76 Correct 48 ms 8988 KB Output is correct
77 Correct 48 ms 8860 KB Output is correct
78 Correct 49 ms 8908 KB Output is correct
79 Correct 45 ms 8984 KB Output is correct
80 Correct 51 ms 8984 KB Output is correct
81 Correct 63 ms 8984 KB Output is correct
82 Correct 48 ms 8908 KB Output is correct
83 Correct 55 ms 8908 KB Output is correct
84 Correct 46 ms 8908 KB Output is correct
85 Correct 44 ms 8856 KB Output is correct
86 Correct 46 ms 8976 KB Output is correct
87 Correct 53 ms 8860 KB Output is correct
88 Correct 98 ms 8860 KB Output is correct
89 Correct 79 ms 8972 KB Output is correct
90 Correct 53 ms 8852 KB Output is correct
91 Correct 56 ms 8852 KB Output is correct
92 Correct 92 ms 9104 KB Output is correct
93 Correct 90 ms 8980 KB Output is correct
94 Correct 57 ms 8864 KB Output is correct
95 Correct 56 ms 8852 KB Output is correct
96 Correct 48 ms 9040 KB Output is correct
97 Correct 54 ms 8976 KB Output is correct
98 Correct 65 ms 8984 KB Output is correct
99 Correct 52 ms 8996 KB Output is correct
100 Correct 68 ms 8980 KB Output is correct
101 Correct 48 ms 8864 KB Output is correct
102 Correct 61 ms 8980 KB Output is correct
103 Correct 68 ms 8908 KB Output is correct