oj.uz

Submission #761136

# Submission time Handle Problem Language Result Execution time Memory
761136 2023-06-19T09:06:07 Z fatemetmhr Ideal city (IOI12_city) C++17
55 / 100
 66 ms 14744 KB 
//  ~ Be Name Khoda ~  //

#include <bits/stdc++.h>
//#pragma GCC optimize ("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops,Ofast")

using namespace std;

typedef long long ll;

#define pb       push_back
#define mp       make_pair
#define all(x)   x.begin(), x.end()
#define fi       first
#define se       second

const int maxn  =  1e6   + 10;
const int maxn5 =  5e5   + 10;
const int maxnt =  1.2e6 + 10;
const int maxn3 =  2e3   + 10;
const int mod   =  1e9;
const ll  inf   =  1e18;

int h[maxn3], q[maxn3];
vector <int> adj[maxn5];
map <pair<ll, ll>, int> p;
vector <ll> avx, avy;


inline int solve(int n, int *x, int *y){
    for(int i = 0; i < n; i++)
        p[{x[i], y[i]}] = i;
    for(int i = 0; i < n; i++){
        if(p.find(mp(x[i] - 1, y[i])) != p.end())
            adj[i].pb(p[{x[i] - 1, y[i]}]);
        if(p.find(mp(x[i] + 1, y[i])) != p.end())
            adj[i].pb(p[{x[i] + 1, y[i]}]);
        if(p.find(mp(x[i], y[i] - 1)) != p.end())
            adj[i].pb(p[{x[i], y[i] - 1}]);
        if(p.find(mp(x[i], y[i] + 1)) != p.end())
            adj[i].pb(p[{x[i], y[i] + 1}]);
    }
    ll ans = 0;
    for(int i = 0; i < n; i++){
        memset(h, -1, sizeof h);
        int l = 0, r = 1;
        q[0] = i;
        h[i] = 0;
        while(l < r){
            int v = q[l++];
            ans += h[v];
            for(auto u : adj[v]) if(h[u] == -1){
                h[u] = h[v] + 1;
                q[r++] = u;
            }
        }
    }
    ans /= 2;
    return ans % mod;
}


int DistanceSum(int n, int *x, int *y){

    if(n <= 2000)
        return solve(n, x, y);

    for(int i = 0; i < n; i++){
        avx.pb(x[i]);
        avy.pb(y[i]);
    }
    sort(all(avx));
    sort(all(avy));
    ll psx = avx[0], psy = avy[0];
    ll ans = 0;
    for(ll i = 1; i < n; i++){
        ans += i * avx[i] - psx; ans %= mod;
        ans += i * avy[i] - psy; ans %= mod;
        psx += avx[i];
        psy += avy[i];
    }

    return ans % mod;

}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 6 ms 11988 KB Output is correct
5 Correct 6 ms 12056 KB Output is correct
6 Correct 6 ms 11988 KB Output is correct
7 Correct 6 ms 12080 KB Output is correct
8 Correct 6 ms 11988 KB Output is correct
9 Correct 6 ms 11988 KB Output is correct
10 Correct 6 ms 12072 KB Output is correct
11 Correct 6 ms 11988 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 12116 KB Output is correct
2 Correct 20 ms 12176 KB Output is correct
3 Correct 36 ms 12116 KB Output is correct
4 Correct 39 ms 12216 KB Output is correct
5 Correct 62 ms 12256 KB Output is correct
6 Correct 51 ms 12244 KB Output is correct
7 Correct 66 ms 12264 KB Output is correct
8 Correct 62 ms 12256 KB Output is correct
9 Correct 55 ms 12240 KB Output is correct
10 Correct 46 ms 12244 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 12800 KB Output is correct
2 Correct 12 ms 12672 KB Output is correct
3 Correct 17 ms 13512 KB Output is correct
4 Correct 18 ms 13512 KB Output is correct
5 Correct 29 ms 14572 KB Output is correct
6 Correct 29 ms 14688 KB Output is correct
7 Correct 30 ms 14628 KB Output is correct
8 Correct 32 ms 14744 KB Output is correct
9 Correct 29 ms 14640 KB Output is correct
10 Correct 28 ms 14676 KB Output is correct

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 12752 KB Output isn't correct
2 Halted 0 ms 0 KB -