oj.uz

Submission #574715

# Submission time Handle Problem Language Result Execution time Memory
574715 2022-06-09T10:04:07 Z FatihSolak Ideal city (IOI12_city) C++17
11 / 100
 1000 ms 3540 KB 
#include <bits/stdc++.h>
using namespace std;

int DistanceSum(int n, int *x, int *y) {
    map<pair<int,int>,int> mp;
    for(int i = 0;i<n;i++){
        mp[{x[i],y[i]}] = 1;
    }
    long long ans = 0;
    if(n <= 2000){
        for(int i = 0;i<n;i++){
            map<pair<int,int>,int> dist;
            queue<pair<int,int>> q;
            q.push({x[i],y[i]});
            while(q.size()){
                auto tp = q.front();
                q.pop();
                int xx = tp.first;
                int yy = tp.second;
                ans += dist[tp];
                for(int dx = -1;dx <=1;dx++){
                    for(int dy = -1;dy<=1;dy++){
                        if(abs(dx) + abs(dy) != 1)continue;
                        if(mp[{xx+dx,yy+dy}] && dist[{xx+dx,yy+dy}] == 0 && make_pair(xx + dx,yy+dy) != make_pair(x[i],y[i])){
                            dist[{xx+dx,yy+dy}] = dist[tp] + 1;
                            q.push({xx+dx,yy+dy});
                        }
                    }
                }
            }
        }
        return ans/2;
    }
}

Compilation message

city.cpp: In function 'int DistanceSum(int, int*, int*)':
city.cpp:5:28: warning: control reaches end of non-void function [-Wreturn-type]
    5 |     map<pair<int,int>,int> mp;
      |                            ^~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 6 ms 212 KB Output is correct
5 Correct 6 ms 324 KB Output is correct
6 Correct 25 ms 212 KB Output is correct
7 Correct 24 ms 212 KB Output is correct
8 Correct 24 ms 340 KB Output is correct
9 Correct 23 ms 340 KB Output is correct
10 Correct 26 ms 212 KB Output is correct
11 Correct 24 ms 332 KB Output is correct

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 809 ms 484 KB Output is correct
2 Correct 736 ms 468 KB Output is correct
3 Execution timed out 1082 ms 596 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 10 ms 3540 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Runtime error 10 ms 3540 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -