oj.uz

답안 #521628

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
521628 2022-02-02T15:26:07 Z AdamGS Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 2000 ms 38740 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];
	}
	zero.clear();
	zans.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]);
			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 2 ms 332 KB Output is correct
6 Correct 2 ms 332 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

# 결과 실행 시간 메모리 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 332 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 313 ms 12084 KB Output is correct
12 Correct 355 ms 11808 KB Output is correct
13 Correct 368 ms 11188 KB Output is correct
14 Correct 357 ms 11188 KB Output is correct
15 Correct 344 ms 12152 KB Output is correct
16 Correct 350 ms 11588 KB Output is correct
17 Correct 365 ms 12024 KB Output is correct
18 Correct 187 ms 13112 KB Output is correct
19 Correct 339 ms 10164 KB Output is correct
20 Correct 323 ms 11720 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 2 ms 332 KB Output is correct
6 Correct 2 ms 332 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 313 ms 12084 KB Output is correct
12 Correct 355 ms 11808 KB Output is correct
13 Correct 368 ms 11188 KB Output is correct
14 Correct 357 ms 11188 KB Output is correct
15 Correct 344 ms 12152 KB Output is correct
16 Correct 350 ms 11588 KB Output is correct
17 Correct 365 ms 12024 KB Output is correct
18 Correct 187 ms 13112 KB Output is correct
19 Correct 339 ms 10164 KB Output is correct
20 Correct 323 ms 11720 KB Output is correct
21 Correct 336 ms 12236 KB Output is correct
22 Correct 411 ms 12484 KB Output is correct
23 Correct 399 ms 14176 KB Output is correct
24 Correct 406 ms 12836 KB Output is correct
25 Correct 393 ms 13796 KB Output is correct
26 Correct 409 ms 17608 KB Output is correct
27 Correct 433 ms 22912 KB Output is correct
28 Correct 195 ms 14148 KB Output is correct
29 Correct 358 ms 10180 KB Output is correct
30 Correct 338 ms 12612 KB Output is correct
31 Correct 413 ms 15252 KB Output is correct
32 Correct 403 ms 13952 KB Output is correct
33 Correct 371 ms 11528 KB Output is correct
34 Correct 416 ms 16556 KB Output is correct
35 Correct 446 ms 23004 KB Output is correct
36 Correct 185 ms 10052 KB Output is correct
37 Correct 366 ms 12120 KB Output is correct
38 Correct 375 ms 10180 KB Output is correct
39 Correct 402 ms 13916 KB Output is correct
40 Correct 387 ms 12816 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 2 ms 332 KB Output is correct
6 Correct 2 ms 332 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 208 ms 4388 KB Output is correct
12 Correct 304 ms 4444 KB Output is correct
13 Correct 293 ms 3548 KB Output is correct
14 Correct 571 ms 3444 KB Output is correct
15 Correct 1407 ms 4576 KB Output is correct
16 Correct 716 ms 3508 KB Output is correct
17 Correct 730 ms 3444 KB Output is correct
18 Correct 86 ms 2408 KB Output is correct
19 Correct 53 ms 2684 KB Output is correct
20 Correct 289 ms 4580 KB Output is correct
21 Correct 1145 ms 3720 KB Output is correct
22 Correct 585 ms 3584 KB Output is correct
23 Correct 111 ms 4092 KB Output is correct
24 Correct 479 ms 3440 KB Output is correct
25 Correct 740 ms 3404 KB Output is correct
26 Correct 15 ms 2408 KB Output is correct
27 Correct 196 ms 4100 KB Output is correct
28 Correct 59 ms 2704 KB Output is correct
29 Correct 316 ms 4000 KB Output is correct
30 Correct 446 ms 3320 KB Output is correct
31 Correct 105 ms 4052 KB Output is correct
32 Correct 725 ms 3352 KB Output is correct
33 Correct 729 ms 3428 KB Output is correct
34 Correct 13 ms 2408 KB Output is correct
35 Correct 732 ms 3428 KB Output is correct
36 Correct 733 ms 3384 KB Output is correct
37 Correct 738 ms 3512 KB Output is correct
38 Correct 721 ms 3672 KB Output is correct
39 Correct 742 ms 3408 KB Output is correct
40 Correct 748 ms 3628 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 2 ms 332 KB Output is correct
6 Correct 2 ms 332 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 313 ms 12084 KB Output is correct
12 Correct 355 ms 11808 KB Output is correct
13 Correct 368 ms 11188 KB Output is correct
14 Correct 357 ms 11188 KB Output is correct
15 Correct 344 ms 12152 KB Output is correct
16 Correct 350 ms 11588 KB Output is correct
17 Correct 365 ms 12024 KB Output is correct
18 Correct 187 ms 13112 KB Output is correct
19 Correct 339 ms 10164 KB Output is correct
20 Correct 323 ms 11720 KB Output is correct
21 Correct 336 ms 12236 KB Output is correct
22 Correct 411 ms 12484 KB Output is correct
23 Correct 399 ms 14176 KB Output is correct
24 Correct 406 ms 12836 KB Output is correct
25 Correct 393 ms 13796 KB Output is correct
26 Correct 409 ms 17608 KB Output is correct
27 Correct 433 ms 22912 KB Output is correct
28 Correct 195 ms 14148 KB Output is correct
29 Correct 358 ms 10180 KB Output is correct
30 Correct 338 ms 12612 KB Output is correct
31 Correct 413 ms 15252 KB Output is correct
32 Correct 403 ms 13952 KB Output is correct
33 Correct 371 ms 11528 KB Output is correct
34 Correct 416 ms 16556 KB Output is correct
35 Correct 446 ms 23004 KB Output is correct
36 Correct 185 ms 10052 KB Output is correct
37 Correct 366 ms 12120 KB Output is correct
38 Correct 375 ms 10180 KB Output is correct
39 Correct 402 ms 13916 KB Output is correct
40 Correct 387 ms 12816 KB Output is correct
41 Correct 208 ms 4388 KB Output is correct
42 Correct 304 ms 4444 KB Output is correct
43 Correct 293 ms 3548 KB Output is correct
44 Correct 571 ms 3444 KB Output is correct
45 Correct 1407 ms 4576 KB Output is correct
46 Correct 716 ms 3508 KB Output is correct
47 Correct 730 ms 3444 KB Output is correct
48 Correct 86 ms 2408 KB Output is correct
49 Correct 53 ms 2684 KB Output is correct
50 Correct 289 ms 4580 KB Output is correct
51 Correct 1145 ms 3720 KB Output is correct
52 Correct 585 ms 3584 KB Output is correct
53 Correct 111 ms 4092 KB Output is correct
54 Correct 479 ms 3440 KB Output is correct
55 Correct 740 ms 3404 KB Output is correct
56 Correct 15 ms 2408 KB Output is correct
57 Correct 196 ms 4100 KB Output is correct
58 Correct 59 ms 2704 KB Output is correct
59 Correct 316 ms 4000 KB Output is correct
60 Correct 446 ms 3320 KB Output is correct
61 Correct 105 ms 4052 KB Output is correct
62 Correct 725 ms 3352 KB Output is correct
63 Correct 729 ms 3428 KB Output is correct
64 Correct 13 ms 2408 KB Output is correct
65 Correct 732 ms 3428 KB Output is correct
66 Correct 733 ms 3384 KB Output is correct
67 Correct 738 ms 3512 KB Output is correct
68 Correct 721 ms 3672 KB Output is correct
69 Correct 742 ms 3408 KB Output is correct
70 Correct 748 ms 3628 KB Output is correct
71 Correct 604 ms 18584 KB Output is correct
72 Correct 815 ms 26948 KB Output is correct
73 Correct 1900 ms 38740 KB Output is correct
74 Execution timed out 2088 ms 37208 KB Time limit exceeded
75 Halted 0 ms 0 KB -