Submission #532144

#TimeUsernameProblemLanguageResultExecution timeMemory
532144abc864197532Coin Collecting (JOI19_ho_t4)C++17
100 / 100
86 ms10368 KiB
#include <bits/stdc++.h> using namespace std; #define lli long long int #define mp make_pair #define eb emplace_back #define pb push_back #define pii pair<int,int> #define X first #define Y second #define all(x) x.begin(), x.end() void abc() {cout << endl;} template <typename T, typename ...U> void abc(T i, U ...j) { cout << i << ' ', abc(j...); } template <typename T> void printv(T l, T r) { for (; l != r; ++l) cout << *l << " \n"[l + 1 == r]; } #ifdef Doludu #define test(x...) abc("[" + string(#x) + "]", x) #define owo freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout) #else #define test(x...) void(0) #define owo ios::sync_with_stdio(false), cin.tie(0) #endif int main () { owo; int n; cin >> n; vector <vector <int>> cnt(n, vector <int> (2, -1)); lli ans = 0; for (int i = 0, x, y; i < n * 2; ++i) { cin >> x >> y, --x, --y; if (x < 0) { if (y <= 0) ans += -x - y, cnt[0][0]++; else ans += -x + y - 1, cnt[0][1]++; } else if (x >= n) { if (y <= 0) ans += x - n + 1 - y, cnt[n - 1][0]++; else ans += x - n + 1 + y - 1, cnt[n - 1][1]++; } else { if (y <= 0) ans += -y, cnt[x][0]++; else ans += y - 1, cnt[x][1]++; } } int now0 = 0, now1 = 0; for (int i = 0; i < n; ++i) { now0 += cnt[i][0], now1 += cnt[i][1]; if (now0 < 0 && now1 > 0) { int mn = min(-now0, now1); now0 += mn, now1 -= mn, ans += mn; } else if (now0 > 0 && now1 < 0) { int mn = min(now0, -now1); now0 -= mn, now1 += mn, ans += mn; } ans += abs(now0) + abs(now1); } cout << ans << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...