oj.uz

Submission #521625

# Submission time Handle Problem Language Result Execution time Memory
521625 2022-02-02T15:17:53 Z AdamGS Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 2000 ms 65536 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, jeden;
	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];
	}
	l1=0; l2=0;
	while(l1<ile1 && l2<ile3) {
		if(V[l1]<=V[ile1+ile2+l2]) {
			if(V[l1]==V[ile1+ile2+l2]) ++l2;
			jeden.pb(V[l1]);
			++l1;
		} else {
			jeden.pb(V[ile1+ile2+l2]);
			++l2;
		}
	}
	while(l1<ile1) {
		jeden.pb(V[l1]); ++l1;
	}
	while(l2<ile3) {
		jeden.pb(V[ile1+ile2+l2]); ++l2;
	}
	vector<int>jans(jeden.size());
	solve(jeden, jans, (l+r)/2+1, r, akt/3);
	l1=0;
	rep(i, ile1) {
		while(jeden[l1]<V[i]) ++l1;
		ans[i]+=jans[l1];
	}
	l1=0;
	rep(i, ile3) {
		while(jeden[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 2 ms 332 KB Output is correct
6 Correct 2 ms 252 KB Output is correct
7 Correct 2 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 2 ms 332 KB Output is correct
6 Correct 2 ms 252 KB Output is correct
7 Correct 2 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 305 ms 12100 KB Output is correct
12 Correct 355 ms 11832 KB Output is correct
13 Correct 351 ms 11332 KB Output is correct
14 Correct 343 ms 11204 KB Output is correct
15 Correct 340 ms 12256 KB Output is correct
16 Correct 349 ms 11576 KB Output is correct
17 Correct 364 ms 12028 KB Output is correct
18 Correct 180 ms 13256 KB Output is correct
19 Correct 335 ms 10040 KB Output is correct
20 Correct 317 ms 11828 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 2 ms 332 KB Output is correct
6 Correct 2 ms 252 KB Output is correct
7 Correct 2 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 305 ms 12100 KB Output is correct
12 Correct 355 ms 11832 KB Output is correct
13 Correct 351 ms 11332 KB Output is correct
14 Correct 343 ms 11204 KB Output is correct
15 Correct 340 ms 12256 KB Output is correct
16 Correct 349 ms 11576 KB Output is correct
17 Correct 364 ms 12028 KB Output is correct
18 Correct 180 ms 13256 KB Output is correct
19 Correct 335 ms 10040 KB Output is correct
20 Correct 317 ms 11828 KB Output is correct
21 Correct 319 ms 12232 KB Output is correct
22 Correct 385 ms 12484 KB Output is correct
23 Correct 403 ms 14688 KB Output is correct
24 Correct 385 ms 13704 KB Output is correct
25 Correct 374 ms 14132 KB Output is correct
26 Correct 414 ms 18752 KB Output is correct
27 Correct 440 ms 24508 KB Output is correct
28 Correct 198 ms 14164 KB Output is correct
29 Correct 360 ms 10320 KB Output is correct
30 Correct 331 ms 12484 KB Output is correct
31 Correct 409 ms 15120 KB Output is correct
32 Correct 390 ms 14084 KB Output is correct
33 Correct 353 ms 11856 KB Output is correct
34 Correct 428 ms 17600 KB Output is correct
35 Correct 438 ms 24500 KB Output is correct
36 Correct 179 ms 10052 KB Output is correct
37 Correct 375 ms 12240 KB Output is correct
38 Correct 376 ms 10312 KB Output is correct
39 Correct 382 ms 13852 KB Output is correct
40 Correct 382 ms 13016 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 2 ms 332 KB Output is correct
6 Correct 2 ms 252 KB Output is correct
7 Correct 2 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 228 ms 5112 KB Output is correct
12 Correct 372 ms 4956 KB Output is correct
13 Correct 337 ms 3556 KB Output is correct
14 Correct 677 ms 4028 KB Output is correct
15 Correct 1430 ms 6244 KB Output is correct
16 Correct 803 ms 4184 KB Output is correct
17 Correct 819 ms 4192 KB Output is correct
18 Correct 134 ms 2408 KB Output is correct
19 Correct 57 ms 3032 KB Output is correct
20 Correct 366 ms 5512 KB Output is correct
21 Correct 1227 ms 4948 KB Output is correct
22 Correct 653 ms 4164 KB Output is correct
23 Correct 113 ms 4836 KB Output is correct
24 Correct 552 ms 3864 KB Output is correct
25 Correct 828 ms 4276 KB Output is correct
26 Correct 13 ms 2408 KB Output is correct
27 Correct 234 ms 4288 KB Output is correct
28 Correct 60 ms 3060 KB Output is correct
29 Correct 338 ms 4516 KB Output is correct
30 Correct 513 ms 3936 KB Output is correct
31 Correct 116 ms 4072 KB Output is correct
32 Correct 818 ms 4064 KB Output is correct
33 Correct 824 ms 4200 KB Output is correct
34 Correct 13 ms 2408 KB Output is correct
35 Correct 825 ms 4240 KB Output is correct
36 Correct 824 ms 4200 KB Output is correct
37 Correct 822 ms 4224 KB Output is correct
38 Correct 819 ms 4220 KB Output is correct
39 Correct 819 ms 4324 KB Output is correct
40 Correct 829 ms 4252 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 2 ms 332 KB Output is correct
6 Correct 2 ms 252 KB Output is correct
7 Correct 2 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 305 ms 12100 KB Output is correct
12 Correct 355 ms 11832 KB Output is correct
13 Correct 351 ms 11332 KB Output is correct
14 Correct 343 ms 11204 KB Output is correct
15 Correct 340 ms 12256 KB Output is correct
16 Correct 349 ms 11576 KB Output is correct
17 Correct 364 ms 12028 KB Output is correct
18 Correct 180 ms 13256 KB Output is correct
19 Correct 335 ms 10040 KB Output is correct
20 Correct 317 ms 11828 KB Output is correct
21 Correct 319 ms 12232 KB Output is correct
22 Correct 385 ms 12484 KB Output is correct
23 Correct 403 ms 14688 KB Output is correct
24 Correct 385 ms 13704 KB Output is correct
25 Correct 374 ms 14132 KB Output is correct
26 Correct 414 ms 18752 KB Output is correct
27 Correct 440 ms 24508 KB Output is correct
28 Correct 198 ms 14164 KB Output is correct
29 Correct 360 ms 10320 KB Output is correct
30 Correct 331 ms 12484 KB Output is correct
31 Correct 409 ms 15120 KB Output is correct
32 Correct 390 ms 14084 KB Output is correct
33 Correct 353 ms 11856 KB Output is correct
34 Correct 428 ms 17600 KB Output is correct
35 Correct 438 ms 24500 KB Output is correct
36 Correct 179 ms 10052 KB Output is correct
37 Correct 375 ms 12240 KB Output is correct
38 Correct 376 ms 10312 KB Output is correct
39 Correct 382 ms 13852 KB Output is correct
40 Correct 382 ms 13016 KB Output is correct
41 Correct 228 ms 5112 KB Output is correct
42 Correct 372 ms 4956 KB Output is correct
43 Correct 337 ms 3556 KB Output is correct
44 Correct 677 ms 4028 KB Output is correct
45 Correct 1430 ms 6244 KB Output is correct
46 Correct 803 ms 4184 KB Output is correct
47 Correct 819 ms 4192 KB Output is correct
48 Correct 134 ms 2408 KB Output is correct
49 Correct 57 ms 3032 KB Output is correct
50 Correct 366 ms 5512 KB Output is correct
51 Correct 1227 ms 4948 KB Output is correct
52 Correct 653 ms 4164 KB Output is correct
53 Correct 113 ms 4836 KB Output is correct
54 Correct 552 ms 3864 KB Output is correct
55 Correct 828 ms 4276 KB Output is correct
56 Correct 13 ms 2408 KB Output is correct
57 Correct 234 ms 4288 KB Output is correct
58 Correct 60 ms 3060 KB Output is correct
59 Correct 338 ms 4516 KB Output is correct
60 Correct 513 ms 3936 KB Output is correct
61 Correct 116 ms 4072 KB Output is correct
62 Correct 818 ms 4064 KB Output is correct
63 Correct 824 ms 4200 KB Output is correct
64 Correct 13 ms 2408 KB Output is correct
65 Correct 825 ms 4240 KB Output is correct
66 Correct 824 ms 4200 KB Output is correct
67 Correct 822 ms 4224 KB Output is correct
68 Correct 819 ms 4220 KB Output is correct
69 Correct 819 ms 4324 KB Output is correct
70 Correct 829 ms 4252 KB Output is correct
71 Correct 654 ms 17940 KB Output is correct
72 Correct 893 ms 35336 KB Output is correct
73 Correct 1957 ms 61776 KB Output is correct
74 Execution timed out 2031 ms 65536 KB Time limit exceeded
75 Halted 0 ms 0 KB -