Submission #43252393


Source Code Expand

// clang-format off
#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif

#define _overload3(_1,_2,_3,name,...) name
#define _REP(i,n) REPI(i,0,n)
#define REPI(i,a,b) for(int i=int(a);i<int(b);++i)
#define REP(...) _overload3(__VA_ARGS__,REPI,_REP,)(__VA_ARGS__)
#define _RREP(i,n) RREPI(i,n,0)
#define RREPI(i,a,b) for(int i=int(a);i>=int(b);--i)
#define RREP(...) _overload3(__VA_ARGS__,RREPI,_RREP,)(__VA_ARGS__)
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
typedef long long ll;
const int INF32 = 1001001001;
const long long INF64 = 1001001001001001001;
struct Init { Init() { ios::sync_with_stdio(0); cin.tie(0); }} init;
template<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }
template<class T, class... Ts> void output(const T& a, const Ts&... b) { cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T> void output(vector<T> v) { for (auto u : v) cout << u << ' '; cout << '\n'; };
void yesno(bool is_ok) { cout << (is_ok ? "yes" : "no") << '\n'; }
void YesNo(bool is_ok) { cout << (is_ok ? "Yes" : "No") << '\n'; }
void YESNO(bool is_ok) { cout << (is_ok ? "YES" : "NO") << '\n'; }

// clang-format on
int main() {
    int n;
    cin >> n;
    vector<ll> a(n), b(n);
    REP(i, n) cin >> a[i] >> b[i];
    vector<ll> sorted_a = a, sorted_b = b;
    sort(ALL(sorted_a));
    sort(ALL(sorted_b));
    ll median_a = n % 2 == 0 ? (sorted_a[n / 2] + sorted_a[n / 2 - 1] + 1) / 2
                             : sorted_a[n / 2];
    ll median_b = n % 2 == 0 ? (sorted_b[n / 2] + sorted_b[n / 2 - 1] + 1) / 2
                             : sorted_b[n / 2];
    ll ans = 0;
    REP(i, n) {
        ans += abs(a[i] - b[i]);
        ans += abs(median_a - a[i]);
        ans += abs(median_b - b[i]);
    }
    output(ans);
}

Submission Info

Submission Time
Task B - AtCoder Market
User noko206
Language C++ (GCC 9.2.1)
Score 300
Code Size 2054 Byte
Status AC
Exec Time 8 ms
Memory 3608 KiB

Compile Error

./Main.cpp: In instantiation of ‘void output(const T&, const Ts& ...) [with T = long long int; Ts = {}]’:
./Main.cpp:49:15:   required from here
./Main.cpp:24:86: warning: statement has no effect [-Wunused-value]
   24 | template<class T, class... Ts> void output(const T& a, const Ts&... b) { cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
      |                                                                                      ^~~~

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 195 / 195 105 / 105
Status
AC × 3
AC × 10
AC × 15
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
Subtask1 sample_01.txt, sample_02.txt, sub1_in1.txt, sub1_in2.txt, sub1_in3.txt, sub1_in4.txt, sub1_in5.txt, sub1_in6.txt, sub1_in7.txt, sub1_in8.txt
Subtask2 sample_01.txt, sample_02.txt, sample_03.txt, sub1_in1.txt, sub1_in2.txt, sub1_in3.txt, sub1_in4.txt, sub1_in5.txt, sub1_in6.txt, sub1_in7.txt, sub1_in8.txt, sub2_in1.txt, sub2_in2.txt, sub2_in3.txt, sub2_in4.txt
Case Name Status Exec Time Memory
sample_01.txt AC 8 ms 3452 KiB
sample_02.txt AC 2 ms 3600 KiB
sample_03.txt AC 2 ms 3508 KiB
sub1_in1.txt AC 2 ms 3584 KiB
sub1_in2.txt AC 2 ms 3580 KiB
sub1_in3.txt AC 2 ms 3508 KiB
sub1_in4.txt AC 3 ms 3516 KiB
sub1_in5.txt AC 3 ms 3576 KiB
sub1_in6.txt AC 2 ms 3520 KiB
sub1_in7.txt AC 2 ms 3504 KiB
sub1_in8.txt AC 3 ms 3520 KiB
sub2_in1.txt AC 2 ms 3512 KiB
sub2_in2.txt AC 2 ms 3512 KiB
sub2_in3.txt AC 3 ms 3592 KiB
sub2_in4.txt AC 3 ms 3608 KiB