oj.uz

답안 #1073513

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1073513 2024-08-24T15:35:44 Z Requiem Snake Escaping (JOI18_snake_escaping) C++17
58 / 100
 2000 ms 19280 KB 
#include<bits/stdc++.h>
#define int long long
#define TASKNAME "snake"
#define FOR(i, a, b) for(int i = a; i <= b; i++)
#define FORD(i, a, b) for(int i = a; i >= b; i--)
#define fi first
#define fast ios_base::sync_with_stdio(NULL), cin.tie(NULL), cout.tie(NULL)
#define se second
#define pb push_back
#define MASK(i) (1LL << i) //2^i
#define BIT(x, i) (((x) >> (i))&1) //lay bit thu i cua i

using namespace std;
typedef pair<int, int> ii;
/**
Cho n = 2^L - 1 va q truy van:
Voi truy van thu i. Ta duoc 1 chuoi str gom ?, 0, 1:
1 mask goi la khop neu khi ta so tung vi tri thi str[i] bang '?' hoac mask[i] == str[i].

subtask 1: L <= 10, n <= 1000.
subtask 2: L <= 13.
subtask 3: L <= 15
subtask 4: Q <= 50000
subtask 5: L <= 20, Q <= 1000000

Gọi X là số dấu ?
Nếu X <= 10 thì ta bruteforce.
Nếu X > 10 thì ta sẽ có tối đa 9 số. Thì ta sẽ dùng bao hàm bù trừ kết hợp dp SOS để tính nhanh.
**/

const int MAX = MASK(20);
int dp[MAX], val[MAX];
char query[21];
int lengthBit;
int numQuery;
namespace subtask5{
    bool check(){
        return true;
    }
    vector<int> hidden;
    vector<int> number;
    int ans = 0, mask1 = 0, mask2 = 0;

    void bruteforce(int pos){
        if (pos == hidden.size()){
            ans += val[mask1];
            return;
        }

        bruteforce(pos + 1);

        mask1 ^= (1LL << hidden[pos]);
        bruteforce(pos + 1);
        mask1 ^= (1LL << hidden[pos]);
    }

    void calc2(int pos, int val){
        if (pos == number.size()){
            ans += dp[mask2] * ((val&1) ? (-1) : (1));
            return;
        }
        calc2(pos + 1, val + 1);

        mask2 ^= (1LL << number[pos]);
        calc2(pos + 1, val);
        mask2 ^= (1LL << number[pos]);
    }
    void solve(){
        FOR(i, 0, numQuery - 1){
            mask1 = 0, mask2 = 0, ans = 0;
            FORD(j, lengthBit - 1, 0){
                cin >> query[j];
                if (query[j] == '?') hidden.pb(j), mask2 ^= (1LL << j);
                else if (query[j] == '1') number.pb(j), mask1 ^= (1 << j);

            }
            if (hidden.size() <= 10){
                bruteforce(0);
                printf("%lld\n", ans);
            }
            else {
                calc2(0, 0);
                printf("%lld\n", ans);
            }
            number.clear();
            hidden.clear();
        }
    }
}
main(){
    fast;
    if (fopen(TASKNAME".inp","r")){
        freopen(TASKNAME".inp","r",stdin);
        freopen(TASKNAME".out","w",stdout);
    }
    cin >> lengthBit >> numQuery;
    FOR(i, 0, MASK(lengthBit) - 1){
        char c;
        cin >> c;
        val[i] = (c - '0');
        dp[i] += (c - '0');
    }

    FOR(j, 0, lengthBit - 1){
        FOR(i, 0, MASK(lengthBit) - 1){
            if (i & (1 << j)) dp[i] += dp[i ^ (1 << j)];
        }
    }

//    FOR(i, 0, MASK(lengthBit) - 1) printf("%lld\n", dp[i]);

    if (subtask5::check()) return subtask5::solve(), 0;

}

Compilation message

snake_escaping.cpp: In function 'void subtask5::bruteforce(long long int)':
snake_escaping.cpp:45:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         if (pos == hidden.size()){
      |             ~~~~^~~~~~~~~~~~~~~~
snake_escaping.cpp: In function 'void subtask5::calc2(long long int, long long int)':
snake_escaping.cpp:58:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |         if (pos == number.size()){
      |             ~~~~^~~~~~~~~~~~~~~~
snake_escaping.cpp: At global scope:
snake_escaping.cpp:90:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   90 | main(){
      | ^~~~
snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:93:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   93 |         freopen(TASKNAME".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
snake_escaping.cpp:94:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   94 |         freopen(TASKNAME".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 7 ms 2528 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 2 ms 2392 KB Output is correct
11 Correct 377 ms 17052 KB Output is correct
12 Correct 578 ms 16952 KB Output is correct
13 Correct 269 ms 15964 KB Output is correct
14 Correct 312 ms 16212 KB Output is correct
15 Correct 568 ms 17232 KB Output is correct
16 Correct 398 ms 16316 KB Output is correct
17 Correct 353 ms 16212 KB Output is correct
18 Execution timed out 2044 ms 8376 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 7 ms 2528 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 2 ms 2392 KB Output is correct
11 Correct 377 ms 17052 KB Output is correct
12 Correct 578 ms 16952 KB Output is correct
13 Correct 269 ms 15964 KB Output is correct
14 Correct 312 ms 16212 KB Output is correct
15 Correct 568 ms 17232 KB Output is correct
16 Correct 398 ms 16316 KB Output is correct
17 Correct 353 ms 16212 KB Output is correct
18 Execution timed out 2044 ms 8376 KB Time limit exceeded
19 Halted 0 ms 0 KB -

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 7 ms 2528 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 2 ms 2392 KB Output is correct
11 Correct 389 ms 17752 KB Output is correct
12 Correct 156 ms 19076 KB Output is correct
13 Correct 85 ms 19076 KB Output is correct
14 Correct 96 ms 19280 KB Output is correct
15 Correct 48 ms 19148 KB Output is correct
16 Correct 127 ms 19032 KB Output is correct
17 Correct 115 ms 19024 KB Output is correct
18 Correct 34 ms 19280 KB Output is correct
19 Correct 45 ms 18936 KB Output is correct
20 Correct 210 ms 19024 KB Output is correct
21 Correct 381 ms 19156 KB Output is correct
22 Correct 115 ms 19052 KB Output is correct
23 Correct 58 ms 19024 KB Output is correct
24 Correct 70 ms 19028 KB Output is correct
25 Correct 119 ms 18884 KB Output is correct
26 Correct 65 ms 18768 KB Output is correct
27 Correct 399 ms 19168 KB Output is correct
28 Correct 77 ms 18768 KB Output is correct
29 Correct 64 ms 19024 KB Output is correct
30 Correct 70 ms 18864 KB Output is correct
31 Correct 52 ms 19028 KB Output is correct
32 Correct 126 ms 18948 KB Output is correct
33 Correct 105 ms 19060 KB Output is correct
34 Correct 32 ms 18768 KB Output is correct
35 Correct 122 ms 19024 KB Output is correct
36 Correct 124 ms 18940 KB Output is correct
37 Correct 117 ms 19028 KB Output is correct
38 Correct 119 ms 18896 KB Output is correct
39 Correct 121 ms 19056 KB Output is correct
40 Correct 127 ms 19028 KB Output is correct

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 7 ms 2528 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 2 ms 2392 KB Output is correct
11 Correct 377 ms 17052 KB Output is correct
12 Correct 578 ms 16952 KB Output is correct
13 Correct 269 ms 15964 KB Output is correct
14 Correct 312 ms 16212 KB Output is correct
15 Correct 568 ms 17232 KB Output is correct
16 Correct 398 ms 16316 KB Output is correct
17 Correct 353 ms 16212 KB Output is correct
18 Execution timed out 2044 ms 8376 KB Time limit exceeded
19 Halted 0 ms 0 KB -