oj.uz

답안 #962369

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
962369 2024-04-13T11:25:40 Z GrindMachine 이상적인 도시 (IOI12_city) C++17
23 / 100
 31 ms 2868 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

int DistanceSum(int n, int *X, int *Y) {
    vector<ll> a(n), b(n);
    rep(i,n) a[i] = X[i], b[i] = Y[i];
    sort(all(a)), sort(all(b));

    ll ans = 0;

    {
        ll sum = 0;
        rep(i,n){
            ans += a[i]*i-sum;
            ans = (ans%MOD+MOD)%MOD;
            sum += a[i];
        }
    }

    {
        ll sum = 0;
        rep(i,n){
            ans += b[i]*i-sum;
            ans = (ans%MOD+MOD)%MOD;
            sum += b[i];
        }
    }

    return ans;
}

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 860 KB Output is correct
2 Correct 5 ms 984 KB Output is correct
3 Correct 11 ms 1628 KB Output is correct
4 Correct 11 ms 1628 KB Output is correct
5 Correct 25 ms 2868 KB Output is correct
6 Correct 21 ms 2652 KB Output is correct
7 Correct 23 ms 2652 KB Output is correct
8 Correct 21 ms 2836 KB Output is correct
9 Correct 31 ms 2796 KB Output is correct
10 Correct 22 ms 2868 KB Output is correct

Subtask #4
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 860 KB Output isn't correct
2 Halted 0 ms 0 KB -