結果

問題 No.2315 Flying Camera
ユーザー yuusaanyuusaan
提出日時 2024-06-30 20:16:31
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 4,533 bytes
コンパイル時間 5,630 ms
コンパイル使用メモリ 321,096 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-30 20:16:45
合計ジャッジ時間 6,569 ms
ジャッジサーバーID
(参考情報)
judge3 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 24
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <iostream>
#include <string>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <tuple>
#include <map>
#include<set>
#include<queue>
#include<stack>
#include <unordered_set>
#include<thread>
#include<bits/stdc++.h>
#include <atcoder/all>
#include <cstdio>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//if(a < 0 || h <= a || b < 0 || w <= b)return;
// string abc = "abcdefghijklmnopqrstuvwxyz";
// string abc = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
//using mint = modint998244353;
using mint = modint1000000007;
template<typename T> using pq = priority_queue<T>;//?()
template<typename T> using pqg = priority_queue<T, vector<T>, greater<T>>;//?()
template<typename T> using vector2 = vector<vector<T>>;
template<typename T> using vector3 = vector<vector<vector<T>>>;
template<typename T> using vector4 = vector<vector<vector<vector<T>>>>;
template<typename T> using vector5 = vector<vector<vector<vector<vector<T>>>>>;
template<typename T> using vector6 = vector<vector<vector<vector<vector<vector<T>>>>>>;
template<typename T> using pairs = pair<T,T>;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define rep1(i,n) for(int i = 1;i <= int(n);i++)
#define repm(i, m, n) for (int i = (m); (i) < int(n);(i)++)
#define repmr(i, m, n) for (int i = (m) - 1; (i) >= int(n);(i)--)
#define rep0(i,n) for(int i = n - 1;i >= 0;i--)
#define rep01(i,n) for(int i = n;i >= 1;i--)
//
ll GCD(ll a,ll b){
if(b == 0)return a;
return GCD(b, a % b);
}
//(ax + by = GCD(a,b))x,y
pair<long long, long long> extgcd(long long a, long long b) {
if (b == 0) return make_pair(1, 0);
long long x, y;
tie(y, x) = extgcd(b, a % b);
y -= a / b * x;
return make_pair(x, y);
}
struct UnionFind {
vector<int> par; // par[i]:i () par[3] = 2 : 32
UnionFind(int N) : par(N) { //
for(int i = 0; i < N; i++) par[i] = i;
}
int root(int x) { // xroot(x) = {x}
if (par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) { // xy
int rx = root(x); //xrx
int ry = root(y); //yry
if (rx == ry) return; //xy(=)
par[rx] = ry; //xy(=)xrxyry
}
bool same(int x, int y) { // 2x, ytrue
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
ll n;
//
vector<ll> Ccomp(vector<ll> a){
vector<ll> b = a;
sort(b.begin(),b.end());
b.erase(unique(b.begin(),b.end()),b.end());//
vector<ll> rtn;
rep(j,a.size()){
ll pb = lower_bound(b.begin(),b.end(),a[j]) - b.begin();
rtn.push_back(pb);
}
return rtn;
}
/// ////////////////////////////////////////////
using F = ll;
using S = ll;
string s;
ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1;
    } return ret; }
void cincout(){
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
cout<< fixed << setprecision(15);
}
//seg,seg-----
S op(S a,S b){return max(a,b);}//()
S e(){return 0;}//()
S mapping (F a,S b){return a + b;}//
F composition (F a,F b){return a + b;}//
F id(){return 0;}//
vector<int> Op(vector<int> a,vector<int> b){a.insert(a.end(),b.begin(),b.end()); return a;}
vector<int> E(){return vector<int> (0);}
//seg
ll INF = ll(2e18);
int main() {
cincout();
cin >> n;
vector<int> x(n),y(n);
rep(j,n)cin >> x[j] >> y[j];
sort(x.begin(),x.end());
sort(y.begin(),y.end());
ll ans = 0;
int tx = x[n / 2],ty = y[n / 2];
rep(j,n){
ans += abs(tx - x[j]) + abs(ty - y[j]);
}
cout << ans << endl;
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0