oj.uz

Submission #315189

# Submission time Handle Problem Language Result Execution time Memory
315189 2020-10-22T04:19:03 Z juggernaut Ideal city (IOI12_city) C++14
0 / 100
 42 ms 17440 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int>g[2005];
int d[2005][2005],res;
int DistanceSum(int n,int *X,int *Y){
    int i,j;
    for(i=0;i+1<n;i++)
    for(j=i+1;j<n;j++){d[i][j]=2e9,d[j][i]=2e9;;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;
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 21.0

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

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 37 ms 17408 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 42 ms 17440 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -