# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
597478 | 2022-07-16T05:39:32 Z | Hanksburger | Ideal city (IOI12_city) | C++17 | 153 ms | 262144 KB |
#include <bits/stdc++.h> using namespace std; vector<pair<pair<int, int>, int> > b[100005]; vector<int> adj[100005], w; vector<pair<int, int> > a; long long ans; int n; long long dfs(int u, int p) { long long sum=w[u]; for (int v:adj[u]) { if (v!=p) { long long x=dfs(v, u); ans=(ans+x*(n-x))%1000000000; sum+=x; } } return sum; } int DistanceSum(int N, int *X, int *Y) { n=N; for (int z=0; z<2; z++) { int mn=2147483647, sz=0, cnt=0; for (int i=0; i<n; i++) { mn=min(mn, X[i]); sz=max(sz, X[i]); } sz-=mn; for (int i=0; i<n; i++) a.push_back({X[i]-mn, Y[i]}); sort(a.begin(), a.end()); for (int i=0; i<n; ) { int ind=i+1; while (ind<n && a[i].first==a[ind].first && a[ind-1].second+1==a[ind].second) ind++; w.push_back(a[ind-1].second-a[i].second+1); b[a[i].first].push_back({{a[i].second, a[ind-1].second}, cnt++}); i=ind; } for (int i=0; i<sz; i++) { int ind=0; for (int j=0; j<b[i].size(); j++) { while (ind<b[i+1].size() && b[i+1][ind].first.second<b[i][0].first.first) ind++; while (ind<b[i+1].size() && b[i+1][ind].first.first<=b[i][j].first.second) { int u=b[i][j].second, v=b[i+1][ind].second; adj[u].push_back(v); adj[v].push_back(u); ind++; } ind=max(0, ind-1); } } dfs(0, 0); for (int i=0; i<N; i++) swap(X[i], Y[i]); a.clear(); w.clear(); for (int i=0; i<=sz; i++) b[i].clear(); for (int i=0; i<cnt; i++) adj[i].clear(); } return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 4948 KB | Output is correct |
2 | Runtime error | 153 ms | 262144 KB | Execution killed with signal 9 |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 129 ms | 262144 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 5716 KB | Output is correct |
2 | Correct | 10 ms | 5636 KB | Output is correct |
3 | Correct | 21 ms | 6408 KB | Output is correct |
4 | Correct | 20 ms | 6332 KB | Output is correct |
5 | Correct | 40 ms | 7756 KB | Output is correct |
6 | Correct | 48 ms | 7668 KB | Output is correct |
7 | Correct | 47 ms | 7816 KB | Output is correct |
8 | Correct | 50 ms | 7688 KB | Output is correct |
9 | Correct | 40 ms | 7752 KB | Output is correct |
10 | Correct | 42 ms | 11376 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 145 ms | 262144 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |