oj.uz

Submission #315237

# Submission time Handle Problem Language Result Execution time Memory
315237 2020-10-22T05:20:10 Z juggernaut Ideal city (IOI12_city) C++14
55 / 100
 169 ms 16200 KB 
#include<bits/stdc++.h>
//#include"grader.cpp"
using namespace std;
typedef long long ll;
vector<int>g[2005];
int d[2005][2005];
int DistanceSum(int N,int *X,int *Y){
    if(N<2001){
        int n=N;
        int i,j,res=0;
        for(i=0;i+1<n;i++)
        for(j=i+1;j<n;j++){d[i][j]=INT_MAX,d[j][i]=INT_MAX;if(abs(X[i]-X[j])+abs(Y[i]-Y[j])==1){
            g[i].push_back(j);
            g[j].push_back(i);
        }}
        for(i=0;i<n;i++){
            queue<int>q;
            q.push(i);
            while(!q.empty()){
                int v=q.front();
                q.pop();
                for(int to:g[v])if(d[i][to]>d[i][v]+1){
                    d[i][to]=d[i][v]+1;
                    q.push(to);
                }
            }
        }
        for(i=0;i+1<n;i++)
            for(j=i+1;j<n;j++)res=(res+d[i][j])%(1000000000);
        return res;
    }
    ll res=0,sum_x=0,sum_y=0,cur_x=0,cur_y=0,n=N,i;
    sort(X,X+n);
    sort(Y,Y+n);
    for(i=0;i<n;i++)sum_x+=1ll*X[i],sum_y+=1ll*Y[i];
    for(i=0;i<n;i++){
        cur_x+=1ll*X[i],cur_y+=1ll*Y[i];
        res=(res+sum_x-cur_x-(1ll*X[i])*(n-i-1))%(1000000000);
        res=(res+sum_y-cur_y-(1ll*Y[i])*(n-i-1))%(1000000000);
    }
    return res;
}
/*
11
2 5
2 6
3 3
3 6
4 3
4 4
4 5
4 6
5 3
5 4
5 6
*/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 768 KB Output is correct
5 Correct 1 ms 768 KB Output is correct
6 Correct 2 ms 1280 KB Output is correct
7 Correct 2 ms 1280 KB Output is correct
8 Correct 2 ms 1280 KB Output is correct
9 Correct 2 ms 1280 KB Output is correct
10 Correct 2 ms 1280 KB Output is correct
11 Correct 2 ms 1280 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 8192 KB Output is correct
2 Correct 42 ms 8192 KB Output is correct
3 Correct 90 ms 12160 KB Output is correct
4 Correct 101 ms 12160 KB Output is correct
5 Correct 156 ms 16120 KB Output is correct
6 Correct 166 ms 16200 KB Output is correct
7 Correct 161 ms 16128 KB Output is correct
8 Correct 169 ms 16128 KB Output is correct
9 Correct 166 ms 16128 KB Output is correct
10 Correct 168 ms 16120 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 512 KB Output is correct
2 Correct 7 ms 768 KB Output is correct
3 Correct 17 ms 1152 KB Output is correct
4 Correct 16 ms 1152 KB Output is correct
5 Correct 34 ms 2040 KB Output is correct
6 Correct 34 ms 1920 KB Output is correct
7 Correct 36 ms 2048 KB Output is correct
8 Correct 34 ms 1920 KB Output is correct
9 Correct 42 ms 1920 KB Output is correct
10 Correct 33 ms 1912 KB Output is correct

Subtask #4
0 / 45.0

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