oj.uz

Submission #541421

# Submission time Handle Problem Language Result Execution time Memory
541421 2022-03-23T14:44:31 Z AmirElarbi Ideal city (IOI12_city) C++14
0 / 100
 4 ms 468 KB 
#include <bits/stdc++.h>
#define vi vector<int>
#define ve vector
#define ll long long
#define vf vector<float>
#define vll vector<pair<ll,ll>>
#define ii pair<int,int>
#define pll pair<ll,ll>
#define vvi vector<vi>
#define vii vector<ii>
#define gii greater<ii>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF 2e9+5
#define eps 1e-7
#define eps1 1e-25
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define MAX_A 1e5+5
#define V 450
using namespace std;
const int MOD = 1e9;
const int nax = 1e4+5;
int ans = 0;
int DistanceSum(int n, int *x, int *y) {
    /*for (int i = 0; i < n; ++i)
    {
        mnx = min(mnx,x[i]), mny = min(mny,y[i]);
        mxx = max(mxx,x[i]), mxy = max(mxy, y[i]);
    }
    mxx-=mnx,mxy-=mny;
    ve<bool> test(0,mxy+1);
    for (int i = 0; i <= mxx; ++i)
    {
        grid.pb(test);
    }
    for (int i = 0; i < n; ++i)
    {
        x[i]-=mnx,y[i]-=mny;
        grid[x[i]][y[i]] = 1;
    }
    mxx++,mxy++;
    for (int i = 0; i < n; ++i)
    {
        queue<ii> q;
        q.push({x[i], y[i]});
        memset(d,0,sizeof d);
        vis[x[i]*mxy + y[i]] = 1;
        while(!q.empty()){
            int x1 = q.front().fi , y1 = q.front().se;
            q.pop();
            for (int j = 0; j < 4; ++j)
            {
                int nx = x1 + mov[j][0], ny = y1 + mov[j][1];
                if(nx < 0 || ny < 0 || nx >= mxx || ny >= mxy || !grid[nx][ny] || d[nx*mxy + ny] ) continue;
                d[nx*mxy + ny] = d[x1*mxy + y1] + 1;
                if(!vis[nx*mxy + ny])
                    ans += d[nx*mxy + ny];
                ans %= MOD;
                q.push({nx,ny});
            }
        }
    }*/
    
    return ans;
}
/*
int main() {
    optimise;
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif
  int n;
  cin>> n;
  int x[n],y[n];
  for (int i = 0; i < n; ++i)
  {
      cin >> x[i] >> y[i];
  }
  cout << DistanceSum(n,x,y);
}
*/

Subtask #1
0 / 11.0

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

Subtask #2
0 / 21.0

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

Subtask #3
0 / 23.0

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

Subtask #4
0 / 45.0

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