oj.uz

답안 #97491

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
97491 2019-02-16T12:21:44 Z Alexa2001 이상적인 도시 (IOI12_city) C++17
32 / 100
 1000 ms 3840 KB 
#include <bits/stdc++.h>

using namespace std;

const int Mod = 1e9, Nmax = 1e5 + 5;
typedef long long ll;

int n, x[Nmax], y[Nmax], A[2005][2005], d[2005][2005];

class AIB
{
    ll a[Nmax]; int b[Nmax];
    int ub(int x) { return (x&(-x)); }

public:
    int query(int x)
    {
        ll sum1 = 0, sum2 = 0;
        int cnt1 = 0, cnt2 = 0;
        int i;

        for(i=x; i; i-=ub(i))
            sum1 += a[i], cnt1 += b[i];

        for(i=n; i; i-=ub(i))
            sum2 += a[i], cnt2 += b[i];

        sum2 -= sum1, cnt2 -= cnt1;

        sum1 = (ll) x * cnt1 - sum1;
        sum2 = sum2 - (ll) x * cnt2;
        return (sum1 + sum2) % Mod;
    }

    void update(int pos)
    {
        int i;
        for(i=pos; i<=n; i+=ub(i))
            a[i] += pos, b[i] ++;
    }
} aib;

int solve1()
{
    int i;
    vector<int> p[Nmax];
    for(i=0; i<n; ++i) p[x[i]].push_back(y[i]);

    ll sumx = 0, cnt = 0, ans = 0;

    for(i=1; i<=n; ++i)
        for(auto it : p[i])
        {
            ans += aib.query(it);
            ans %= Mod;
            aib.update(it);

            ans += (ll) i * cnt - sumx;
            ans %= Mod;

            ++cnt; sumx += i;
        }
    return (int)ans;
}

void bfs(int x, int y)
{
    queue< pair<int,int> > q;
    q.push({x, y});
    d[x][y] = 0;
    while(q.size())
    {
        tie(x, y) = q.front();
        q.pop();

        if(A[x-1][y] && d[x-1][y] == -1)
        {
            d[x-1][y] = d[x][y] + 1;
            q.push({x-1, y});
        }
        if(A[x+1][y] && d[x+1][y] == -1)
        {
            d[x+1][y] = d[x][y] + 1;
            q.push({x+1, y});
        }
        if(A[x][y-1] && d[x][y-1] == -1)
        {
            d[x][y-1] = d[x][y] + 1;
            q.push({x, y-1});
        }
        if(A[x][y+1] && d[x][y+1] == -1)
        {
            d[x][y+1] = d[x][y] + 1;
            q.push({x, y+1});
        }
    }
}

int DistanceSum(int N, int *X, int *Y)
{
    int i, j, xmin = 2e9, ymin = 2e9; n = N;
    for(i=0; i<N; ++i)
    {
        x[i] = X[i];
        y[i] = Y[i];
        xmin = min(xmin, x[i]);
        ymin = min(ymin, y[i]);
    }

    for(i=0; i<N; ++i)
        x[i] -= xmin - 1, y[i] -= ymin - 1;

    if(N >= 100000)
        return solve1();

  //    cerr << solve1() << '\n';

    ll ans = 0;

    for(i=0; i<n; ++i) A[x[i]][y[i]] = 1;

    for(i=0; i<n; ++i)
    {
        for(j=0; j<n; ++j) d[x[j]][y[j]] = -1;
        bfs(x[i], y[i]);
        for(j=i+1; j<n; ++j) ans += d[x[j]][y[j]];
        ans %= Mod;
    }
    return ans;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 4 ms 512 KB Output is correct
8 Correct 4 ms 640 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 4 ms 512 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 884 KB Output is correct
2 Correct 34 ms 928 KB Output is correct
3 Correct 102 ms 1124 KB Output is correct
4 Correct 70 ms 1144 KB Output is correct
5 Correct 155 ms 1152 KB Output is correct
6 Correct 109 ms 1152 KB Output is correct
7 Correct 189 ms 1536 KB Output is correct
8 Correct 118 ms 1536 KB Output is correct
9 Correct 98 ms 1024 KB Output is correct
10 Correct 132 ms 896 KB Output is correct

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1051 ms 3456 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1055 ms 3840 KB Time limit exceeded
2 Halted 0 ms 0 KB -