oj.uz

Submission #575540

# Submission time Handle Problem Language Result Execution time Memory
575540 2022-06-10T21:13:00 Z FatihSolak Ideal city (IOI12_city) C++17
100 / 100
 58 ms 13056 KB 
#include <bits/stdc++.h>
#define N 100005
using namespace std;
const int mod = 1e9;
long long ans = 0;
int group[N];
vector<int> adj[N];
int sz[N];
int sub[N];
vector<int> v[N];
int n;
void dfs(int v,int par){
    sub[v] = sz[v];
    for(auto u:adj[v]){
        if(u == par)continue;
        dfs(u,v);
        sub[v] += sub[u];
        ans += (long long)sub[u]*(n-sub[u]);
    }
}
void solve(){
    int cnt = 1;
    int bef = 1;
    for(int i = 0;i<n;i++){
        int tmp = cnt;
        sort(v[i].begin(),v[i].end());
        for(int j = 0;j<v[i].size();j++){
            sz[cnt] = 0;
            int r = j-1;
            int last = bef-1;
            while(r  + 1< v[i].size() && v[i][j] + (r-j+1) == v[i][r+1]){
                r++;
                if(last < group[v[i][r]]){
                    adj[group[v[i][r]]].push_back(cnt);
                    adj[cnt].push_back(group[v[i][r]]);
                    last = group[v[i][r]];
                }
                sz[cnt]++;
                group[v[i][r]] = cnt;
            }
            j = r;
            cnt++;
        }
        bef = tmp;
    }
    dfs(1,0);
}
int DistanceSum(int n_, int *x, int *y) {
    n = n_;
    vector<int> compressx,compressy;
    for(int i = 0;i<n;i++){
        compressx.push_back(x[i]);
        compressy.push_back(y[i]);
    }
    sort(compressx.begin(),compressx.end());
    sort(compressy.begin(),compressy.end());
    compressx.resize(unique(compressx.begin(),compressx.end())-compressx.begin());
    compressy.resize(unique(compressy.begin(),compressy.end())-compressy.begin());
    for(int i = 0;i<n;i++){
        x[i] = lower_bound(compressx.begin(),compressx.end(),x[i]) - compressx.begin();
        y[i] = lower_bound(compressy.begin(),compressy.end(),y[i]) - compressy.begin();
    }
    for(int i = 0;i<n;i++){
        v[x[i]].push_back(y[i]);
    }
    solve();
    for(int i = 0;i<n;i++){
        v[i].clear();
        adj[i].clear();
        group[i] = 0;
    }
    for(int i = 0;i<n;i++){
        v[y[i]].push_back(x[i]);
    }
    solve();
    return ans%mod;
}

Compilation message

city.cpp: In function 'void solve()':
city.cpp:27:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |         for(int j = 0;j<v[i].size();j++){
      |                       ~^~~~~~~~~~~~
city.cpp:31:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |             while(r  + 1< v[i].size() && v[i][j] + (r-j+1) == v[i][r+1]){
      |                   ~~~~~~^~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5012 KB Output is correct
3 Correct 3 ms 5020 KB Output is correct
4 Correct 3 ms 5076 KB Output is correct
5 Correct 3 ms 5016 KB Output is correct
6 Correct 5 ms 5020 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 5016 KB Output is correct
9 Correct 4 ms 5076 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 5732 KB Output is correct
2 Correct 14 ms 5972 KB Output is correct
3 Correct 24 ms 6792 KB Output is correct
4 Correct 25 ms 7076 KB Output is correct
5 Correct 50 ms 8832 KB Output is correct
6 Correct 48 ms 9136 KB Output is correct
7 Correct 50 ms 9196 KB Output is correct
8 Correct 47 ms 8464 KB Output is correct
9 Correct 49 ms 9208 KB Output is correct
10 Correct 57 ms 13056 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 6044 KB Output is correct
2 Correct 13 ms 6192 KB Output is correct
3 Correct 30 ms 7752 KB Output is correct
4 Correct 28 ms 7504 KB Output is correct
5 Correct 56 ms 10460 KB Output is correct
6 Correct 52 ms 9440 KB Output is correct
7 Correct 58 ms 10324 KB Output is correct
8 Correct 51 ms 9536 KB Output is correct
9 Correct 49 ms 8912 KB Output is correct
10 Correct 50 ms 9084 KB Output is correct