oj.uz

Submission #65139

# Submission time Handle Problem Language Result Execution time Memory
65139 2018-08-06T17:24:51 Z aquablitz11 Ideal city (IOI12_city) C++14
32 / 100
 934 ms 3060 KB 
#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

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.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 3 ms 544 KB Output is correct
4 Correct 5 ms 544 KB Output is correct
5 Correct 4 ms 596 KB Output is correct
6 Correct 9 ms 596 KB Output is correct
7 Correct 12 ms 652 KB Output is correct
8 Correct 9 ms 652 KB Output is correct
9 Correct 10 ms 680 KB Output is correct
10 Correct 10 ms 680 KB Output is correct
11 Correct 8 ms 680 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 215 ms 680 KB Output is correct
2 Correct 235 ms 748 KB Output is correct
3 Correct 418 ms 748 KB Output is correct
4 Correct 464 ms 748 KB Output is correct
5 Correct 804 ms 788 KB Output is correct
6 Correct 922 ms 932 KB Output is correct
7 Correct 934 ms 932 KB Output is correct
8 Correct 725 ms 932 KB Output is correct
9 Correct 685 ms 932 KB Output is correct
10 Correct 660 ms 1068 KB Output is correct

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 12 ms 3016 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Runtime error 12 ms 3060 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -