제출 #440023

#제출 시각아이디문제언어결과실행 시간메모리
440023Return_0이상적인 도시 (IOI12_city)C++17
55 / 100
143 ms16336 KiB
#ifndef SINA // #include "grader.h" #endif // #pragma GCC optimize("Ofast,unroll-loops") // #pragma comment(linker, "/stack:200000000") // #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native") #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; typedef int ll; typedef long long lol; typedef long double ld; typedef pair <ll, ll> pll; #ifdef SINA #define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__) template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; } template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) { const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); } #define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush(); #else #define dbg(...) 0 #define dbg2(x, j, n) 0 #endif #define SZ(x) ((ll)((x).size())) #define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout); #define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i]; #define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n'); #define kill(x) return cout<< (x) << endl, 0 #define cl const ll #define fr first #define sc second #define lc (v << 1) #define rc (lc | 1) #define mid ((l + r) >> 1) #define All(x) (x).begin(), (x).end() cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9, MOD = 998244353; template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';} template <class A> ostream& operator << (ostream& out, const vector<A> &a) { out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; } template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>; cl mxn1 = 2e3 + 7, mxn2 = 1e5 + 7; map <pll, ll> mp; vector <ll> adj [mxn1]; ll dis [mxn1][mxn1], bfs [mxn1], lst; void BFS (ll v, ll *dist) { memset(dist, 63, sizeof dis[0]); dist[v] = 0; bfs[lst = 0] = v; for (ll l = 0; l <= lst; l++) { v = bfs[l]; for (auto &u : adj[v]) if (dist[u] > dist[v] + 1) dist[u] = dist[v] + 1, bfs[++lst] = u; } } int solve1 (int n, int *X, int *Y) { for (ll i = 0; i < n; i++) mp[{X[i], Y[i]}] = i; for (ll i = 0; i < n; i++) { if (mp.count({X[i] - 1, Y[i]})) adj[i].push_back(mp[{X[i] - 1, Y[i]}]); if (mp.count({X[i] + 1, Y[i]})) adj[i].push_back(mp[{X[i] + 1, Y[i]}]); if (mp.count({X[i], Y[i] - 1})) adj[i].push_back(mp[{X[i], Y[i] - 1}]); if (mp.count({X[i], Y[i] + 1})) adj[i].push_back(mp[{X[i], Y[i] + 1}]); } for (ll i = 0; i < n; i++) BFS(i, dis[i]); ll ans = 0; for (ll i = 0; i < n; i++) for (ll j = i + 1; j < n; j++) (ans += dis[i][j]) %= mod; return ans; } lol ps [mxn2]; int solve2(int n, int *arr) { lol ret = 0; sort(arr, arr + n); ps[0] = arr[0]; for (ll i = 1; i < n; i++) ps[i] = (ps[i - 1] + arr[i]) % mod; for (lol i = 0; i < n; i++) { (ret += (i + 1) * arr[i] - ps[i]) %= mod; } return (ret + mod) % mod; } int DistanceSum(int N, int *X, int *Y) { if (N < mxn1) return solve1(N, X, Y); return (solve2(N, X) + solve2(N, Y)) % mod; } #ifdef SINA int main () { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int X [100], Y [100]; // X[0] = 2; Y[0] = 5; // X[1] = 2; Y[1] = 6; // X[2] = 3; Y[2] = 3; // X[3] = 3; Y[3] = 6; // X[4] = 4; Y[4] = 3; // X[5] = 4; Y[5] = 4; // X[6] = 4; Y[6] = 5; // X[7] = 4; Y[7] = 6; // X[8] = 5; Y[8] = 3; // X[9] = 5; Y[9] = 4; // X[10] = 5; Y[10] = 6; // cout<< DistanceSum(11, X, Y); X[0] = 1; Y[0] = 1; X[1] = 2; Y[1] = 1; X[2] = 3; Y[2] = 1; X[3] = 4; Y[3] = 1; X[4] = 4; Y[4] = 2; cout<< DistanceSum(5, X, Y); cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n"; return 0; } #endif /* */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...