oj.uz

Submission #437722

# Submission time Handle Problem Language Result Execution time Memory
437722 2021-06-27T01:17:40 Z cp_is_hard Fountain Parks (IOI21_parks) C++17
30 / 100
 694 ms 45068 KB 
#define wiwihorz
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma loop-opt(on)

#define rep(i, a, b) for(int i = a; i <= b; i ++)
#define rrep(i, a, b) for(int i = b; i >= a; i--)
#define ceil(a, b) ((a + b - 1) / (b))
#define all(x) x.begin(), x.end()

#define INF 1000000000000000000
#define MOD 1000000007
#define eps (1e-9)

using namespace std;

#define lld long double
#define pii pair<int, int>
#define random mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count())

#ifdef wiwihorz
#define print(a...) cerr << "line " << __LINE__ << ": ", kout("[" + string(#a) + "] = ", a)
void vprint(auto L, auto R) { while(L < R) cerr << *L << " \n"[next(L) == R], ++L;}
void kout() { cerr << endl; }
template<class T1, class ... T2> void kout(T1 a, T2 ... e) { cerr << a << " ", kout(e...);}
#else
#define print(...) 0
#define vprint(...) 0
#endif 
#include "parks.h"
map<pii, int> mp;
set<pii> occ;
vector<pii> es;
vector<int> x, y;
vector<int> dirx = {0, 0, 2, -2};
vector<int> diry = {2, -2, 0, 0};
namespace dsu {
	int n, cnt;
	vector<int> par, rk;
	void init_(int _n) {
		n = _n, cnt = n;
		print(n, cnt);
		par.assign(n, 0);
		rk.assign(n, 0);
		rep(i, 0, n - 1) par[i] = i;
	} 
	int find_par(int x) {
		if(par[par[x]] == par[x]) return par[x];
		else return par[x] = find_par(par[x]);
	}
	void unite(int a, int b) {
		int aa = find_par(a);
		int bb = find_par(b);
		if(aa == bb) return;
		cnt --;
		if(rk[aa] > rk[bb]) par[bb] = aa;
		else if(rk[bb] > rk[aa]) par[aa] = bb;
		else rk[aa] ++, par[bb] = aa;
	}
	bool same(int a, int b) {return find_par(a) == find_par(b);}
};
int type(pii c) {
	int a = c.first, b = c.second;
	if(x[a] == x[b] && abs(y[a] - y[b]) == 2) return 1;
	else if(y[a] == y[b] && abs(x[a] - x[b]) == 2) return 2;
	else return 0;
}
int construct_roads(vector<int> _x, vector<int> _y) {
    if (x.size() == 1) {
		build({}, {}, {}, {});
        return 1;
    }
    x = _x, y = _y;
    int n = x.size();
    mp.clear(), occ.clear();
    es.clear(); 
    dsu::init_(n);
	rep(i, 0, n - 1) {
		mp[pii(x[i], y[i])] = i;
		rep(j, 0, 3) {
			pii cur = {x[i] + dirx[j], y[i] + diry[j]};
			if(mp.find(cur) == mp.end()) continue;
			es.push_back({mp[cur], i});
		} 
	}   
	vector<int> u, v, a, b;
	vector<pii> use; 
	for(auto i : es) {
		if(!dsu::same(i.first, i.second)) {
			dsu::unite(i.first, i.second);
			if(pii(x[i.first], y[i.first]) 
				> pii(x[i.second], y[i.second])) swap(i.first, i.second);
			use.push_back(i);
		}
	}
	sort(use.begin(), use.end(), [](pii a, pii b){ 
		pii aa = {x[a.first], y[a.first]};
		pii bb = {x[b.first], y[b.first]};
		if(aa == bb) return type(a) > type(b);
		return aa < bb;
	});
	if(dsu::cnt != 1) return 0;
	for(auto i : use) {
		int xx = x[i.first], yy = y[i.first];
		int tx, ty;
		if(type(i) == 1) {
			if(occ.find(pii(xx - 1, yy + 1)) == occ.end()) tx = xx - 1, ty = yy + 1;
			else tx = xx + 1, ty = yy + 1; 
		}
		else {
			if(occ.find(pii(xx + 1, yy - 1)) == occ.end()) tx = xx + 1, ty = yy - 1;
			else tx = xx + 1,ty =  yy + 1;
		}
		u.push_back(i.first);
		v.push_back(i.second);
		a.push_back(tx);
		b.push_back(ty);
		occ.insert(pii(tx,ty));
	}
	build(u, v, a, b);
    return 1;
}

Compilation message

parks.cpp:4: warning: ignoring '#pragma loop ' [-Wunknown-pragmas]
    4 | #pragma loop-opt(on)
      | 
parks.cpp:23:13: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   23 | void vprint(auto L, auto R) { while(L < R) cerr << *L << " \n"[next(L) == R], ++L;}
      |             ^~~~
parks.cpp:23:21: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   23 | void vprint(auto L, auto R) { while(L < R) cerr << *L << " \n"[next(L) == R], ++L;}
      |                     ^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 252 ms 21180 KB Output is correct
10 Correct 16 ms 2516 KB Output is correct
11 Correct 96 ms 11504 KB Output is correct
12 Correct 23 ms 3616 KB Output is correct
13 Correct 48 ms 5464 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 223 ms 21216 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 252 ms 21180 KB Output is correct
10 Correct 16 ms 2516 KB Output is correct
11 Correct 96 ms 11504 KB Output is correct
12 Correct 23 ms 3616 KB Output is correct
13 Correct 48 ms 5464 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 223 ms 21216 KB Output is correct
17 Correct 2 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 581 ms 44644 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 3 ms 460 KB Output is correct
26 Correct 4 ms 588 KB Output is correct
27 Correct 5 ms 716 KB Output is correct
28 Correct 198 ms 17416 KB Output is correct
29 Correct 295 ms 26824 KB Output is correct
30 Correct 469 ms 34740 KB Output is correct
31 Correct 597 ms 44756 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 3 ms 460 KB Output is correct
44 Correct 4 ms 588 KB Output is correct
45 Correct 247 ms 21248 KB Output is correct
46 Correct 362 ms 31456 KB Output is correct
47 Correct 447 ms 31428 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 252 ms 21180 KB Output is correct
10 Correct 16 ms 2516 KB Output is correct
11 Correct 96 ms 11504 KB Output is correct
12 Correct 23 ms 3616 KB Output is correct
13 Correct 48 ms 5464 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 223 ms 21216 KB Output is correct
17 Correct 2 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 581 ms 44644 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 3 ms 460 KB Output is correct
26 Correct 4 ms 588 KB Output is correct
27 Correct 5 ms 716 KB Output is correct
28 Correct 198 ms 17416 KB Output is correct
29 Correct 295 ms 26824 KB Output is correct
30 Correct 469 ms 34740 KB Output is correct
31 Correct 597 ms 44756 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 3 ms 460 KB Output is correct
44 Correct 4 ms 588 KB Output is correct
45 Correct 247 ms 21248 KB Output is correct
46 Correct 362 ms 31456 KB Output is correct
47 Correct 447 ms 31428 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 1 ms 204 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 593 ms 44948 KB Output is correct
56 Correct 1 ms 204 KB Output is correct
57 Correct 4 ms 588 KB Output is correct
58 Correct 11 ms 1592 KB Output is correct
59 Correct 16 ms 1612 KB Output is correct
60 Correct 250 ms 22580 KB Output is correct
61 Correct 349 ms 30296 KB Output is correct
62 Correct 511 ms 37368 KB Output is correct
63 Correct 657 ms 45068 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 1 ms 204 KB Output is correct
66 Correct 1 ms 204 KB Output is correct
67 Correct 539 ms 42356 KB Output is correct
68 Correct 603 ms 42476 KB Output is correct
69 Correct 491 ms 42240 KB Output is correct
70 Correct 6 ms 716 KB Output is correct
71 Correct 10 ms 1228 KB Output is correct
72 Correct 238 ms 21132 KB Output is correct
73 Correct 455 ms 32188 KB Output is correct
74 Correct 595 ms 42356 KB Output is correct
75 Correct 588 ms 42656 KB Output is correct
76 Correct 503 ms 42444 KB Output is correct
77 Correct 7 ms 844 KB Output is correct
78 Correct 11 ms 1404 KB Output is correct
79 Correct 266 ms 21220 KB Output is correct
80 Correct 410 ms 32368 KB Output is correct
81 Correct 597 ms 42532 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 252 ms 21180 KB Output is correct
10 Correct 16 ms 2516 KB Output is correct
11 Correct 96 ms 11504 KB Output is correct
12 Correct 23 ms 3616 KB Output is correct
13 Correct 48 ms 5464 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 223 ms 21216 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 579 ms 43348 KB Output is correct
21 Correct 630 ms 43128 KB Output is correct
22 Correct 577 ms 43020 KB Output is correct
23 Correct 443 ms 36472 KB Output is correct
24 Correct 318 ms 19068 KB Output is correct
25 Correct 487 ms 23624 KB Output is correct
26 Correct 443 ms 23840 KB Output is correct
27 Correct 571 ms 42360 KB Output is correct
28 Correct 591 ms 42352 KB Output is correct
29 Correct 694 ms 42356 KB Output is correct
30 Correct 642 ms 42480 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Incorrect 32 ms 3472 KB Tree @(185725, 20413) appears more than once: for edges on positions 632 and 633
33 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 252 ms 21180 KB Output is correct
10 Correct 16 ms 2516 KB Output is correct
11 Correct 96 ms 11504 KB Output is correct
12 Correct 23 ms 3616 KB Output is correct
13 Correct 48 ms 5464 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 223 ms 21216 KB Output is correct
17 Correct 555 ms 42784 KB Output is correct
18 Correct 532 ms 42888 KB Output is correct
19 Incorrect 574 ms 42980 KB Tree @(100001, 50003) appears more than once: for edges on positions 199993 and 199994
20 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 252 ms 21180 KB Output is correct
10 Correct 16 ms 2516 KB Output is correct
11 Correct 96 ms 11504 KB Output is correct
12 Correct 23 ms 3616 KB Output is correct
13 Correct 48 ms 5464 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 223 ms 21216 KB Output is correct
17 Correct 2 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 581 ms 44644 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 3 ms 460 KB Output is correct
26 Correct 4 ms 588 KB Output is correct
27 Correct 5 ms 716 KB Output is correct
28 Correct 198 ms 17416 KB Output is correct
29 Correct 295 ms 26824 KB Output is correct
30 Correct 469 ms 34740 KB Output is correct
31 Correct 597 ms 44756 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 3 ms 460 KB Output is correct
44 Correct 4 ms 588 KB Output is correct
45 Correct 247 ms 21248 KB Output is correct
46 Correct 362 ms 31456 KB Output is correct
47 Correct 447 ms 31428 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 1 ms 204 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 593 ms 44948 KB Output is correct
56 Correct 1 ms 204 KB Output is correct
57 Correct 4 ms 588 KB Output is correct
58 Correct 11 ms 1592 KB Output is correct
59 Correct 16 ms 1612 KB Output is correct
60 Correct 250 ms 22580 KB Output is correct
61 Correct 349 ms 30296 KB Output is correct
62 Correct 511 ms 37368 KB Output is correct
63 Correct 657 ms 45068 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 1 ms 204 KB Output is correct
66 Correct 1 ms 204 KB Output is correct
67 Correct 539 ms 42356 KB Output is correct
68 Correct 603 ms 42476 KB Output is correct
69 Correct 491 ms 42240 KB Output is correct
70 Correct 6 ms 716 KB Output is correct
71 Correct 10 ms 1228 KB Output is correct
72 Correct 238 ms 21132 KB Output is correct
73 Correct 455 ms 32188 KB Output is correct
74 Correct 595 ms 42356 KB Output is correct
75 Correct 588 ms 42656 KB Output is correct
76 Correct 503 ms 42444 KB Output is correct
77 Correct 7 ms 844 KB Output is correct
78 Correct 11 ms 1404 KB Output is correct
79 Correct 266 ms 21220 KB Output is correct
80 Correct 410 ms 32368 KB Output is correct
81 Correct 597 ms 42532 KB Output is correct
82 Correct 1 ms 204 KB Output is correct
83 Correct 1 ms 204 KB Output is correct
84 Correct 1 ms 204 KB Output is correct
85 Correct 579 ms 43348 KB Output is correct
86 Correct 630 ms 43128 KB Output is correct
87 Correct 577 ms 43020 KB Output is correct
88 Correct 443 ms 36472 KB Output is correct
89 Correct 318 ms 19068 KB Output is correct
90 Correct 487 ms 23624 KB Output is correct
91 Correct 443 ms 23840 KB Output is correct
92 Correct 571 ms 42360 KB Output is correct
93 Correct 591 ms 42352 KB Output is correct
94 Correct 694 ms 42356 KB Output is correct
95 Correct 642 ms 42480 KB Output is correct
96 Correct 1 ms 204 KB Output is correct
97 Incorrect 32 ms 3472 KB Tree @(185725, 20413) appears more than once: for edges on positions 632 and 633
98 Halted 0 ms 0 KB -