oj.uz

답안 #831213

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
831213 2023-08-19T23:01:52 Z NK_ Towers (NOI22_towers) C++17
75 / 100
 2000 ms 799448 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; cin >> N;
	vpi A(N); for(auto& x : A) cin >> x.f >> x.s;


	for(int t = 0; t < 2; t++) {
		map<int, int> mp; int cur = 0;
		for(auto& x : A) mp[x.f]++;
		for(auto& x : mp) x.s = cur++;
		for(auto& x : A) x.f = mp[x.f], swap(x.f, x.s);
	}

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

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

	for(int i = 0; i < N; i++) sort(begin(C[i]), end(C[i]));

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

	vi POS(2 * N, -1); int Q = 0;
	function<void(int)> update = [&](int x) {
		Q++; assert(Q <= 3 * N);
		// cerr << "UPDATE " << x << endl;
		if (POS[x] == -1) return;
		// 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) {
			if (POS[x] < 0 || POS[x] >= sz(C[y])) {
				POS[x] = -1; return;
			}

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

			int r = C[y][POS[x]]; // row
			// cerr << x << " " << y << " " << dir << " " << r << endl;

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

			// 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; 
					// cerr << "MUST UPDATE: " << i << endl;
					R[r].pop_back(); 
					R[r].pb(mp(y, x));	
					update(i);
				} else R[r].pb(mp(y, x));	

				return;
			}

			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; 
					// cerr << "MUST UPDATE: " << i << endl;
					R[r].pop_front(); 
					R[r].pf(mp(y, x));
					update(i);
				} else R[r].pf(mp(y, x));
				return;
			}

			POS[x] += dir;
		}
	};


	vi cols; for(int i = 0; i < N; i++) {
		cols.pb(A[i].s);
	}

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

	for(auto& c : cols) { 
		// cerr << c << endl;
		// for(auto r : C[c]) cerr << r << " ";
		// cerr << endl;

		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 * N; i++) {
		int c = i / 2; 
		if (0 <= POS[i] && POS[i] < sz(C[c])) {
			take.pb(mp(C[c][POS[i]], c));
			// cerr << i << " " << c << " " << C[c][POS[i]] << endl;
		}
	}

	string ans(N, '0');
	for(auto& p : take) ans[IDX[p]] = '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:147:7: warning: variable 'check' set but not used [-Wunused-but-set-variable]
  147 |  auto check = [&]() {
      |       ^~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 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 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 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 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 288 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 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 340 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 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 73368 KB Output is correct
2 Correct 87 ms 88348 KB Output is correct
3 Correct 254 ms 267332 KB Output is correct
4 Correct 568 ms 525248 KB Output is correct
5 Correct 87 ms 96128 KB Output is correct
6 Correct 22 ms 19704 KB Output is correct
7 Correct 493 ms 493876 KB Output is correct
8 Correct 318 ms 329124 KB Output is correct
9 Correct 745 ms 735540 KB Output is correct
10 Correct 610 ms 618188 KB Output is correct
11 Correct 787 ms 785264 KB Output is correct
12 Correct 772 ms 783668 KB Output is correct

Subtask #4
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1310 ms 788264 KB Output is correct
2 Correct 1352 ms 788308 KB Output is correct
3 Correct 1352 ms 788356 KB Output is correct
4 Correct 1340 ms 788360 KB Output is correct
5 Correct 1326 ms 788316 KB Output is correct
6 Execution timed out 2108 ms 799448 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #5
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 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 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 288 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 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 340 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 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 6 ms 4436 KB Output is correct
27 Correct 6 ms 4436 KB Output is correct
28 Correct 5 ms 4308 KB Output is correct
29 Correct 5 ms 4360 KB Output is correct
30 Correct 5 ms 4308 KB Output is correct
31 Correct 5 ms 4308 KB Output is correct
32 Correct 6 ms 4308 KB Output is correct
33 Correct 4 ms 4308 KB Output is correct
34 Correct 4 ms 4308 KB Output is correct
35 Correct 5 ms 4308 KB Output is correct
36 Correct 4 ms 4308 KB Output is correct
37 Correct 4 ms 4308 KB Output is correct
38 Correct 4 ms 4308 KB Output is correct
39 Correct 4 ms 4180 KB Output is correct
40 Correct 4 ms 4180 KB Output is correct
41 Correct 6 ms 4180 KB Output is correct
42 Correct 4 ms 4308 KB Output is correct
43 Correct 4 ms 4180 KB Output is correct
44 Correct 4 ms 4180 KB Output is correct
45 Correct 4 ms 4180 KB Output is correct
46 Correct 4 ms 4308 KB Output is correct
47 Correct 4 ms 4308 KB Output is correct

Subtask #6
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 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 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 288 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 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 340 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 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 6 ms 4436 KB Output is correct
27 Correct 6 ms 4436 KB Output is correct
28 Correct 5 ms 4308 KB Output is correct
29 Correct 5 ms 4360 KB Output is correct
30 Correct 5 ms 4308 KB Output is correct
31 Correct 5 ms 4308 KB Output is correct
32 Correct 6 ms 4308 KB Output is correct
33 Correct 4 ms 4308 KB Output is correct
34 Correct 4 ms 4308 KB Output is correct
35 Correct 5 ms 4308 KB Output is correct
36 Correct 4 ms 4308 KB Output is correct
37 Correct 4 ms 4308 KB Output is correct
38 Correct 4 ms 4308 KB Output is correct
39 Correct 4 ms 4180 KB Output is correct
40 Correct 4 ms 4180 KB Output is correct
41 Correct 6 ms 4180 KB Output is correct
42 Correct 4 ms 4308 KB Output is correct
43 Correct 4 ms 4180 KB Output is correct
44 Correct 4 ms 4180 KB Output is correct
45 Correct 4 ms 4180 KB Output is correct
46 Correct 4 ms 4308 KB Output is correct
47 Correct 4 ms 4308 KB Output is correct
48 Correct 173 ms 82236 KB Output is correct
49 Correct 178 ms 82232 KB Output is correct
50 Correct 189 ms 81348 KB Output is correct
51 Correct 193 ms 81404 KB Output is correct
52 Correct 116 ms 80340 KB Output is correct
53 Correct 115 ms 80408 KB Output is correct
54 Correct 115 ms 80428 KB Output is correct
55 Correct 98 ms 79432 KB Output is correct
56 Correct 110 ms 79484 KB Output is correct
57 Correct 102 ms 79436 KB Output is correct
58 Correct 89 ms 79200 KB Output is correct
59 Correct 89 ms 79204 KB Output is correct
60 Correct 81 ms 79076 KB Output is correct
61 Correct 81 ms 79152 KB Output is correct
62 Correct 80 ms 79052 KB Output is correct

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 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 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 288 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 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 340 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 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 71 ms 73368 KB Output is correct
27 Correct 87 ms 88348 KB Output is correct
28 Correct 254 ms 267332 KB Output is correct
29 Correct 568 ms 525248 KB Output is correct
30 Correct 87 ms 96128 KB Output is correct
31 Correct 22 ms 19704 KB Output is correct
32 Correct 493 ms 493876 KB Output is correct
33 Correct 318 ms 329124 KB Output is correct
34 Correct 745 ms 735540 KB Output is correct
35 Correct 610 ms 618188 KB Output is correct
36 Correct 787 ms 785264 KB Output is correct
37 Correct 772 ms 783668 KB Output is correct
38 Correct 1310 ms 788264 KB Output is correct
39 Correct 1352 ms 788308 KB Output is correct
40 Correct 1352 ms 788356 KB Output is correct
41 Correct 1340 ms 788360 KB Output is correct
42 Correct 1326 ms 788316 KB Output is correct
43 Execution timed out 2108 ms 799448 KB Time limit exceeded
44 Halted 0 ms 0 KB -