Submission #1255923

#TimeUsernameProblemLanguageResultExecution timeMemory
1255923magikrapWorld Map (IOI25_worldmap)C++20
30 / 100
15 ms2120 KiB
#include <bits/stdc++.h> #include "worldmap.h" using namespace std; using ll = long long; #define MOD 998244353 #define MOD2 1000000007 #define vt vector template <class T> using vvt = vt<vt<T>>; template <class T> using vvvt = vt<vvt<T>>; template <class T> using vvvvt = vt<vvvt<T>>; typedef vt<int> vi; typedef vvt<int> vvi; typedef vvvt<int> vvvi; typedef vvvvt<int> vvvvi; typedef vt<ll> vl; typedef vvt<ll> vvl; typedef vvvt<ll> vvvl; typedef vvvvt<ll> vvvvl; #define endl '\n' #define pb push_back #define pf push_front #define all(x) x.begin(),x.end() #define sz(x) (int)((x).size()) #define mset multiset #define fi first #define se second #define rep(i,a,b) for(int i=a;i<b;i++) #define repl(i,a,b) for(ll i=a;i<b;i++) #define rrep(i,a,b) for(int i=a;i>=b;i--) #define rrepl(i,a,b) for(ll i=a;i>=b;i--) #define each(i,a) for(auto &i:a) #define yesno(x) cout<<(x?"YES":"NO")<<endl struct pii { int x, y; bool operator<(const pii &a) const { return x == a.x ? y < a.y : x < a.x; } bool operator>(const pii &a) const { return x == a.x ? y > a.y : x > a.x; } bool operator==(const pii &a) const { return x == a.x && y == a.y; } bool operator!=(const pii &a) const { return x != a.x || y != a.y; } pii operator+(const pii &a) const { return {x+a.x, y+a.y}; } pii operator-(const pii &a) const { return {x-a.x, y-a.y}; } pii operator*(const int &a) const { return {x*a, y*a}; } pii operator/(const int &a) const { return {x/a, y/a}; } void operator+=(const pii &a) { x += a.x; y += a.y; } void operator-=(const pii &a) { x -= a.x; y -= a.y; } void operator*=(const int &a) { x *= a; y *= a; } void operator/=(const int &a) { x /= a; y /= a; } friend ostream& operator<<(ostream &os, const pii &p) {return os << "(" << p.x << ", " << p.y << ")";} friend istream& operator>>(istream &is, pii &p) {return is >> p.x >> p.y;} }; struct pll { ll x, y; bool operator<(const pll &a) const { return x == a.x ? y < a.y : x < a.x; } bool operator>(const pll &a) const { return x == a.x ? y > a.y : x > a.x; } bool operator==(const pll &a) const { return x == a.x && y == a.y; } bool operator!=(const pll &a) const { return x != a.x || y != a.y; } pll operator+(const pll &a) const { return {x+a.x, y+a.y}; } pll operator-(const pll &a) const { return {x-a.x, y-a.y}; } pll operator*(const ll &a) const { return {x*a, y*a}; } pll operator/(const ll &a) const { return {x/a, y/a}; } void operator+=(const pll &a) { x += a.x; y += a.y; } void operator-=(const pll &a) { x -= a.x; y -= a.y; } void operator*=(const ll &a) { x *= a; y *= a; } void operator/=(const ll &a) { x /= a; y /= a; } friend ostream& operator<<(ostream &os, const pll &p) {return os << "(" << p.x << ", " << p.y << ")";} friend istream& operator>>(istream &is, pll &p) {return is >> p.x >> p.y;} }; static uint64_t splitmix64(uint64_t x) { x += 0x9e3779b97f4a7c15; x = (x^(x>>30))*0xbf58476d1ce4e5b9; x = (x^(x>>27))*0x94d049bb133111eb; return x^(x>>31); } struct custom_hash { static const uint64_t FIXED_RANDOM; size_t operator()(uint64_t x) const {return splitmix64(x + FIXED_RANDOM);} template<typename T> size_t operator()(const T& t) const {return splitmix64(uint64_t(std::hash<T>{}(t)) + FIXED_RANDOM);} }; const uint64_t custom_hash::FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); mt19937 rng(custom_hash::FIXED_RANDOM); template<typename K, typename V> using umap = unordered_map<K, V, custom_hash>; template<typename K> using uset = unordered_set<K, custom_hash>; template<typename T> using umset = unordered_multiset<T, custom_hash>; template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } void dfs(vvi &adj, int u, int p, vi &ans) { ans.pb(u); each(v,adj[u]) { if (v == p) continue; dfs(adj, v, u, ans); ans.pb(u); } } vvi create_map(int N, int M, vi A, vi B) { if (M == N-1) { vvi adj(N+1); for (int i = 0; i < M; ++i) { adj[A[i]].pb(B[i]); adj[B[i]].pb(A[i]); } vi ans; dfs(adj, 1, 0, ans); vvi res(sz(ans), vi(sz(ans), 0)); rep(i,0,sz(ans)) { rep(j,0,sz(ans)) { res[i][j] = ans[j]; } } return res; } else { vvi ans(2*N, vi(2*N, 1)); vt<pii> hm; rep(i,2,N+1) { hm.pb({i,i}); } rep(i,0,M) { hm.pb({A[i], B[i]}); } rep(i,0,sz(ans)/2) { rep(j,0,sz(ans)) { if ((i+j)%2==0 && sz(hm)) { ans[2*i][j] = hm.back().x; ans[2*i+1][j] = hm.back().y; hm.pop_back(); } } } return ans; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...