oj.uz

답안 #619788

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
619788 2022-08-02T15:51:56 Z Do_you_copy Snake Escaping (JOI18_snake_escaping) C++17
22 / 100
 2000 ms 13836 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define taskname "test"
#define fi first
#define se second
#define pb push_back
#define faster ios_base::sync_with_stdio(0); cin.tie(0);
using namespace std;
using ll = long long;
using ull = unsigned ll;
using ld = long double;
using pii = pair <int, int>;
using pil = pair <int, ll>;
using pli = pair <ll, int>;
using pll = pair <ll, ll>;
mt19937 Rand(chrono::steady_clock::now().time_since_epoch().count());

ll min(const ll &a, const ll &b){
    return (a < b) ? a : b;
}

ll max(const ll &a, const ll &b){
    return (a > b) ? a : b;
}

//const ll Mod = 1000000007;
//const ll Mod2 = 999999999989;
//only use when required
const int maxN = 20;

int n, q;
string s, t;
int dp[(1 << maxN) + 2];
int f[(1 << maxN) + 2];

void WriteInt(int x)
{
    if (x > 9)
        WriteInt(x / 10);
    putchar(x % 10 + '0');
}

inline int inv(int i){
    return ((1 << n) - 1) ^ i;
}


void Init(){
    cin >> n >> q >> s;
    for (int i = 0; i < int(s.length()); ++i){
        dp[i] = s[i] - '0';
        f[inv(i)] = dp[i];
    }
    for (int i = 0; i < n; ++i){
        for (int j = 1; j < 1 << n; ++j){
            if (j & (1 << i)){
                dp[j] += dp[j ^ (1 << i)];
            }
        }
    }
    for (int i = 0; i < n; ++i){
        for (int j = 0; j < 1 << n; ++j){
            if (j & (1 << i)){
                f[j] += f[j ^ (1 << i)];
            }
        }
    }
    int x, y, z;
    int mask1, mask0, tem;
    while (q--){
        cin >> t;
        x = y = z = mask1 = mask0 = tem = 0;
        vector <int> val((1 << n) + 1, 0);
        reverse(t.begin(), t.end());
        for (int i = 0; i < n; ++i){
            if (t[i] == '0') ++x, mask0 ^= 1 << i;
            if (t[i] == '1') ++y, mask1 ^= 1 << i;
            if (t[i] == '?') ++z, tem ^= 1 << i;
        }
        if (z <= n / 3){
            //brute all ?s
            int ans = s[mask1] - '0';
            for (int i = tem; i; i = (i - 1) & tem){
                ans += s[i + mask1] - '0';
            }
            WriteInt(ans);
            putchar('\n');
        }
        else if (x <= n / 3){
            int ans = -f[tem];
            for (int i = mask0; i; i = (i - 1) & mask0){
                bool cnt = __builtin_parity(i);
                if (cnt) ans += f[i + tem];
                else ans -= f[i + tem];
            }
            ans = abs(ans);
            WriteInt(ans);
            putchar('\n');
        }
        else{
            int ans = -dp[tem];
            for (int i = mask1; i; i = (i - 1) & mask1){
                bool cnt = __builtin_parity(i);
                if (cnt) ans += dp[i + tem];
                else ans -= dp[i + tem];
            }
            ans = abs(ans);
            WriteInt(ans);
            putchar('\n');
        }
    }
}


int main(){
    if (fopen(taskname".inp", "r")){
        freopen(taskname".inp", "r", stdin);
        //freopen(taskname".out", "w", stdout);
    }
    faster;
    ll tt = 1;
    //cin >> tt;
    while (tt--){
        Init();
    }
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:118:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  118 |         freopen(taskname".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 289 ms 4240 KB Output is correct
12 Correct 304 ms 3916 KB Output is correct
13 Correct 345 ms 3192 KB Output is correct
14 Correct 311 ms 3368 KB Output is correct
15 Correct 301 ms 4276 KB Output is correct
16 Correct 344 ms 3468 KB Output is correct
17 Correct 313 ms 3456 KB Output is correct
18 Correct 276 ms 5324 KB Output is correct
19 Correct 276 ms 2292 KB Output is correct
20 Correct 336 ms 3928 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 289 ms 4240 KB Output is correct
12 Correct 304 ms 3916 KB Output is correct
13 Correct 345 ms 3192 KB Output is correct
14 Correct 311 ms 3368 KB Output is correct
15 Correct 301 ms 4276 KB Output is correct
16 Correct 344 ms 3468 KB Output is correct
17 Correct 313 ms 3456 KB Output is correct
18 Correct 276 ms 5324 KB Output is correct
19 Correct 276 ms 2292 KB Output is correct
20 Correct 336 ms 3928 KB Output is correct
21 Correct 1010 ms 4468 KB Output is correct
22 Correct 1070 ms 4620 KB Output is correct
23 Correct 1102 ms 3656 KB Output is correct
24 Correct 1148 ms 3392 KB Output is correct
25 Correct 1096 ms 5416 KB Output is correct
26 Correct 1109 ms 3944 KB Output is correct
27 Correct 1127 ms 3824 KB Output is correct
28 Correct 934 ms 6416 KB Output is correct
29 Correct 965 ms 2336 KB Output is correct
30 Correct 989 ms 4492 KB Output is correct
31 Correct 1037 ms 4436 KB Output is correct
32 Correct 1020 ms 4452 KB Output is correct
33 Correct 1046 ms 3332 KB Output is correct
34 Correct 1096 ms 3424 KB Output is correct
35 Correct 1070 ms 3844 KB Output is correct
36 Correct 962 ms 2400 KB Output is correct
37 Correct 990 ms 4412 KB Output is correct
38 Correct 979 ms 2524 KB Output is correct
39 Correct 1034 ms 3596 KB Output is correct
40 Correct 1070 ms 3476 KB Output is correct

Subtask #4
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Execution timed out 2078 ms 13836 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 289 ms 4240 KB Output is correct
12 Correct 304 ms 3916 KB Output is correct
13 Correct 345 ms 3192 KB Output is correct
14 Correct 311 ms 3368 KB Output is correct
15 Correct 301 ms 4276 KB Output is correct
16 Correct 344 ms 3468 KB Output is correct
17 Correct 313 ms 3456 KB Output is correct
18 Correct 276 ms 5324 KB Output is correct
19 Correct 276 ms 2292 KB Output is correct
20 Correct 336 ms 3928 KB Output is correct
21 Correct 1010 ms 4468 KB Output is correct
22 Correct 1070 ms 4620 KB Output is correct
23 Correct 1102 ms 3656 KB Output is correct
24 Correct 1148 ms 3392 KB Output is correct
25 Correct 1096 ms 5416 KB Output is correct
26 Correct 1109 ms 3944 KB Output is correct
27 Correct 1127 ms 3824 KB Output is correct
28 Correct 934 ms 6416 KB Output is correct
29 Correct 965 ms 2336 KB Output is correct
30 Correct 989 ms 4492 KB Output is correct
31 Correct 1037 ms 4436 KB Output is correct
32 Correct 1020 ms 4452 KB Output is correct
33 Correct 1046 ms 3332 KB Output is correct
34 Correct 1096 ms 3424 KB Output is correct
35 Correct 1070 ms 3844 KB Output is correct
36 Correct 962 ms 2400 KB Output is correct
37 Correct 990 ms 4412 KB Output is correct
38 Correct 979 ms 2524 KB Output is correct
39 Correct 1034 ms 3596 KB Output is correct
40 Correct 1070 ms 3476 KB Output is correct
41 Execution timed out 2078 ms 13836 KB Time limit exceeded
42 Halted 0 ms 0 KB -