Submission #1237783

#TimeUsernameProblemLanguageResultExecution timeMemory
1237783GeforgsCoin Collecting (JOI19_ho_t4)C++20
100 / 100
35 ms5704 KiB
#include <iostream> #include <iomanip> #include <vector> #include <cmath> #include <algorithm> #include <set> #include <queue> #include <map> #include <unordered_map> #include <stack> #include <bitset> #include <string> #include <cstring> #include <iterator> #include <random> #define ll long long #define ld long double #define inf (ll)(2*1e18) #define sort(a) sort(a.begin(), a.end()) #define reverse(a) reverse(a.begin(), a.end()) #define pb push_back #define endl "\n" using namespace std; void solve(){ ll n, i, res=0, x, y, u=0, v=0, t; cin>>n; vector<vector<ll>> a(n+1, vector<ll>(3)); for(i=0;i<2*n;++i){ cin>>x>>y; if(y >= 2){ res += y - 2; y = 2; if(x < 1){ res += 1 - x; x = 1; }else if(x > n){ res += x - n; x = n; } }else{ res += 1 - y; y = 1; if(x < 1){ res += 1 - x; x = 1; }else if(x > n){ res += x - n; x = n; } } ++a[x][y]; } for(i=1;i<=n;++i){ u += a[i][1] - 1; v += a[i][2] - 1; if(u > 0 and v < 0){ t = min(u, -v); res += t; u -= t; v += t; }else if(u < 0 and v > 0){ t = min(-u, v); res += t; u += t; v -= t; } res += abs(u); res += abs(v); } cout<<res<<endl; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); srand(time(nullptr)); ll t=1; // cin>>t; for(;t>0;--t){ solve(); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...