oj.uz

Submission #348408

# Submission time Handle Problem Language Result Execution time Memory
348408 2021-01-15T00:52:19 Z daniel920712 Ideal city (IOI12_city) C++14
32 / 100
 1000 ms 5100 KB 
#include <map>
#include <utility>
#include <queue>
using namespace std;
vector < int > Next[100005];
int con[100005];
map < pair < int , int > , int > where;
int MOD=1000000000;
queue < pair < int , int > > BFS;
int DistanceSum(int N, int *X, int *Y)
{
    int ans=0,x,y,i,j;
    for(i=0;i<N;i++) where[make_pair(X[i],Y[i])]=i;
    for(i=0;i<N;i++)
    {
        if(where.find(make_pair(X[i]+1,Y[i]))!=where.end()) Next[i].push_back(where[make_pair(X[i]+1,Y[i])]);
        if(where.find(make_pair(X[i]-1,Y[i]))!=where.end()) Next[i].push_back(where[make_pair(X[i]-1,Y[i])]);
        if(where.find(make_pair(X[i],Y[i]+1))!=where.end()) Next[i].push_back(where[make_pair(X[i],Y[i]+1)]);
        if(where.find(make_pair(X[i],Y[i]-1))!=where.end()) Next[i].push_back(where[make_pair(X[i],Y[i]-1)]);
    }
    for(i=0;i<N;i++)
    {
        for(j=0;j<N;j++) con[j]=-1;
        BFS.push(make_pair(i,0));
        while(!BFS.empty())
        {
            x=BFS.front().first;
            y=BFS.front().second;
            BFS.pop();
            if(con[x]!=-1) continue;
            con[x]=y;
            if(i<x)
            {
                ans+=y;
                if(ans>MOD) ans-=MOD;
            }
            for(auto k:Next[x]) BFS.push(make_pair(k,y+1));
        }
    }
    return ans;

}

Subtask #1
11.0 / 11.0

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

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 2796 KB Output is correct
2 Correct 61 ms 2852 KB Output is correct
3 Correct 113 ms 2796 KB Output is correct
4 Correct 143 ms 2796 KB Output is correct
5 Correct 197 ms 3072 KB Output is correct
6 Correct 255 ms 3052 KB Output is correct
7 Correct 193 ms 3052 KB Output is correct
8 Correct 253 ms 3052 KB Output is correct
9 Correct 249 ms 3064 KB Output is correct
10 Correct 275 ms 3052 KB Output is correct

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1094 ms 5100 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1082 ms 4972 KB Time limit exceeded
2 Halted 0 ms 0 KB -