oj.uz

답안 #888006

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
888006 2023-12-15T18:16:02 Z hariaakas646 Snake Escaping (JOI18_snake_escaping) C++14
22 / 100
 365 ms 12628 KB 
#include <bits/stdc++.h>

using namespace std;

#define scd(x) scanf("%d", &x)
#define sclld(x) scanf("%lld", &x)
#define frange(i, n) for(int i=0; i<n; i++)
#define forr(i, l, r) for(int i=l; i<r; i++)
#define all(vec) vec.begin(), vec.end()
#define mp make_pair
#define pb push_back
#define f first
#define s second

typedef long long lli;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vii;
typedef vector<lli> vll;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef set<int> seti;

void usaco() {
	freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
}

void fastio()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}


int main() {
	// usaco();
	fastio();
	int l, q;
	cin >> l >> q;
	string str;
	cin >> str;

	vi mv(1<<l);

	frange(i, 1<<l) {
		mv[i] = str[i] - '0';
	}

	int v = 1;



	frange(i, l) v *= 3;

	vi tot(v);
	vi po3(l+1);
	po3[0] = 1;
	forr(i, 1, l+1) po3[i] = po3[i-1] * 3;
	frange(i, v) {
		int li=0;
		int r = 0;
		int x = 0;
		int k = i;
		bool done = false;
		frange(j, l) {
			if(k % 3 == 1) {
				x += po3[j];
				li += po3[j];
				r += po3[j];
			}
			else if(k % 3 == 2) {
				x += po3[j] * 2;
				if(!done)
					{r += po3[j]; done = true;}
				else {
					li += po3[j] * 2;;
					r += po3[j] * 2;
				}
			}
			k /= 3;
		}
		k = i;
		if(!done) {
			int x2 = 0;
			frange(j, l) {
				if(k % 3 == 1) {
					x2 += (1<<j);
				}
				k /= 3;
			}
			tot[x] = mv[x2];
		}
		else {
			// cout << x << " " << li << " " << r << "\n";
			tot[x] = tot[li] + tot[r];
		}
	}

	frange(_, q) {
		string str;
		cin >> str;
		int v = 0;
		frange(i, l) {
			if(str[l-i-1] == '1') v += po3[i];
			else if(str[l-i-1] == '?') v += 2*po3[i];
		}
		// int to = 0;
		// frange(i, 1<<l) {
		// 	bool done = true;
		// 	frange(j, l) {
		// 		if(str[j] == '?') continue;
		// 		else {
		// 			if(bool(str[j] - '0') != bool(i&(1<<(l-j-1)))) done = false;
		// 		}
		// 	}
		// 	if(done) to += mv[i];
		// }
		// cout << str << " " << v << " ";
		cout << tot[v] << "\n";
	}
}

Compilation message

snake_escaping.cpp: In function 'void usaco()':
snake_escaping.cpp:25:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |  freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 600 KB Output is correct
2 Correct 4 ms 604 KB Output is correct
3 Correct 5 ms 604 KB Output is correct
4 Correct 4 ms 708 KB Output is correct
5 Correct 5 ms 604 KB Output is correct
6 Correct 4 ms 604 KB Output is correct
7 Correct 4 ms 604 KB Output is correct
8 Correct 5 ms 604 KB Output is correct
9 Correct 4 ms 604 KB Output is correct
10 Correct 4 ms 604 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 600 KB Output is correct
2 Correct 4 ms 604 KB Output is correct
3 Correct 5 ms 604 KB Output is correct
4 Correct 4 ms 708 KB Output is correct
5 Correct 5 ms 604 KB Output is correct
6 Correct 4 ms 604 KB Output is correct
7 Correct 4 ms 604 KB Output is correct
8 Correct 5 ms 604 KB Output is correct
9 Correct 4 ms 604 KB Output is correct
10 Correct 4 ms 604 KB Output is correct
11 Correct 182 ms 4596 KB Output is correct
12 Correct 178 ms 4180 KB Output is correct
13 Correct 180 ms 3412 KB Output is correct
14 Correct 180 ms 3520 KB Output is correct
15 Correct 179 ms 4588 KB Output is correct
16 Correct 206 ms 3864 KB Output is correct
17 Correct 201 ms 3784 KB Output is correct
18 Correct 152 ms 5596 KB Output is correct
19 Correct 182 ms 2644 KB Output is correct
20 Correct 173 ms 4136 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 600 KB Output is correct
2 Correct 4 ms 604 KB Output is correct
3 Correct 5 ms 604 KB Output is correct
4 Correct 4 ms 708 KB Output is correct
5 Correct 5 ms 604 KB Output is correct
6 Correct 4 ms 604 KB Output is correct
7 Correct 4 ms 604 KB Output is correct
8 Correct 5 ms 604 KB Output is correct
9 Correct 4 ms 604 KB Output is correct
10 Correct 4 ms 604 KB Output is correct
11 Correct 182 ms 4596 KB Output is correct
12 Correct 178 ms 4180 KB Output is correct
13 Correct 180 ms 3412 KB Output is correct
14 Correct 180 ms 3520 KB Output is correct
15 Correct 179 ms 4588 KB Output is correct
16 Correct 206 ms 3864 KB Output is correct
17 Correct 201 ms 3784 KB Output is correct
18 Correct 152 ms 5596 KB Output is correct
19 Correct 182 ms 2644 KB Output is correct
20 Correct 173 ms 4136 KB Output is correct
21 Correct 302 ms 10576 KB Output is correct
22 Correct 312 ms 10780 KB Output is correct
23 Correct 322 ms 9796 KB Output is correct
24 Correct 332 ms 9656 KB Output is correct
25 Correct 313 ms 11528 KB Output is correct
26 Correct 365 ms 10064 KB Output is correct
27 Correct 336 ms 10068 KB Output is correct
28 Correct 259 ms 12628 KB Output is correct
29 Correct 315 ms 8792 KB Output is correct
30 Correct 310 ms 10828 KB Output is correct
31 Correct 334 ms 10856 KB Output is correct
32 Correct 325 ms 10592 KB Output is correct
33 Correct 321 ms 9552 KB Output is correct
34 Correct 329 ms 9552 KB Output is correct
35 Correct 337 ms 10080 KB Output is correct
36 Correct 256 ms 8528 KB Output is correct
37 Correct 307 ms 10652 KB Output is correct
38 Correct 308 ms 8524 KB Output is correct
39 Correct 336 ms 9808 KB Output is correct
40 Correct 345 ms 9808 KB Output is correct

Subtask #4
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 600 KB Output is correct
2 Correct 4 ms 604 KB Output is correct
3 Correct 5 ms 604 KB Output is correct
4 Correct 4 ms 708 KB Output is correct
5 Correct 5 ms 604 KB Output is correct
6 Correct 4 ms 604 KB Output is correct
7 Correct 4 ms 604 KB Output is correct
8 Correct 5 ms 604 KB Output is correct
9 Correct 4 ms 604 KB Output is correct
10 Correct 4 ms 604 KB Output is correct
11 Runtime error 10 ms 11260 KB Execution killed with signal 6
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 600 KB Output is correct
2 Correct 4 ms 604 KB Output is correct
3 Correct 5 ms 604 KB Output is correct
4 Correct 4 ms 708 KB Output is correct
5 Correct 5 ms 604 KB Output is correct
6 Correct 4 ms 604 KB Output is correct
7 Correct 4 ms 604 KB Output is correct
8 Correct 5 ms 604 KB Output is correct
9 Correct 4 ms 604 KB Output is correct
10 Correct 4 ms 604 KB Output is correct
11 Correct 182 ms 4596 KB Output is correct
12 Correct 178 ms 4180 KB Output is correct
13 Correct 180 ms 3412 KB Output is correct
14 Correct 180 ms 3520 KB Output is correct
15 Correct 179 ms 4588 KB Output is correct
16 Correct 206 ms 3864 KB Output is correct
17 Correct 201 ms 3784 KB Output is correct
18 Correct 152 ms 5596 KB Output is correct
19 Correct 182 ms 2644 KB Output is correct
20 Correct 173 ms 4136 KB Output is correct
21 Correct 302 ms 10576 KB Output is correct
22 Correct 312 ms 10780 KB Output is correct
23 Correct 322 ms 9796 KB Output is correct
24 Correct 332 ms 9656 KB Output is correct
25 Correct 313 ms 11528 KB Output is correct
26 Correct 365 ms 10064 KB Output is correct
27 Correct 336 ms 10068 KB Output is correct
28 Correct 259 ms 12628 KB Output is correct
29 Correct 315 ms 8792 KB Output is correct
30 Correct 310 ms 10828 KB Output is correct
31 Correct 334 ms 10856 KB Output is correct
32 Correct 325 ms 10592 KB Output is correct
33 Correct 321 ms 9552 KB Output is correct
34 Correct 329 ms 9552 KB Output is correct
35 Correct 337 ms 10080 KB Output is correct
36 Correct 256 ms 8528 KB Output is correct
37 Correct 307 ms 10652 KB Output is correct
38 Correct 308 ms 8524 KB Output is correct
39 Correct 336 ms 9808 KB Output is correct
40 Correct 345 ms 9808 KB Output is correct
41 Runtime error 10 ms 11260 KB Execution killed with signal 6
42 Halted 0 ms 0 KB -