oj.uz

Submission #521631

# Submission time Handle Problem Language Result Execution time Memory
521631 2022-02-02T15:38:20 Z AdamGS Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 2000 ms 39808 KB 
#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:6:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<unsigned int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    6 | #define rep(a, b) for(int a = 0; a < (b); ++a)
      |                                    ^
snake_escaping.cpp:19:2: note: in expansion of macro 'rep'
   19 |  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 332 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 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 321 ms 12348 KB Output is correct
12 Correct 348 ms 11828 KB Output is correct
13 Correct 361 ms 11228 KB Output is correct
14 Correct 362 ms 11256 KB Output is correct
15 Correct 334 ms 12228 KB Output is correct
16 Correct 350 ms 11584 KB Output is correct
17 Correct 389 ms 11932 KB Output is correct
18 Correct 184 ms 13124 KB Output is correct
19 Correct 327 ms 10040 KB Output is correct
20 Correct 314 ms 11712 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 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 321 ms 12348 KB Output is correct
12 Correct 348 ms 11828 KB Output is correct
13 Correct 361 ms 11228 KB Output is correct
14 Correct 362 ms 11256 KB Output is correct
15 Correct 334 ms 12228 KB Output is correct
16 Correct 350 ms 11584 KB Output is correct
17 Correct 389 ms 11932 KB Output is correct
18 Correct 184 ms 13124 KB Output is correct
19 Correct 327 ms 10040 KB Output is correct
20 Correct 314 ms 11712 KB Output is correct
21 Correct 323 ms 12228 KB Output is correct
22 Correct 384 ms 12364 KB Output is correct
23 Correct 403 ms 14192 KB Output is correct
24 Correct 395 ms 13192 KB Output is correct
25 Correct 371 ms 14048 KB Output is correct
26 Correct 415 ms 17616 KB Output is correct
27 Correct 432 ms 24708 KB Output is correct
28 Correct 193 ms 14092 KB Output is correct
29 Correct 370 ms 10188 KB Output is correct
30 Correct 334 ms 12496 KB Output is correct
31 Correct 415 ms 15740 KB Output is correct
32 Correct 390 ms 13888 KB Output is correct
33 Correct 360 ms 11652 KB Output is correct
34 Correct 413 ms 18504 KB Output is correct
35 Correct 445 ms 24704 KB Output is correct
36 Correct 182 ms 10052 KB Output is correct
37 Correct 372 ms 12104 KB Output is correct
38 Correct 370 ms 10436 KB Output is correct
39 Correct 387 ms 14556 KB Output is correct
40 Correct 387 ms 12612 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 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 183 ms 4580 KB Output is correct
12 Correct 279 ms 4536 KB Output is correct
13 Correct 267 ms 3616 KB Output is correct
14 Correct 520 ms 3772 KB Output is correct
15 Correct 1301 ms 4964 KB Output is correct
16 Correct 670 ms 3836 KB Output is correct
17 Correct 676 ms 3732 KB Output is correct
18 Correct 104 ms 2408 KB Output is correct
19 Correct 48 ms 2784 KB Output is correct
20 Correct 274 ms 4972 KB Output is correct
21 Correct 1048 ms 4324 KB Output is correct
22 Correct 513 ms 3676 KB Output is correct
23 Correct 98 ms 4356 KB Output is correct
24 Correct 427 ms 3472 KB Output is correct
25 Correct 667 ms 3936 KB Output is correct
26 Correct 13 ms 2408 KB Output is correct
27 Correct 178 ms 4248 KB Output is correct
28 Correct 51 ms 2948 KB Output is correct
29 Correct 276 ms 3972 KB Output is correct
30 Correct 398 ms 3492 KB Output is correct
31 Correct 96 ms 3900 KB Output is correct
32 Correct 665 ms 3640 KB Output is correct
33 Correct 666 ms 3700 KB Output is correct
34 Correct 12 ms 2408 KB Output is correct
35 Correct 677 ms 3796 KB Output is correct
36 Correct 682 ms 3732 KB Output is correct
37 Correct 672 ms 3604 KB Output is correct
38 Correct 677 ms 3612 KB Output is correct
39 Correct 683 ms 3772 KB Output is correct
40 Correct 684 ms 3616 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 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 321 ms 12348 KB Output is correct
12 Correct 348 ms 11828 KB Output is correct
13 Correct 361 ms 11228 KB Output is correct
14 Correct 362 ms 11256 KB Output is correct
15 Correct 334 ms 12228 KB Output is correct
16 Correct 350 ms 11584 KB Output is correct
17 Correct 389 ms 11932 KB Output is correct
18 Correct 184 ms 13124 KB Output is correct
19 Correct 327 ms 10040 KB Output is correct
20 Correct 314 ms 11712 KB Output is correct
21 Correct 323 ms 12228 KB Output is correct
22 Correct 384 ms 12364 KB Output is correct
23 Correct 403 ms 14192 KB Output is correct
24 Correct 395 ms 13192 KB Output is correct
25 Correct 371 ms 14048 KB Output is correct
26 Correct 415 ms 17616 KB Output is correct
27 Correct 432 ms 24708 KB Output is correct
28 Correct 193 ms 14092 KB Output is correct
29 Correct 370 ms 10188 KB Output is correct
30 Correct 334 ms 12496 KB Output is correct
31 Correct 415 ms 15740 KB Output is correct
32 Correct 390 ms 13888 KB Output is correct
33 Correct 360 ms 11652 KB Output is correct
34 Correct 413 ms 18504 KB Output is correct
35 Correct 445 ms 24704 KB Output is correct
36 Correct 182 ms 10052 KB Output is correct
37 Correct 372 ms 12104 KB Output is correct
38 Correct 370 ms 10436 KB Output is correct
39 Correct 387 ms 14556 KB Output is correct
40 Correct 387 ms 12612 KB Output is correct
41 Correct 183 ms 4580 KB Output is correct
42 Correct 279 ms 4536 KB Output is correct
43 Correct 267 ms 3616 KB Output is correct
44 Correct 520 ms 3772 KB Output is correct
45 Correct 1301 ms 4964 KB Output is correct
46 Correct 670 ms 3836 KB Output is correct
47 Correct 676 ms 3732 KB Output is correct
48 Correct 104 ms 2408 KB Output is correct
49 Correct 48 ms 2784 KB Output is correct
50 Correct 274 ms 4972 KB Output is correct
51 Correct 1048 ms 4324 KB Output is correct
52 Correct 513 ms 3676 KB Output is correct
53 Correct 98 ms 4356 KB Output is correct
54 Correct 427 ms 3472 KB Output is correct
55 Correct 667 ms 3936 KB Output is correct
56 Correct 13 ms 2408 KB Output is correct
57 Correct 178 ms 4248 KB Output is correct
58 Correct 51 ms 2948 KB Output is correct
59 Correct 276 ms 3972 KB Output is correct
60 Correct 398 ms 3492 KB Output is correct
61 Correct 96 ms 3900 KB Output is correct
62 Correct 665 ms 3640 KB Output is correct
63 Correct 666 ms 3700 KB Output is correct
64 Correct 12 ms 2408 KB Output is correct
65 Correct 677 ms 3796 KB Output is correct
66 Correct 682 ms 3732 KB Output is correct
67 Correct 672 ms 3604 KB Output is correct
68 Correct 677 ms 3612 KB Output is correct
69 Correct 683 ms 3772 KB Output is correct
70 Correct 684 ms 3616 KB Output is correct
71 Correct 584 ms 19744 KB Output is correct
72 Correct 778 ms 28380 KB Output is correct
73 Correct 1861 ms 39608 KB Output is correct
74 Execution timed out 2094 ms 39808 KB Time limit exceeded
75 Halted 0 ms 0 KB -