Submission #892987

#TimeUsernameProblemLanguageResultExecution timeMemory
892987vjudge1Coin Collecting (JOI19_ho_t4)C++17
100 / 100
37 ms7936 KiB
#include "bits/stdc++.h" using namespace std; // #pragma comment(linker, "/stack:200000000") // #pragma GCC optimize("Ofast") // #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") using ll = long long; using ld = long double; #define pb push_back #define ff first #define ss second #define sz(x) (ll)(x).size() #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); } void IOIGold2024_InshAllah() { ios_base::sync_with_stdio(false); cin.tie(NULL); } ll binmul(ll a, ll b, ll c) { ll res = 0; while(b) { if(b&1) (res += a) %= c; (a += a) %= c; b >>= 1; } return res; } ll binpow(ll a, ll b, ll c) { ll res = 1; while(b) { if(b&1) (res *= a) %= c; (a *= a) %= c; b >>= 1; } return res; } template<typename T> T gcd(T a, T b) { if(b==0) return a; return gcd(b, a%b); } template<typename T> T lcm(T a, T b) { return a/gcd(a, b)*b; } mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); ld rnd() { return rng()%INT_MAX*1.0/INT_MAX; } const ll inf = 1e18+7, MX = LLONG_MAX, MN = LLONG_MIN; const ll mod = 1e9+7, N = 3e5+5; ll cnt[N][3]; void kigash() { ll n, ans = 0; cin>>n; for(ll i=1; i<=2*n; i++) { ll x, y, X = -1, Y = -1; cin>>x>>y; if(x>=1 && x<=n && y>=2) X = x, Y = 2; else if(x>=1 && x<=n && y<=1) X = x, Y = 1; else if(y>=1 && y<=2 && x>=n) X = n, Y = y; else if(y>=1 && y<=2 && x<=1) X = 1, Y = y; else if(x<1 && y<1) X = 1, Y = 1; else if(x<1 && y>2) X = 1, Y = 2; else if(x>n && y<1) X = n, Y = 1; else X = n, Y = 2; cnt[X][Y]++; ans += abs(X-x)+abs(Y-y); } ll sum1 = 0, sum2 = 0; for(ll i=1; i<=n; i++) { sum1 += cnt[i][1]-1, sum2 += cnt[i][2]-1; if(sum1<0 && sum2>0) { ll mn = min(abs(sum1), abs(sum2)); sum1 += mn, sum2 -= mn, ans += mn; } if(sum2<0 && sum1>0) { ll mn = min(abs(sum1), abs(sum2)); sum1 -= mn, sum2 += mn, ans += mn; } ans += abs(sum1)+abs(sum2); } cout<<ans<<"\n"; return; } signed main(/*Kigash Amir*/) { // freopen(""); IOIGold2024_InshAllah(); ll tt = 1; // cin>>tt; for(ll i=1; i<=tt; i++) { kigash(); } }

Compilation message (stderr)

joi2019_ho_t4.cpp: In function 'void freopen(std::string)':
joi2019_ho_t4.cpp:17:33: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 | void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
      |                          ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t4.cpp:17:73: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 | void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
      |                                                                  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...