oj.uz

Submission #521632

# Submission time Handle Problem Language Result Execution time Memory
521632 2022-02-02T15:41:33 Z AdamGS Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 2000 ms 39772 KB 
#pragma GCC optimize("Ofast,O3")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
string S;
void solve(vector<uint>&V, vector<int>&ans, int l, int r, uint akt) {
	if(!V.size()) return;
	if(l==r) {
		ans[0]=S[l]-'0';
		return;
	}
	int ile1=0, ile2=0, ile3=0;
	rep(i, V.size()) {
		if(V[i]/akt==0) ++ile1;
		else if(V[i]/akt==1) ++ile2;
		else ++ile3;
		V[i]%=akt;
	}
	vector<uint>zero;
	zero.reserve(V.size());
	int l1=0, l2=0;
	while(l1<ile1 && l2<ile2) {
		if(V[l1]<=V[ile1+l2]) {
			if(V[l1]==V[ile1+l2]) ++l2;
			zero.pb(V[l1]);
			++l1;
		} else {
			zero.pb(V[ile1+l2]);
			++l2;
		}
	}
	while(l1<ile1) {
		zero.pb(V[l1]); ++l1;
	}
	while(l2<ile2) {
		zero.pb(V[ile1+l2]); ++l2;
	}
	vector<int>zans(zero.size());
	solve(zero, zans, l, (l+r)/2, akt/3);
	l1=0;
	rep(i, ile1) {
		while(zero[l1]<V[i]) ++l1;
		ans[i]+=zans[l1];
	}
	l1=0;
	rep(i, ile2) {
		while(zero[l1]<V[ile1+i]) ++l1;
		ans[ile1+i]+=zans[l1];
	}
	zero.clear();
	l1=0; l2=0;
	while(l1<ile1 && l2<ile3) {
		if(V[l1]<=V[ile1+ile2+l2]) {
			if(V[l1]==V[ile1+ile2+l2]) ++l2;
			zero.pb(V[l1]);
			++l1;
		} else {
			zero.pb(V[ile1+ile2+l2]);
			++l2;
		}
	}
	while(l1<ile1) {
		zero.pb(V[l1]); ++l1;
	}
	while(l2<ile3) {
		zero.pb(V[ile1+ile2+l2]); ++l2;
	}
	vector<int>jans(zero.size());
	solve(zero, jans, (l+r)/2+1, r, akt/3);
	l1=0;
	rep(i, ile1) {
		while(zero[l1]<V[i]) ++l1;
		ans[i]+=jans[l1];
	}
	l1=0;
	rep(i, ile3) {
		while(zero[l1]<V[ile1+ile2+i]) ++l1;
		ans[ile1+ile2+i]+=jans[l1];
	}
	rep(i, ile2) V[ile1+i]+=akt;
	rep(i, ile3) V[ile1+ile2+i]+=2*akt;
}
int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	int l, q, n=1;
	cin >> l >> q >> S;
	rep(i, l) n*=2;
	pair<uint,int>T[q];
	rep(i, q) {
		string x;
		cin >> x;
		ll p=0;
		for(auto j : x) {
			p*=3;
			if(j=='0') ++p;
			if(j=='1') p+=2;
		}
		T[i]={p, i};
	}
	sort(T, T+q);
	uint akt=1;
	rep(i, l-1) akt*=3;
	vector<uint>V;
	V.pb(T[0].st);
	for(int i=1; i<q; ++i) if(T[i].st!=T[i-1].st) V.pb(T[i].st);
	vector<int>ans(V.size());
	solve(V, ans, 0, n-1, akt);
	int l1=0;
	rep(i, q) {
		while(V[l1]<T[i].st) ++l1;
		T[i]={T[i].nd, ans[l1]};
	}
	sort(T, T+q);
	rep(i, q) cout << T[i].nd << '\n';
}

Compilation message

snake_escaping.cpp: In function 'void solve(std::vector<unsigned int>&, std::vector<int>&, int, int, uint)':
snake_escaping.cpp:7:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<unsigned int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define rep(a, b) for(int a = 0; a < (b); ++a)
      |                                    ^
snake_escaping.cpp:20:2: note: in expansion of macro 'rep'
   20 |  rep(i, V.size()) {
      |  ^~~

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 306 ms 12092 KB Output is correct
12 Correct 349 ms 11828 KB Output is correct
13 Correct 355 ms 11240 KB Output is correct
14 Correct 342 ms 11192 KB Output is correct
15 Correct 334 ms 12204 KB Output is correct
16 Correct 345 ms 11648 KB Output is correct
17 Correct 360 ms 11976 KB Output is correct
18 Correct 188 ms 13116 KB Output is correct
19 Correct 331 ms 10052 KB Output is correct
20 Correct 327 ms 11844 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 306 ms 12092 KB Output is correct
12 Correct 349 ms 11828 KB Output is correct
13 Correct 355 ms 11240 KB Output is correct
14 Correct 342 ms 11192 KB Output is correct
15 Correct 334 ms 12204 KB Output is correct
16 Correct 345 ms 11648 KB Output is correct
17 Correct 360 ms 11976 KB Output is correct
18 Correct 188 ms 13116 KB Output is correct
19 Correct 331 ms 10052 KB Output is correct
20 Correct 327 ms 11844 KB Output is correct
21 Correct 321 ms 12116 KB Output is correct
22 Correct 384 ms 12484 KB Output is correct
23 Correct 409 ms 14236 KB Output is correct
24 Correct 397 ms 13220 KB Output is correct
25 Correct 371 ms 14052 KB Output is correct
26 Correct 410 ms 17616 KB Output is correct
27 Correct 435 ms 24796 KB Output is correct
28 Correct 187 ms 14164 KB Output is correct
29 Correct 355 ms 10180 KB Output is correct
30 Correct 324 ms 12408 KB Output is correct
31 Correct 398 ms 15696 KB Output is correct
32 Correct 392 ms 13848 KB Output is correct
33 Correct 361 ms 11664 KB Output is correct
34 Correct 406 ms 18504 KB Output is correct
35 Correct 438 ms 24672 KB Output is correct
36 Correct 177 ms 10068 KB Output is correct
37 Correct 359 ms 12100 KB Output is correct
38 Correct 369 ms 10308 KB Output is correct
39 Correct 379 ms 14568 KB Output is correct
40 Correct 383 ms 12648 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 175 ms 4500 KB Output is correct
12 Correct 264 ms 4356 KB Output is correct
13 Correct 262 ms 3556 KB Output is correct
14 Correct 530 ms 3648 KB Output is correct
15 Correct 1291 ms 4964 KB Output is correct
16 Correct 663 ms 3636 KB Output is correct
17 Correct 672 ms 3776 KB Output is correct
18 Correct 102 ms 2408 KB Output is correct
19 Correct 48 ms 2880 KB Output is correct
20 Correct 259 ms 4932 KB Output is correct
21 Correct 1029 ms 4188 KB Output is correct
22 Correct 543 ms 3728 KB Output is correct
23 Correct 95 ms 4360 KB Output is correct
24 Correct 420 ms 3524 KB Output is correct
25 Correct 656 ms 3752 KB Output is correct
26 Correct 13 ms 2408 KB Output is correct
27 Correct 177 ms 4032 KB Output is correct
28 Correct 51 ms 2916 KB Output is correct
29 Correct 262 ms 4072 KB Output is correct
30 Correct 388 ms 3504 KB Output is correct
31 Correct 94 ms 3908 KB Output is correct
32 Correct 651 ms 3668 KB Output is correct
33 Correct 652 ms 3952 KB Output is correct
34 Correct 12 ms 2408 KB Output is correct
35 Correct 662 ms 3672 KB Output is correct
36 Correct 651 ms 3684 KB Output is correct
37 Correct 672 ms 3680 KB Output is correct
38 Correct 659 ms 3800 KB Output is correct
39 Correct 664 ms 3688 KB Output is correct
40 Correct 682 ms 3624 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 306 ms 12092 KB Output is correct
12 Correct 349 ms 11828 KB Output is correct
13 Correct 355 ms 11240 KB Output is correct
14 Correct 342 ms 11192 KB Output is correct
15 Correct 334 ms 12204 KB Output is correct
16 Correct 345 ms 11648 KB Output is correct
17 Correct 360 ms 11976 KB Output is correct
18 Correct 188 ms 13116 KB Output is correct
19 Correct 331 ms 10052 KB Output is correct
20 Correct 327 ms 11844 KB Output is correct
21 Correct 321 ms 12116 KB Output is correct
22 Correct 384 ms 12484 KB Output is correct
23 Correct 409 ms 14236 KB Output is correct
24 Correct 397 ms 13220 KB Output is correct
25 Correct 371 ms 14052 KB Output is correct
26 Correct 410 ms 17616 KB Output is correct
27 Correct 435 ms 24796 KB Output is correct
28 Correct 187 ms 14164 KB Output is correct
29 Correct 355 ms 10180 KB Output is correct
30 Correct 324 ms 12408 KB Output is correct
31 Correct 398 ms 15696 KB Output is correct
32 Correct 392 ms 13848 KB Output is correct
33 Correct 361 ms 11664 KB Output is correct
34 Correct 406 ms 18504 KB Output is correct
35 Correct 438 ms 24672 KB Output is correct
36 Correct 177 ms 10068 KB Output is correct
37 Correct 359 ms 12100 KB Output is correct
38 Correct 369 ms 10308 KB Output is correct
39 Correct 379 ms 14568 KB Output is correct
40 Correct 383 ms 12648 KB Output is correct
41 Correct 175 ms 4500 KB Output is correct
42 Correct 264 ms 4356 KB Output is correct
43 Correct 262 ms 3556 KB Output is correct
44 Correct 530 ms 3648 KB Output is correct
45 Correct 1291 ms 4964 KB Output is correct
46 Correct 663 ms 3636 KB Output is correct
47 Correct 672 ms 3776 KB Output is correct
48 Correct 102 ms 2408 KB Output is correct
49 Correct 48 ms 2880 KB Output is correct
50 Correct 259 ms 4932 KB Output is correct
51 Correct 1029 ms 4188 KB Output is correct
52 Correct 543 ms 3728 KB Output is correct
53 Correct 95 ms 4360 KB Output is correct
54 Correct 420 ms 3524 KB Output is correct
55 Correct 656 ms 3752 KB Output is correct
56 Correct 13 ms 2408 KB Output is correct
57 Correct 177 ms 4032 KB Output is correct
58 Correct 51 ms 2916 KB Output is correct
59 Correct 262 ms 4072 KB Output is correct
60 Correct 388 ms 3504 KB Output is correct
61 Correct 94 ms 3908 KB Output is correct
62 Correct 651 ms 3668 KB Output is correct
63 Correct 652 ms 3952 KB Output is correct
64 Correct 12 ms 2408 KB Output is correct
65 Correct 662 ms 3672 KB Output is correct
66 Correct 651 ms 3684 KB Output is correct
67 Correct 672 ms 3680 KB Output is correct
68 Correct 659 ms 3800 KB Output is correct
69 Correct 664 ms 3688 KB Output is correct
70 Correct 682 ms 3624 KB Output is correct
71 Correct 575 ms 19572 KB Output is correct
72 Correct 749 ms 28288 KB Output is correct
73 Correct 1820 ms 39744 KB Output is correct
74 Execution timed out 2062 ms 39772 KB Time limit exceeded
75 Halted 0 ms 0 KB -