oj.uz

답안 #521627

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
521627 2022-02-02T15:24:49 Z AdamGS Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 2000 ms 38892 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;
	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];
	}
	while(zero.size()) zero.pop_back();
	while(zans.size()) zans.pop_back();
	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]);
			zans.pb(0);
			++l1;
		} else {
			zero.pb(V[ile1+ile2+l2]);
			zans.pb(0);
			++l2;
		}
	}
	while(l1<ile1) {
		zero.pb(V[l1]); zans.pb(0); ++l1;
	}
	while(l2<ile3) {
		zero.pb(V[ile1+ile2+l2]); zans.pb(0); ++l2;
	}
	solve(zero, zans, (l+r)/2+1, r, akt/3);
	l1=0;
	rep(i, ile1) {
		while(zero[l1]<V[i]) ++l1;
		ans[i]+=zans[l1];
	}
	l1=0;
	rep(i, ile3) {
		while(zero[l1]<V[ile1+ile2+i]) ++l1;
		ans[ile1+ile2+i]+=zans[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

# 결과 실행 시간 메모리 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 2 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

# 결과 실행 시간 메모리 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 2 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 319 ms 12084 KB Output is correct
12 Correct 352 ms 11704 KB Output is correct
13 Correct 352 ms 11228 KB Output is correct
14 Correct 349 ms 11236 KB Output is correct
15 Correct 329 ms 12216 KB Output is correct
16 Correct 351 ms 11524 KB Output is correct
17 Correct 362 ms 11892 KB Output is correct
18 Correct 183 ms 13116 KB Output is correct
19 Correct 324 ms 10032 KB Output is correct
20 Correct 309 ms 11696 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 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 2 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 319 ms 12084 KB Output is correct
12 Correct 352 ms 11704 KB Output is correct
13 Correct 352 ms 11228 KB Output is correct
14 Correct 349 ms 11236 KB Output is correct
15 Correct 329 ms 12216 KB Output is correct
16 Correct 351 ms 11524 KB Output is correct
17 Correct 362 ms 11892 KB Output is correct
18 Correct 183 ms 13116 KB Output is correct
19 Correct 324 ms 10032 KB Output is correct
20 Correct 309 ms 11696 KB Output is correct
21 Correct 329 ms 12184 KB Output is correct
22 Correct 380 ms 12372 KB Output is correct
23 Correct 409 ms 14172 KB Output is correct
24 Correct 379 ms 12852 KB Output is correct
25 Correct 388 ms 13664 KB Output is correct
26 Correct 407 ms 17720 KB Output is correct
27 Correct 434 ms 22952 KB Output is correct
28 Correct 183 ms 14148 KB Output is correct
29 Correct 358 ms 10132 KB Output is correct
30 Correct 322 ms 12428 KB Output is correct
31 Correct 399 ms 15380 KB Output is correct
32 Correct 389 ms 13896 KB Output is correct
33 Correct 357 ms 11760 KB Output is correct
34 Correct 414 ms 16764 KB Output is correct
35 Correct 435 ms 23004 KB Output is correct
36 Correct 180 ms 10052 KB Output is correct
37 Correct 352 ms 12100 KB Output is correct
38 Correct 366 ms 10184 KB Output is correct
39 Correct 391 ms 13900 KB Output is correct
40 Correct 374 ms 12832 KB Output is correct

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 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 2 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 207 ms 4428 KB Output is correct
12 Correct 303 ms 4440 KB Output is correct
13 Correct 298 ms 3536 KB Output is correct
14 Correct 578 ms 3332 KB Output is correct
15 Correct 1402 ms 4484 KB Output is correct
16 Correct 721 ms 3592 KB Output is correct
17 Correct 737 ms 3372 KB Output is correct
18 Correct 88 ms 2408 KB Output is correct
19 Correct 53 ms 2588 KB Output is correct
20 Correct 285 ms 4572 KB Output is correct
21 Correct 1146 ms 3860 KB Output is correct
22 Correct 580 ms 3580 KB Output is correct
23 Correct 108 ms 4072 KB Output is correct
24 Correct 472 ms 3264 KB Output is correct
25 Correct 722 ms 3436 KB Output is correct
26 Correct 12 ms 2408 KB Output is correct
27 Correct 194 ms 4072 KB Output is correct
28 Correct 58 ms 2660 KB Output is correct
29 Correct 308 ms 3884 KB Output is correct
30 Correct 435 ms 3376 KB Output is correct
31 Correct 103 ms 3940 KB Output is correct
32 Correct 728 ms 3384 KB Output is correct
33 Correct 736 ms 3404 KB Output is correct
34 Correct 16 ms 2408 KB Output is correct
35 Correct 736 ms 3512 KB Output is correct
36 Correct 738 ms 3308 KB Output is correct
37 Correct 732 ms 3540 KB Output is correct
38 Correct 745 ms 3528 KB Output is correct
39 Correct 742 ms 3512 KB Output is correct
40 Correct 729 ms 3512 KB Output is correct

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 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 2 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 319 ms 12084 KB Output is correct
12 Correct 352 ms 11704 KB Output is correct
13 Correct 352 ms 11228 KB Output is correct
14 Correct 349 ms 11236 KB Output is correct
15 Correct 329 ms 12216 KB Output is correct
16 Correct 351 ms 11524 KB Output is correct
17 Correct 362 ms 11892 KB Output is correct
18 Correct 183 ms 13116 KB Output is correct
19 Correct 324 ms 10032 KB Output is correct
20 Correct 309 ms 11696 KB Output is correct
21 Correct 329 ms 12184 KB Output is correct
22 Correct 380 ms 12372 KB Output is correct
23 Correct 409 ms 14172 KB Output is correct
24 Correct 379 ms 12852 KB Output is correct
25 Correct 388 ms 13664 KB Output is correct
26 Correct 407 ms 17720 KB Output is correct
27 Correct 434 ms 22952 KB Output is correct
28 Correct 183 ms 14148 KB Output is correct
29 Correct 358 ms 10132 KB Output is correct
30 Correct 322 ms 12428 KB Output is correct
31 Correct 399 ms 15380 KB Output is correct
32 Correct 389 ms 13896 KB Output is correct
33 Correct 357 ms 11760 KB Output is correct
34 Correct 414 ms 16764 KB Output is correct
35 Correct 435 ms 23004 KB Output is correct
36 Correct 180 ms 10052 KB Output is correct
37 Correct 352 ms 12100 KB Output is correct
38 Correct 366 ms 10184 KB Output is correct
39 Correct 391 ms 13900 KB Output is correct
40 Correct 374 ms 12832 KB Output is correct
41 Correct 207 ms 4428 KB Output is correct
42 Correct 303 ms 4440 KB Output is correct
43 Correct 298 ms 3536 KB Output is correct
44 Correct 578 ms 3332 KB Output is correct
45 Correct 1402 ms 4484 KB Output is correct
46 Correct 721 ms 3592 KB Output is correct
47 Correct 737 ms 3372 KB Output is correct
48 Correct 88 ms 2408 KB Output is correct
49 Correct 53 ms 2588 KB Output is correct
50 Correct 285 ms 4572 KB Output is correct
51 Correct 1146 ms 3860 KB Output is correct
52 Correct 580 ms 3580 KB Output is correct
53 Correct 108 ms 4072 KB Output is correct
54 Correct 472 ms 3264 KB Output is correct
55 Correct 722 ms 3436 KB Output is correct
56 Correct 12 ms 2408 KB Output is correct
57 Correct 194 ms 4072 KB Output is correct
58 Correct 58 ms 2660 KB Output is correct
59 Correct 308 ms 3884 KB Output is correct
60 Correct 435 ms 3376 KB Output is correct
61 Correct 103 ms 3940 KB Output is correct
62 Correct 728 ms 3384 KB Output is correct
63 Correct 736 ms 3404 KB Output is correct
64 Correct 16 ms 2408 KB Output is correct
65 Correct 736 ms 3512 KB Output is correct
66 Correct 738 ms 3308 KB Output is correct
67 Correct 732 ms 3540 KB Output is correct
68 Correct 745 ms 3528 KB Output is correct
69 Correct 742 ms 3512 KB Output is correct
70 Correct 729 ms 3512 KB Output is correct
71 Correct 595 ms 18692 KB Output is correct
72 Correct 806 ms 26928 KB Output is correct
73 Correct 1889 ms 38892 KB Output is correct
74 Execution timed out 2091 ms 37316 KB Time limit exceeded
75 Halted 0 ms 0 KB -