oj.uz

답안 #670233

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
670233 2022-12-08T10:57:33 Z 1bin 이상적인 도시 (IOI12_city) C++14
0 / 100
 8 ms 3664 KB 
#include <bits/stdc++.h>

using namespace std;

#define all(v) v.begin(), v.end()
typedef long long ll;
const int NMAX = 1e5 + 5;
const ll mod = 1e9;
ll n, X[NMAX], Y[NMAX], a[NMAX], w[NMAX];
vector<pair<ll, ll>> v;
vector<ll> adj[NMAX];

ll dfs(int x, int p){
    ll ret = 0;
    for(ll& nx : adj[x]){
        if(nx == p) continue;
        ret += dfs(nx, x);
        ret += w[nx] * (n - w[nx]); ret %= mod;
        //cout << "ans : "<< w[nx] << ' ' << n - w[nx] << '\n';
        w[x] += w[nx];
    }
    return ret;
}

ll go(){
    sort(all(v));
    ll by = -1, bx = -1, t = 0;
    for(int i = 0; i < n; i++){
        auto&[x, y] = v[i];
        if(bx == x && y == by + 1) a[i] = a[i - 1];
        else a[i] = ++t;
        w[a[i]]++;
        int j = lower_bound(all(v), make_pair(x - 1, y)) - v.begin();
        if(v[j] == make_pair(x - 1, y)) {
            //cout << x << ' ' << y << '\n';
            adj[a[j]].emplace_back(a[i]);
            adj[a[i]].emplace_back(a[j]);
        }
        by = y; bx = x;
    }
    for(int i = 1; i <= t; i++) adj[i].erase(unique(all(adj[i])), adj[i].end());
    ll ret = dfs(1, -1);
    for(int i = 1; i <= t; i++) adj[i].clear(), w[i] = 0;
    return ret;
}

ll DistanceSum(int n, int X[], int Y[]){
    ll ret = 0;
    for(int i = 0; i < n; i++) v.emplace_back(X[i], Y[i]);
    ret = go();
    //return ret; //
    
    for(int i = 0; i < n; i++) swap(v[i].first, v[i].second);
    ret += go(); ret %= mod;
    return ret;
}
/*
int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    cin >> n;
    for(int i = 0; i < n; i++) cin >> X[i] >> Y[i];
    cout << DistanceSum(n, X, Y);
    return 0;
}*/

Compilation message

city.cpp: In function 'll go()':
city.cpp:29:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   29 |         auto&[x, y] = v[i];
      |              ^

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2644 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 3664 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 3664 KB Output isn't correct
2 Halted 0 ms 0 KB -