oj.uz

Submission #242471

# Submission time Handle Problem Language Result Execution time Memory
242471 2020-06-27T19:00:28 Z Benq Golf (JOI17_golf) C++14
30 / 100
 10000 ms 18876 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 

typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 

typedef vector<int> vi; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 

#define mp make_pair
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_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 trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353;
const int MX = 1<<18; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

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; } 
constexpr int pct(int x) { return __builtin_popcount(x); } 
constexpr int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
constexpr int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 
int fstTrue(function<bool(int)> f, int lo, int hi) {
	hi ++; assert(lo <= hi); // assuming f is increasing
	while (lo < hi) { // find first index such that f is true 
		int mid = (lo+hi)/2; 
		f(mid) ? hi = mid : lo = mid+1; 
	} 
	return lo;
}
template<class T> void remDup(vector<T>& v) { 
	sort(all(v)); v.erase(unique(all(v)),end(v)); }

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
template<class A> str ts(complex<A> c) { 
	stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) { 
	str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
	res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
	str res = ""; F0R(i,SZ) res += char('0'+b[i]);
	return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
	bool fst = 1; str res = "{";
	for (const auto& x: v) {
		if (!fst) res += ", ";
		fst = 0; res += ts(x);
	}
	res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
	return "("+ts(p.f)+", "+ts(p.s)+")"; }

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
	pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
	pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
	cerr << ts(h); if (sizeof...(t)) cerr << ", ";
	DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif

// FILE I/O
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string s = "") {
	unsyncIO();
	// cin.exceptions(cin.failbit); 
	// throws exception when do smth illegal
	// ex. try to read letter into int
	if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

bool bet(pi a, int b) { return a.f <= b && b <= a.s; }

struct Dat {
	vector<pair<int,pi>> hor;
	vector<bool> use;
	void init(vector<pair<int,pi>> _hor) {
		hor = _hor;
		use.rsz(sz(hor));
	}
	vi query(int x, int yl, int yr) {
		vi res;
		F0R(i,sz(hor)) if (!use[i] && bet({yl,yr},hor[i].f) && bet(hor[i].s,x)) {
			res.pb(i);
			use[i] = 1;
		}
		return res;
	}
};

Dat A, B;

int S,T,U,V,N;
vector<pair<pi,pi>> v;
int lo[MX], hi[MX];
vector<pair<int,pi>> hor, ver;

void go() {
	vector<array<int,3>> todo;
	F0R(i,N) {
		todo.pb({v[i].f.f,-1,i});
		todo.pb({v[i].f.s,1,i});
	}
	map<int,pi> m; m[1] = {1e9,1};
	sort(all(todo));
	auto ins = [&](int l, int r, int x) {
		if (l > r) return;
		while (1) {
			auto it = m.lb(l);
			if (it != begin(m) && prev(it)->s.f >= l) it --;
			if (it == end(m) || it->f > r) break;
			auto z = *it; m.erase(it);
			if (z.s.f > r) m[r+1] = z.s;
			if (z.f < l) m[z.f] = {l-1,z.s.s};
		}
		m[l] = {r,x};
	};
	auto val = [&](int x) { return prev(m.ub(x))->s.s; };
	trav(t,todo) {
		int i = t[2];
		if (t[1] == -1) {
			lo[i] = val(v[i].s.f);
			hi[i] = val(v[i].s.s);
			// dbg(i,lo[i],hi[i]);
		} else {
			ins(v[i].s.f+1,v[i].s.s-1,t[0]);
		}
	}
	m.clear(); m[1] = {1e9,1e9}; reverse(all(todo));
	trav(t,todo) {
		//dbg("DOING",t,m);
		int i = t[2];
		if (t[1] == 1) {
			int LO = v[i].s.f, HI = v[i].s.s;
			//dbg("AH",val(LO),val(HI));
			hor.pb({LO,{lo[i],val(LO)}});
			hor.pb({HI,{hi[i],val(HI)}});
			// dbg(i,lo[i],hi[i]);
			// dbg(hor);
		} else {
			ins(v[i].s.f+1,v[i].s.s-1,t[0]);
		}
	}
	//dbg(m);
}

void swa() {
	swap(hor,ver);
	trav(t,v) swap(t.f,t.s);
	swap(S,T), swap(U,V);
}

void compress() {
	vi y;
	trav(t,hor) y.pb(t.f);
	trav(t,ver) y.pb(t.s.f), y.pb(t.s.s);
	remDup(y);
	auto proc = [&y](int& x) { x = lb(all(y),x)-begin(y); };
	proc(T), proc(V);
	trav(t,hor) proc(t.f);
	trav(t,ver) proc(t.s.f), proc(t.s.s);
}

int dist[2][MX];

bool conVer(int a, pi b) {
	return ver[a].f == b.f && bet(ver[a].s,b.s);
}
bool conHor(int a, pi b) {
	return hor[a].f == b.s && bet(hor[a].s,b.f);
}

void fin(int x) {
	ps(x);
	exit(0);
}

int main() {
	setIO(); re(S,T,U,V,N); v.rsz(N); re(v);
	v.pb({{S,S},{T,T}}); v.pb({{U,U},{V,V}});
	N += 2;
	//dbg(v);
	go();
	swa();
	go();
	swa();
	remDup(hor), remDup(ver);
	compress();
	swa();
	compress();
	swa();
	// dbg(hor);
	// dbg(ver);
	// dbg(S,T);
	// dbg(U,V);
	A.init(ver), B.init(hor);
	queue<pi> q;
	F0R(i,sz(ver)) dist[0][i] = MOD;
	F0R(i,sz(hor)) dist[1][i] = MOD;
	auto ad = [&](int a, int b, int c) {
		if (dist[a][b] != MOD) return;
		dist[a][b] = c; q.push({a,b});
	};
	F0R(i,sz(ver)) if (conVer(i,{S,T})) ad(0,i,1);
	F0R(i,sz(hor)) if (conHor(i,{S,T})) ad(1,i,1);
	while (sz(q)) {
		pi a = q.ft; q.pop();
		if (a.f == 0) {
			if (conVer(a.s,{U,V})) fin(dist[a.f][a.s]);
			// vertical
			vi v = B.query(ver[a.s].f, ver[a.s].s.f, ver[a.s].s.s);
			trav(t,v) ad(1,t,dist[a.f][a.s]+1);
		} else {
			if (conHor(a.s,{U,V})) fin(dist[a.f][a.s]);
			vi v = A.query(hor[a.s].f,hor[a.s].s.f,hor[a.s].s.s);
			trav(t,v) ad(0,t,dist[a.f][a.s]+1);
		}
	}
	// you should actually read the stuff at the bottom
}

/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
*/

Compilation message

golf.cpp: In function 'void setIn(std::__cxx11::string)':
golf.cpp:130:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
golf.cpp: In function 'void setOut(std::__cxx11::string)':
golf.cpp:131:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
 void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 28 ms 640 KB Output is correct
6 Correct 22 ms 640 KB Output is correct
7 Correct 29 ms 512 KB Output is correct
8 Correct 27 ms 512 KB Output is correct
9 Correct 30 ms 512 KB Output is correct
10 Correct 20 ms 616 KB Output is correct
11 Correct 17 ms 512 KB Output is correct
12 Correct 17 ms 512 KB Output is correct
13 Correct 28 ms 512 KB Output is correct
14 Correct 29 ms 512 KB Output is correct
15 Correct 7 ms 384 KB Output is correct
16 Correct 11 ms 512 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 28 ms 640 KB Output is correct
6 Correct 22 ms 640 KB Output is correct
7 Correct 29 ms 512 KB Output is correct
8 Correct 27 ms 512 KB Output is correct
9 Correct 30 ms 512 KB Output is correct
10 Correct 20 ms 616 KB Output is correct
11 Correct 17 ms 512 KB Output is correct
12 Correct 17 ms 512 KB Output is correct
13 Correct 28 ms 512 KB Output is correct
14 Correct 29 ms 512 KB Output is correct
15 Correct 7 ms 384 KB Output is correct
16 Correct 11 ms 512 KB Output is correct
17 Correct 36 ms 640 KB Output is correct
18 Correct 29 ms 640 KB Output is correct
19 Correct 29 ms 512 KB Output is correct
20 Correct 34 ms 512 KB Output is correct
21 Correct 29 ms 640 KB Output is correct
22 Correct 24 ms 616 KB Output is correct
23 Correct 23 ms 640 KB Output is correct
24 Correct 39 ms 640 KB Output is correct
25 Correct 17 ms 640 KB Output is correct
26 Correct 29 ms 640 KB Output is correct
27 Correct 8 ms 640 KB Output is correct
28 Correct 12 ms 512 KB Output is correct
29 Correct 14 ms 512 KB Output is correct

Subtask #3
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 28 ms 640 KB Output is correct
6 Correct 22 ms 640 KB Output is correct
7 Correct 29 ms 512 KB Output is correct
8 Correct 27 ms 512 KB Output is correct
9 Correct 30 ms 512 KB Output is correct
10 Correct 20 ms 616 KB Output is correct
11 Correct 17 ms 512 KB Output is correct
12 Correct 17 ms 512 KB Output is correct
13 Correct 28 ms 512 KB Output is correct
14 Correct 29 ms 512 KB Output is correct
15 Correct 7 ms 384 KB Output is correct
16 Correct 11 ms 512 KB Output is correct
17 Correct 36 ms 640 KB Output is correct
18 Correct 29 ms 640 KB Output is correct
19 Correct 29 ms 512 KB Output is correct
20 Correct 34 ms 512 KB Output is correct
21 Correct 29 ms 640 KB Output is correct
22 Correct 24 ms 616 KB Output is correct
23 Correct 23 ms 640 KB Output is correct
24 Correct 39 ms 640 KB Output is correct
25 Correct 17 ms 640 KB Output is correct
26 Correct 29 ms 640 KB Output is correct
27 Correct 8 ms 640 KB Output is correct
28 Correct 12 ms 512 KB Output is correct
29 Correct 14 ms 512 KB Output is correct
30 Execution timed out 10096 ms 18876 KB Time limit exceeded
31 Halted 0 ms 0 KB -