oj.uz

Submission #768038

# Submission time Handle Problem Language Result Execution time Memory
768038 2023-06-27T11:38:14 Z boris_mihov Ideal city (IOI12_city) C++17
32 / 100
 41 ms 11324 KB 
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <queue>
#include <map>

typedef long long llong;
const int MAXN = 100000 + 10;
const int MOD = 1'000'000'000;

int n;
llong ans;
int sz[MAXN];
int par[MAXN];
llong dp[MAXN];
llong chain[MAXN];
int inChain[MAXN];
int x[MAXN], y[MAXN];
std::vector <int> out[MAXN];
std::pair <int,int> delta[] = {{-1, 0}, {0, -1}, {1, 0}, {0, 1}};
std::map <std::pair <int,int>, int> map;
std::vector <int> g[MAXN];
std::vector <int> t[MAXN];
std::queue <int> q;

void dfsDown(int node)
{
    dp[node] = 0;
    sz[node] = 1;

    for (const int &u : t[node])
    {
        if (u == par[node])
        {
            continue;
        }
        
        dfsDown(u);
        sz[node] += sz[u];
        dp[node] += dp[u] + sz[u];
        dp[node] %= MOD;
    }
}

void dfsUp(int node)
{
    if (par[node] != 0)
    {
        dp[node] = (dp[par[node]] + n + 2 * (MOD - chain[inChain[node]])) % MOD;
    }
    
    for (const int &u : t[node])
    {
        if (u != par[node])
        {
            dfsUp(u);
        }
    }
}

int timer;
void dfsChain(int node)
{
    inChain[node] = timer;
    chain[inChain[node]] += sz[node];
    chain[inChain[node]] %= MOD;

    for (const int &u : out[node])
    {
        if (inChain[u] == 0)
        {
            dfsChain(u);
        }
    }
}

int DistanceSum(int N, int *X, int *Y) 
{
    n = N;
    for (int i = 1 ; i <= n ; ++i)
    {
        x[i] = X[i - 1];
        y[i] = Y[i - 1];
        map[{x[i], y[i]}] = i;
    }

    for (int i = 1 ; i <= n ; ++i)
    {
        for (const auto &[dx, dy] : delta)
        {
            if (map.count({x[i] + dx, y[i] + dy}))
            {
                g[i].push_back(map[{x[i] + dx, y[i] + dy}]);
            }
        }
    }

    q.push(n/2 + 1);
    std::fill(par + 1, par + n + 1, -1);
    par[n/2 + 1] = 0;

    while (!q.empty())
    {
        int top = q.front();
        q.pop();

        for (const int &i : g[top])
        {
            if (par[i] == -1)
            {
                par[i] = top;
                t[top].push_back(i);
                q.push(i);
            } else if (par[i] != top && par[top] != i)
            {
                out[top].push_back(i);
            }
        }
    }

    dfsDown(n/2 + 1);
    for (int i = 1 ; i <= n ; ++i)
    {
        if (inChain[i] == 0)
        {
            timer++;
            dfsChain(i);
        }
    }

    dfsUp(n/2 + 1);

    for (int i = 1 ; i <= n ; ++i)
    {
        ans += dp[i];
        ans %= MOD;
    }

    return ans / 2;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 4 ms 7364 KB Output is correct
5 Correct 4 ms 7364 KB Output is correct
6 Correct 5 ms 7404 KB Output is correct
7 Correct 4 ms 7364 KB Output is correct
8 Correct 4 ms 7360 KB Output is correct
9 Correct 4 ms 7380 KB Output is correct
10 Correct 4 ms 7360 KB Output is correct
11 Correct 5 ms 7380 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7508 KB Output is correct
2 Correct 6 ms 7488 KB Output is correct
3 Correct 5 ms 7636 KB Output is correct
4 Correct 5 ms 7624 KB Output is correct
5 Correct 6 ms 7636 KB Output is correct
6 Correct 6 ms 7744 KB Output is correct
7 Correct 6 ms 7764 KB Output is correct
8 Correct 7 ms 7748 KB Output is correct
9 Correct 7 ms 7704 KB Output is correct
10 Correct 8 ms 7708 KB Output is correct

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 11320 KB Output is correct
2 Incorrect 39 ms 11324 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

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