oj.uz

Submission #562575

# Submission time Handle Problem Language Result Execution time Memory
562575 2022-05-14T16:37:18 Z AlexRex0 Ideal city (IOI12_city) C++14
11 / 100
 1000 ms 4084 KB 
#include<bits/stdc++.h>
using namespace std;

#define MOD 1000000000

long long int ans = 0;
int color;

struct dato{
    pair<int, int> pos;
    long long int costo;
};

queue<dato> cola;
map<pair<int, int> , bool> mapa;
map<pair<int, int> , int> visitado;

int mov[4][2] = {{0, 1}, {1, 0}, {-1, 0}, {0, -1}};

void busca(){
    while(!cola.empty()){
        dato sig;
        sig = cola.front();
        cola.pop();
        if(visitado[{sig.pos.first, sig.pos.second}] != color){
            visitado[{sig.pos.first, sig.pos.second}] = color;
            ans+= sig.costo;
            ans%=MOD;
            for(int i = 0; i < 4; ++i){
                dato aux;
                aux.pos.first = sig.pos.first + mov[i][0];
                aux.pos.second = sig.pos.second + mov[i][1];
                aux.costo = sig.costo + 1;
                aux.costo%=MOD;
                if(mapa[{aux.pos.first, aux.pos.second}]){
                    if(visitado[{aux.pos.first, aux.pos.second}] != color){
                        cola.push(aux);
                    }
                }
            }
        }
    }
}

int DistanceSum(int N, int *X, int *Y) {
    for(int i = 0; i < N; ++i){
        mapa[{X[i], Y[i]}] = true;
    }
    for(int i = 0; i < N; ++i){
        color++;
        dato aux;
        aux.costo = 0;
        aux.pos.first = X[i];
        aux.pos.second = Y[i];
        cola.push(aux);
        busca();
    }
    ans/=2;
    return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 4 ms 212 KB Output is correct
5 Correct 5 ms 212 KB Output is correct
6 Correct 18 ms 212 KB Output is correct
7 Correct 19 ms 212 KB Output is correct
8 Correct 16 ms 340 KB Output is correct
9 Correct 18 ms 332 KB Output is correct
10 Correct 19 ms 328 KB Output is correct
11 Correct 19 ms 212 KB Output is correct

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 674 ms 480 KB Output is correct
2 Correct 657 ms 468 KB Output is correct
3 Execution timed out 1043 ms 468 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1084 ms 3060 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 1094 ms 4084 KB Time limit exceeded
2 Halted 0 ms 0 KB -