# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
890012 | 2023-12-20T10:49:46 Z | vjudge1 | Coin Collecting (JOI19_ho_t4) | C++17 | 0 ms | 348 KB |
#include <bits/stdc++.h> using namespace std; #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> // #pragma GCC optimize("Ofast,unroll-loops,fast-math") // #pragma GCC target("popcnt") typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<ll,ll> pll; #define sz size() #define ff first #define ss second #define all(a) a.begin(),a.end() #define pb push_back const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6 const ll MOD = 998244353; // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod const int N = ll(2e5)+10; const long long inf = 2e18; const long double eps = 1e-15L; ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; } ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;} void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); } struct point { int x, y; } a[2005]; ll distance(point a, point b) { return (ll)abs(a.x - b.x) + abs(a.y - b.y); } bool comp(point a, point b) { if(a.x == b.x) return a.y < b.y; return a.x < b.x; } ll dp[2005][2005]; void Baizho() { int n; cin>>n; ll ans = 0; for(int i = 1; i <= n + n; i ++) { cin>>a[i].x>>a[i].y; } sort(a + 1, a + n + n + 1, comp); for(int i = 1; i <= n; i ++) { ans += abs(a[i * 2].x - i) + abs(a[i * 2 + 1].x - i) + min(abs(a[i * 2].y - 1) + abs(a[i * 2 + 1].y - 2), abs(a[i * 2].y - 2) + abs(a[i * 2 + 1].y - 1)); } cout<<ans; } signed main() { ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0); // precalc(); int ttt = 1; // cin>>ttt; for(int i=1; i<=ttt; i++) { Baizho(); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |