oj.uz

Submission #804136

# Submission time Handle Problem Language Result Execution time Memory
804136 2023-08-03T07:19:03 Z Dan4Life Ideal city (IOI12_city) C++17
55 / 100
 151 ms 16724 KB 
#include <bits/stdc++.h>
using namespace std;
using  ll = long long;
const ll MOD = (ll)1e9;
int x[] = {1,-1,0,0};
int y[] = {0,0,1,-1};
int dis[2010][2010], mp[2010][2010];

int bfs(int i, int X, int Y){
    queue<pair<int,int>> Q; Q.push({X,Y});
    vector<pair<int,int>> v; dis[X][Y]=0; int tot = 0;
    while(!empty(Q)){
        auto [x1,y1] = Q.front(); Q.pop();
        tot+=dis[x1][y1]*(mp[x1][y1]>=i); tot%=MOD;
        v.push_back({x1,y1});
        for(int k = 0; k < 4; k++){
            int x2 = x1+x[k], y2 = y1+y[k];
            if(x2<0 or y2<0 or !mp[x2][y2] or dis[x2][y2]!=-1) continue;
            dis[x2][y2] = dis[x1][y1]+1, Q.push({x2,y2});
        }
    }
    for(auto [x1,y1] : v) dis[x1][y1]=-1;
    return tot;
}

int DistanceSum(int N, int *X, int *Y) {
    if(N<=2000){
        memset(dis,-1,sizeof(dis));
        int lol = *min_element(X,X+N), lol2 = *min_element(Y,Y+N);
        for(int i = 0; i < N; i++) X[i]-=lol,Y[i]-=lol2;
        ll ans = 0;
        for(int i = 0; i < N; i++) mp[X[i]][Y[i]]=i+1;
        for(int i = 0; i < N; i++)
            ans+=bfs(i+1,X[i],Y[i]),ans%=MOD;
        return ans;
    }
    ll ans = 0, tot = 0; 
    sort(X,X+N), sort(Y,Y+N);
    for(int j : {0,1}){
        tot = 0; sort(X,X+N);
        for(ll i = 0; i < N; i++){
            ans+=(1ll*X[i]*i-tot+MOD)%MOD;
            tot+=X[i], tot%=MOD; ans%=MOD;swap(X[i],Y[i]);
        }
    }
    return (int)ans;
}

Compilation message

city.cpp: In function 'int DistanceSum(int, int*, int*)':
city.cpp:39:13: warning: unused variable 'j' [-Wunused-variable]
   39 |     for(int j : {0,1}){
      |             ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 16084 KB Output is correct
2 Correct 6 ms 16084 KB Output is correct
3 Correct 6 ms 16084 KB Output is correct
4 Correct 6 ms 16140 KB Output is correct
5 Correct 6 ms 16104 KB Output is correct
6 Correct 7 ms 16212 KB Output is correct
7 Correct 8 ms 16208 KB Output is correct
8 Correct 7 ms 16212 KB Output is correct
9 Correct 8 ms 16172 KB Output is correct
10 Correct 7 ms 16212 KB Output is correct
11 Correct 7 ms 16224 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 16340 KB Output is correct
2 Correct 34 ms 16340 KB Output is correct
3 Correct 80 ms 16480 KB Output is correct
4 Correct 66 ms 16404 KB Output is correct
5 Correct 139 ms 16564 KB Output is correct
6 Correct 100 ms 16468 KB Output is correct
7 Correct 151 ms 16724 KB Output is correct
8 Correct 102 ms 16724 KB Output is correct
9 Correct 109 ms 16444 KB Output is correct
10 Correct 96 ms 16424 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 468 KB Output is correct
2 Correct 5 ms 468 KB Output is correct
3 Correct 12 ms 692 KB Output is correct
4 Correct 11 ms 724 KB Output is correct
5 Correct 23 ms 1060 KB Output is correct
6 Correct 23 ms 1084 KB Output is correct
7 Correct 28 ms 1056 KB Output is correct
8 Correct 23 ms 1168 KB Output is correct
9 Correct 27 ms 1152 KB Output is correct
10 Correct 22 ms 1164 KB Output is correct

Subtask #4
0 / 45.0

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