Submission #635823

# Submission time Handle Problem Language Result Execution time Memory
635823 2022-08-27T05:12:36 Z IWTIM Pictionary (COCI18_pictionary) C++14
140 / 140
297 ms 60240 KB
# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python! 
 
// pairs
using pii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
#define mp make_pair
#define f first
#define s second
 
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>; 
tcT, size_t SZ> using AR = array<T,SZ>; 
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pii>;
using vpl = V<pl>;
using vpd = V<pd>;
 
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sor(x) sort(all(x)) 
#define rsz resize
#define ins insert 
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
 
#define lb lower_bound
#define ub upper_bound
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
const int MOD = 998244353;
const int MX = 2e5+5;
const ll BIG = 1e18; // not too close to LLONG_MAX
const db PI = acos((db)-1);
const int dx[4]{1,0,-1,0}, dy[4]{0,1,0,-1}; // for every grid problem!!
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
struct DSU {
	vi e; void init(int N) { e = vi(N,-1); }
	int get(int x) { return e[x] < 0 ? x : e[x] = get(e[x]); } 
	bool sameSet(int a, int b) { return get(a) == get(b); }
	int size(int x) { return -e[get(x)]; }
	bool unite(int x, int y) { // union by size
		x = get(x), y = get(y); if (x == y) return 0;
		if (e[x] > e[y]) swap(x,y);
		e[x] += e[y]; e[y] = x; return 1;
	}
};
/*
inline namespace Helpers {
	//////////// is_iterable
	// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
	// this gets used only when we can call begin() and end() on that type
	tcT, class = void> struct is_iterable : false_type {};
	tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
	                                  decltype(end(declval<T>()))
	                                 >
	                       > : true_type {};
	tcT> constexpr bool is_iterable_v = is_iterable<T>::value;
 
	//////////// is_readable
	tcT, class = void> struct is_readable : false_type {};
	tcT> struct is_readable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cin >> declval<T&>()), istream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_readable_v = is_readable<T>::value;
 
	//////////// is_printable
	// // https://nafe.es/posts/2020-02-29-is-printable/
	tcT, class = void> struct is_printable : false_type {};
	tcT> struct is_printable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cout << declval<T>()), ostream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_printable_v = is_printable<T>::value;
}*/
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python! 
 
// pairs
using pii = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
#define mp make_pair
#define f first
#define s second
 
#define tcT template<class T
#define tcTU tcT, class U
// ^ lol this makes everything look weird but I'll try it
tcT> using V = vector<T>; 
tcT, size_t SZ> using AR = array<T,SZ>; 
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pii>;
using vpl = V<pl>;
using vpd = V<pd>;
 
// vectors
// oops size(x), rbegin(x), rend(x) need C++17
#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sor(x) sort(all(x)) 
#define rsz resize
#define ins insert 
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
 
#define lb lower_bound
#define ub upper_bound
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)
template<class T> using pqg = priority_queue<T,vector<T>,greater<T>>;
 
/*
inline namespace Helpers {
	//////////// is_iterable
	// https://stackoverflow.com/questions/13830158/check-if-a-variable-type-is-iterable
	// this gets used only when we can call begin() and end() on that type
	tcT, class = void> struct is_iterable : false_type {};
	tcT> struct is_iterable<T, void_t<decltype(begin(declval<T>())),
	                                  decltype(end(declval<T>()))
	                                 >
	                       > : true_type {};
	tcT> constexpr bool is_iterable_v = is_iterable<T>::value;
 
	//////////// is_readable
	tcT, class = void> struct is_readable : false_type {};
	tcT> struct is_readable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cin >> declval<T&>()), istream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_readable_v = is_readable<T>::value;
 
	//////////// is_printable
	// // https://nafe.es/posts/2020-02-29-is-printable/
	tcT, class = void> struct is_printable : false_type {};
	tcT> struct is_printable<T,
	        typename std::enable_if_t<
	            is_same_v<decltype(cout << declval<T>()), ostream&>
	        >
	    > : true_type {};
	tcT> constexpr bool is_printable_v = is_printable<T>::value;
}*/
const int N = 3e5 + 5;
int t,n,a[N],par[N],ans[N],m,q;
vector <int> v[N];
set <pii> s[N];
set <int> comp[N];
void init() {
	for (int i = 1; i <= n; i++) {
		comp[i].insert(i);
		par[i] = i;
	}
}
int get_col(int a) {
    if (a == par[a]) return a;
    else return par[a] = get_col(par[a]);
}
void col(int a, int b, int idx) {
	a = par[a];
	b = par[b];
	if (a == b) return ;
	if (comp[a].size() < comp[b].size()) swap(a,b);
	/*cout<<idx<<"\n";
	for (int x : comp[a]) cout<<x<<" ";
	cout<<"-- ";
	for (int x : comp[b]) cout<<x<<" "; cout<<"\n";
	*/
	for (int x : comp[b]){
		for (auto sth : s[x]) {
			if (comp[a].count(sth.f)) assert(!ans[sth.s]), ans[sth.s] = idx;
		}
		par[x] = a;
	}
	for (int x : comp[b]) comp[a].insert(x);
	comp[b].clear();
}
main() {
    ios_base::sync_with_stdio(false),
    cin.tie(NULL),cout.tie(NULL);
    cin>>n>>m>>q;
    for (int i = 1; i <= q; i++) {
    	int a, b;
    	cin>>a>>b;
    	s[a].insert({b,i});
    	s[b].insert({a,i});
	}
	init();
    for (int i = 1; i <= n; i++) {
    	for (int j = i; j <= n; j += i) {
    		v[i].pb(j);
		}
	}
	for (int i = m; i >= 1; i--) {
		for (int j = 0; j < (int)v[i].size() - 1; j++) {
			int a = v[i][j]; int b = v[i][j + 1];
			col(a,b,m - i + 1);
		}
	}
	for (int i = 1;i <= q;i++) {
		cout<<ans[i]<<" ";
	}
}

Compilation message

pictionary.cpp:215:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  215 | main() {
      | ^~~~
# Verdict Execution time Memory Grader output
1 Correct 22 ms 36180 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 32 ms 37644 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 82 ms 43048 KB Output is correct
2 Correct 90 ms 43372 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 155 ms 46688 KB Output is correct
2 Correct 119 ms 45552 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 82 ms 43428 KB Output is correct
2 Correct 91 ms 43364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 102 ms 45072 KB Output is correct
2 Correct 104 ms 45856 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 148 ms 49116 KB Output is correct
2 Correct 113 ms 47096 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 171 ms 53324 KB Output is correct
2 Correct 211 ms 53956 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 230 ms 56036 KB Output is correct
2 Correct 264 ms 57420 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 280 ms 60240 KB Output is correct
2 Correct 297 ms 60236 KB Output is correct