Cod sursa(job #2644279)

Utilizator MateiAruxandeiMateiStefan MateiAruxandei Data 24 august 2020 10:02:09
Problema Fractal Scor 100
Compilator cpp-64 Status done
Runda prbd2 Marime 1.91 kb
#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template<class T> ostream& prnt(ostream& out, T v) { out << v.size() << '\n'; for(auto e : v) out << e << ' '; return out;}
template<class T> ostream& operator<<(ostream& out, vector <T> v) { return prnt(out, v); }
template<class T> ostream& operator<<(ostream& out, set <T> v) { return prnt(out, v); }
template<class T1, class T2> ostream& operator<<(ostream& out, map <T1, T2> v) { return prnt(out, v); }
template<class T1, class T2> ostream& operator<<(ostream& out, pair<T1, T2> p) { return out << '(' << p.first << ' ' << p.second << ')'; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...);}
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) do{cerr<<#x"[]: ";for(int _=0;_<n;++_)cerr<<x[_]<<" ";cerr<<'\n';}while(0)
#define dbg_ok cerr<<"OK!\n"
#define ll long long
#define ld long double
#define ull unsigned long long
#define pii pair<int,int>
#define MOD 1000003
#define zeros(x) x&(x-1)^x
#define fi first
#define se second
#define NMAX 1005

void solve(int k, int x, int y, int rez){
	if(k == 1){
		if(x == 1 && y == 1)
			cout << rez << '\n';
		else if(x == 2 && y == 1)
			cout << rez + 1 << '\n';
		else if(x == 2 && y == 2)
			cout << rez + 2 << '\n';
		else
			cout << rez + 3 << '\n';
	}
	else{
		int cad = (1 << (k - 1));
		int adaug = cad * cad;
		if(x <= cad && y <= cad)
			solve(k - 1, y, x, rez);
		else if(x > cad && y <= cad)
			solve(k - 1, x - cad, y, rez + adaug);
		else if(x > cad && y > cad)
			solve(k - 1, x - cad, y - cad, rez + 2 * adaug);
		else
			solve(k - 1, 2 * cad - y + 1, cad - x + 1, rez + 3 * adaug);	
	}
}

int main(){
	freopen("fractal.in", "r", stdin);
	freopen("fractal.out", "w", stdout);

	ios_base::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);

	int k, x, y;
	cin >> k >> y >> x;

	solve(k, x, y, 0);	
	return 0;
}