# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
883167 | 2023-12-04T17:07:53 Z | efedmrlr | Coin Collecting (JOI19_ho_t4) | C++17 | 1 ms | 348 KB |
#include <bits/stdc++.h> using namespace std; #define n_l '\n' #define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)), __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); } #define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl #define lli long long int #define MP make_pair #define pb push_back #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++) void fastio() { ios_base::sync_with_stdio(false); cin.tie(NULL); } const double EPS = 0.00001; const int INF = 1e9+500; const int N = 3e5+5; const int ALPH = 26; const int LGN = 25; const int MOD = 1e9+7; int n,m,q; vector<int> r[2]; vector<int> exs[2]; lli ans = 0; vector<int> suf[2]; inline void solve() { cin>>n; r[0].assign(n + 1, 0); r[1].assign(n + 1, 0); for(int i = 0; i<2*n; i++) { int x,y; cin>>x>>y; y--; int tarx = max(min(x, n), 1); int tary = max(min(y, 1), 0); ans += abs((lli)tarx - x) + abs((lli)tary - y); r[tary][tarx]++; } int left[2] = {0,0}; suf[0].assign(n+3, 0); suf[1].assign(n+3, 0); for(int t = 0; t<2; t++) { exs[t].pb(INF); for(int i = n; i>=1; i--) { if(r[t][i] > 1) exs[t].pb(i); suf[t][i] = suf[t][i + 1] + r[t][i]; } } for(int i = 1; i<=n; i++) { ans += left[0] + left[1]; for(int t = 0; t<2; t++) { if(r[t][i] > 1) { left[t]+= r[t][i] - 1; assert(exs[t].size() && exs[t].back() == i); exs[t].pop_back(); } } for(int t = 0; t<2; t++) { if(r[t][i] == 0) { if(left[t] > 0) { left[t]--; } else if(left[!t] > 0) { ans++; left[!t]--; } else { int same = exs[t].back(); int oth = exs[!t].back(); if(same - 1 > oth) { // take from oth r[!t][oth]--; ans += oth - i + 1ll; if(r[!t][exs[!t].back()] <= 1) exs[!t].pop_back(); } else if(same - 1 < oth) {//take from same r[t][same]--; ans += same - i; if(r[t][exs[t].back()] <= 1) exs[t].pop_back(); } else { int suml = suf[t][i] - suf[t][oth + 1]; suml += suf[!t][i] - suf[!t][oth + 1]; int sumr = suf[t][same]; sumr += suf[!t][same]; suml -= 2 * (oth - i + 1); sumr -= 2 * (n - same + 1); if(suml >= sumr) { // take from oth r[!t][oth]--; ans += oth - i + 1; if(r[!t][exs[!t].back()] <= 1) exs[!t].pop_back(); } else { //take from same r[t][same]--; ans += same - i; exs[t][exs[t].size() - 1]--; if(r[t][exs[t].back()] <= 1) exs[t].pop_back(); } } } r[t][i] = 1; suf[t][i]++; } } } cout<<ans<<"\n"; } signed main() { fastio(); int test = 1; //cin>>test; while(test--) { solve(); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 1 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 348 KB | Output is correct |
8 | Correct | 0 ms | 344 KB | Output is correct |
9 | Incorrect | 1 ms | 348 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 1 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 348 KB | Output is correct |
8 | Correct | 0 ms | 344 KB | Output is correct |
9 | Incorrect | 1 ms | 348 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 1 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 348 KB | Output is correct |
8 | Correct | 0 ms | 344 KB | Output is correct |
9 | Incorrect | 1 ms | 348 KB | Output isn't correct |
10 | Halted | 0 ms | 0 KB | - |