oj.uz

Submission #831217

# Submission time Handle Problem Language Result Execution time Memory
831217 2023-08-19T23:35:49 Z NK_ Towers (NOI22_towers) C++17
75 / 100
 2000 ms 627576 KB 
// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>

using namespace std;
 
#define nl '\n'
#define pb push_back
#define pf push_front

#define mp make_pair
#define f first
#define s second
#define sz(x) int(x.size())
 
template<class T> using V = vector<T>;
using pi = pair<int, int>;
using vi = V<int>;
using vpi = V<pi>;

using ll = long long;
using pl = pair<ll, ll>;
using vpl = V<pl>;
using vl = V<ll>;

using db = long double;

template<class T> using pq = priority_queue<T, V<T>, greater<T>>;

const int MOD = 1e9 + 7;
const ll INFL = ll(1e16) + 10;

int main() {
	cin.tie(0)->sync_with_stdio(0);
	
	int N; scanf("%d", &N);
	vpi A(N); for(auto& x : A) {
		scanf("%d %d", &x.f, &x.s);
	}

	int ROWS = 0, COLS = 0;
	for(int t = 0; t < 2; t++) {
		vi X; for(auto& x : A) X.pb(x.f); 

		sort(begin(X), end(X)); X.erase(unique(begin(X), end(X)), end(X));

		for(auto& x : A) {
			x.f = lower_bound(begin(X), end(X), x.f) - begin(X);
			// cerr << x.f << " " << x.s << endl;
			swap(x.f, x.s);
		}
		// cerr << endl;
		ROWS = sz(X); swap(ROWS, COLS);
	}

	map<ll, int> IDX; for(int i = 0; i < N; i++) {
		// cerr << A[i].f << " " << A[i].s << " is " << i << endl;
		IDX[A[i].f * 1LL * COLS + A[i].s] = i;
	}

	V<vi> C(COLS);
	for(int i = 0; i < N; i++) C[A[i].s].pb(A[i].f);
	for(int i = 0; i < COLS; i++) sort(begin(C[i]), end(C[i]));

	V<deque<pi>> R(ROWS); 

	vi POS(2 * COLS, -1); int Q = 0;
	vi stk;
	function<void(int)> update = [&](int X) {
		stk.pb(X);

		while(sz(stk)) {

			int x = stk.back(); stk.pop_back(); 
			if (POS[x] == -1) continue;
			// cerr << "UPDATE " << x << endl;

			// 2*y+c => y is col # and c is dir (0 - dwn (+1), 1 - up (-1));
			int y = x / 2, dir = (x % 2 ? -1 : +1);
			while(1) {
				Q++; assert(Q <= 3 * N);

				if (POS[x] < 0 || POS[x] >= sz(C[y])) {
					POS[x] = -1; break;
				}

				if (POS[2*y] == POS[2*y+1]) {
					POS[x] = -1;
					break; // stop because same as other one
				}

				int r = C[y][POS[x]]; // row

				// cerr << r << " " << y << " " << x << " " << dir << endl;

				if (sz(R[r]) == 0) {
					// cerr << "ADDED " << r << endl;
					R[r].pb(mp(y, x));
					break;
				}

				// check if you can put it in
				if (R[r].back().f < y) { // sz(R[r]) == 2 put in at the back
					// cerr << "ADDED TO BACK " << r << endl;
					if (sz(R[r]) == 2) {
						int i = R[r].back().s; R[r].pop_back(); 
						R[r].pb(mp(y, x));	
						// cerr << "MUST UPDATE " << i << endl;
						stk.pb(i); 
					} else R[r].pb(mp(y, x));	
					break;
				}

				if (y < R[r].front().f) { // sz(R[r]) == 2 put in at the front
					// cerr << "ADDED TO FRONT " << r << endl;
					if (sz(R[r]) == 2) {
						int i = R[r].front().s; R[r].pop_front(); 
						R[r].pf(mp(y, x));
						// cerr << "MUST UPDATE " << i << endl;
						stk.pb(i);
					} else R[r].pf(mp(y, x));
					break;
				}

				POS[x] += dir;
			}
		}
	};


	for(int c = 0; c < COLS; c++) {
		POS[2 * c] = 0; 
		update(2 * c); 

		POS[2 * c + 1] = sz(C[c]) - 1;
		update(2 * c + 1);
	}

	vpi take;
	for(int i = 0; i < 2 * COLS; i++) {
		int c = i / 2; 
		if (0 <= POS[i] && POS[i] < sz(C[c])) {
			// cerr << C[c][POS[i]] << " " << c << endl;
			take.pb(mp(C[c][POS[i]], c));
		}
	}

	string ans(N, '0');
	for(auto& p : take) {
		// cerr << p.f * 1LL * COLS + p.s << endl;
		ans[IDX[p.f * 1LL * COLS + p.s]] = '1';
	}

	cout << ans << endl;
	
	auto check = [&]() {
		vi good(N);

		map<int, int> ROW, COL;
		for(int i = 0; i < N; i++) if (ans[i] == '1') {
			ROW[A[i].f]++; COL[A[i].s]++;
		} 

		for(auto p : ROW) if (p.s > 2) assert(false);
		for(auto p : COL) if (p.s > 2) assert(false);

		for(int i = 0; i < N; i++) {
			if (ans[i] == '0') {
				for(int a = 0; a < N; a++) for(int b = 0; b < N; b++) {
					if (a == b) continue;
					if (ans[a] != '1' || ans[b] != '1') continue;
					if ((A[a].f != A[b].f) ^ (A[a].s != A[b].s) ^ 1) continue;

					int l = min(A[a].f, A[b].f), r = max(A[a].f, A[b].f);
					int L = min(A[a].s, A[b].s), R = max(A[a].s, A[b].s);

					// cerr << a << " " << b << endl;
					// cerr << l << " " << r << endl;
					// cerr << L << " " << R << endl;
					// cerr << endl;

					if (l <= A[i].f && A[i].f <= r && L <= A[i].s && A[i].s <= R) {
						good[i] = 1;
					}
				}
			} else good[i] = 1;
		}

		assert(accumulate(begin(good), end(good), 0) == N);
	};

	// check();


    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:155:7: warning: variable 'check' set but not used [-Wunused-but-set-variable]
  155 |  auto check = [&]() {
      |       ^~~~~
Main.cpp:35:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |  int N; scanf("%d", &N);
      |         ~~~~~^~~~~~~~~~
Main.cpp:37:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |   scanf("%d %d", &x.f, &x.s);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 280 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 7748 KB Output is correct
2 Correct 42 ms 9164 KB Output is correct
3 Correct 139 ms 30812 KB Output is correct
4 Correct 290 ms 52056 KB Output is correct
5 Correct 43 ms 10308 KB Output is correct
6 Correct 9 ms 2320 KB Output is correct
7 Correct 270 ms 48828 KB Output is correct
8 Correct 161 ms 33260 KB Output is correct
9 Correct 437 ms 73592 KB Output is correct
10 Correct 337 ms 61028 KB Output is correct
11 Correct 413 ms 77480 KB Output is correct
12 Correct 416 ms 77344 KB Output is correct

Subtask #4
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 959 ms 586272 KB Output is correct
2 Correct 966 ms 585904 KB Output is correct
3 Correct 961 ms 586136 KB Output is correct
4 Correct 966 ms 586500 KB Output is correct
5 Correct 978 ms 586068 KB Output is correct
6 Execution timed out 2083 ms 627576 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #5
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 280 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 5 ms 4436 KB Output is correct
27 Correct 5 ms 4464 KB Output is correct
28 Correct 4 ms 1440 KB Output is correct
29 Correct 3 ms 1492 KB Output is correct
30 Correct 4 ms 1456 KB Output is correct
31 Correct 4 ms 1492 KB Output is correct
32 Correct 3 ms 1492 KB Output is correct
33 Correct 3 ms 852 KB Output is correct
34 Correct 3 ms 852 KB Output is correct
35 Correct 3 ms 852 KB Output is correct
36 Correct 3 ms 852 KB Output is correct
37 Correct 3 ms 852 KB Output is correct
38 Correct 3 ms 872 KB Output is correct
39 Correct 3 ms 724 KB Output is correct
40 Correct 3 ms 736 KB Output is correct
41 Correct 3 ms 852 KB Output is correct
42 Correct 3 ms 724 KB Output is correct
43 Correct 2 ms 724 KB Output is correct
44 Correct 2 ms 724 KB Output is correct
45 Correct 2 ms 724 KB Output is correct
46 Correct 2 ms 724 KB Output is correct
47 Correct 2 ms 724 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 280 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 5 ms 4436 KB Output is correct
27 Correct 5 ms 4464 KB Output is correct
28 Correct 4 ms 1440 KB Output is correct
29 Correct 3 ms 1492 KB Output is correct
30 Correct 4 ms 1456 KB Output is correct
31 Correct 4 ms 1492 KB Output is correct
32 Correct 3 ms 1492 KB Output is correct
33 Correct 3 ms 852 KB Output is correct
34 Correct 3 ms 852 KB Output is correct
35 Correct 3 ms 852 KB Output is correct
36 Correct 3 ms 852 KB Output is correct
37 Correct 3 ms 852 KB Output is correct
38 Correct 3 ms 872 KB Output is correct
39 Correct 3 ms 724 KB Output is correct
40 Correct 3 ms 736 KB Output is correct
41 Correct 3 ms 852 KB Output is correct
42 Correct 3 ms 724 KB Output is correct
43 Correct 2 ms 724 KB Output is correct
44 Correct 2 ms 724 KB Output is correct
45 Correct 2 ms 724 KB Output is correct
46 Correct 2 ms 724 KB Output is correct
47 Correct 2 ms 724 KB Output is correct
48 Correct 150 ms 78796 KB Output is correct
49 Correct 158 ms 79020 KB Output is correct
50 Correct 139 ms 55364 KB Output is correct
51 Correct 140 ms 55456 KB Output is correct
52 Correct 73 ms 16604 KB Output is correct
53 Correct 82 ms 16540 KB Output is correct
54 Correct 71 ms 16608 KB Output is correct
55 Correct 55 ms 10812 KB Output is correct
56 Correct 54 ms 10840 KB Output is correct
57 Correct 57 ms 10836 KB Output is correct
58 Correct 48 ms 8764 KB Output is correct
59 Correct 50 ms 8760 KB Output is correct
60 Correct 44 ms 8504 KB Output is correct
61 Correct 50 ms 8512 KB Output is correct
62 Correct 45 ms 8500 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 280 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 34 ms 7748 KB Output is correct
27 Correct 42 ms 9164 KB Output is correct
28 Correct 139 ms 30812 KB Output is correct
29 Correct 290 ms 52056 KB Output is correct
30 Correct 43 ms 10308 KB Output is correct
31 Correct 9 ms 2320 KB Output is correct
32 Correct 270 ms 48828 KB Output is correct
33 Correct 161 ms 33260 KB Output is correct
34 Correct 437 ms 73592 KB Output is correct
35 Correct 337 ms 61028 KB Output is correct
36 Correct 413 ms 77480 KB Output is correct
37 Correct 416 ms 77344 KB Output is correct
38 Correct 959 ms 586272 KB Output is correct
39 Correct 966 ms 585904 KB Output is correct
40 Correct 961 ms 586136 KB Output is correct
41 Correct 966 ms 586500 KB Output is correct
42 Correct 978 ms 586068 KB Output is correct
43 Execution timed out 2083 ms 627576 KB Time limit exceeded
44 Halted 0 ms 0 KB -