Submission #65139

#	Time	Username	Problem	Language	Result	Execution time	Memory
65139		aquablitz11	Ideal city (IOI12_city)	C++14	32 / 100	934 ms	3060 KiB

city

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pii = pair<ll, int>;

const int N = 2e3+10;
const int INF = INT_MAX;

int mxx = 0, mxy = 0;
unordered_map<ll, int> idx;
int dist[N];
bool vis[N];
int dx[] = {-1, 1, 0, 0};
int dy[] = {0, 0, -1, 1};

inline ll gethash(int x, int y) {
    return x*1ll*(mxy+10)+y;
}

int DistanceSum(int n, int *X, int *Y)
{
    int mnx = INF, mny = INF;
    for (int i = 0; i < n; ++i) {
        mnx = min(mnx, X[i]);
        mny = min(mny, Y[i]);
    }
    for (int i = 0; i < n; ++i) {
        X[i] -= mnx;
        Y[i] -= mny;
        mxx = max(mxx, X[i]);
        mxy = max(mxy, Y[i]);
    }
    for (int i = 0; i < n; ++i) {
        idx.emplace(gethash(X[i], Y[i]), i);
    }
    int ans = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j)
            vis[j] = dist[j] = 0;
        queue<int> nxt;
        nxt.push(i);
        while (!nxt.empty()) {
            int j = nxt.front();
            int x = X[j];
            int y = Y[j];
            nxt.pop();
            if (j > i) {
                ans += dist[j];
                ans %= (int)1e9;
            }
            for (int k = 0; k < 4; ++k) {
                int nx = x+dx[k];
                int ny = y+dy[k];
                if (!idx.count(gethash(nx, ny)))
                    continue;
                int nj = idx[gethash(nx, ny)];
                if (!vis[nj]) {
                    vis[nj] = true;
                    dist[nj] = dist[j]+1;
                    nxt.push(nj);
                }
            }
        }
    }
    return ans;

}

Compilation message (stderr)

city.cpp: In function 'int DistanceSum(int, int*, int*)':
city.cpp:40:30: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
             vis[j] = dist[j] = 0;
                      ~~~~~~~~^~~

• Subtask 1: 11 / 11
• Subtask 2: 21 / 21
• Subtask 3: 0 / 23
• Subtask 4: 0 / 45