oj.uz

Submission #256789

# Submission time Handle Problem Language Result Execution time Memory
256789 2020-08-03T08:05:11 Z 문홍윤(#5040) Snake Escaping (JOI18_snake_escaping) C++17
12 / 100
 2000 ms 5752 KB 
#include <bits/stdc++.h>
#define eb emplace_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define svec(x) sort(x.begin(), x.end())
#define press(x) x.erase(unique(x.begin(), x.end()), x.end())
#define lb(x, v) lower_bound(x.begin(), x.end(), v)
#define ub(x, v) upper_bound(x.begin(), x.end(), v)
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef pair<int, LL> pil;
typedef pair<LL, int> pli;
const LL llinf=2000000000000000000;
const LL mod1=1000000007;
const LL mod2=998244353;
const int inf=2000000000;

int n, q, ans[60010];
char str[1100000];
int arr[1100000];
char qu[30];

int main(){
    scanf("%d %d", &n, &q);
    scanf("%s", str);
    int len=strlen(str);
    for(int i=0; i<len; i++)arr[i]=(int)(str[i]-'0');
    int pw=1;
    for(int i=1; i<=n; i++)pw*=3;
    for(int u=0; u<pw; u++){
        int tmp=u;
        for(int i=n; i>=1; i--){
            if(tmp%3==0)qu[i]='0';
            if(tmp%3==1)qu[i]='1';
            if(tmp%3==2)qu[i]='?';
            tmp/=3;
        }
        for(int i=0; i<(1<<n); i++){
            bool flg=true;
            for(int j=1; j<=n; j++){
                if(qu[j]=='?')continue;
                if(qu[j]=='0'&&(i&(1<<n-j)))flg=false;
                if(qu[j]=='1'&&(i&(1<<n-j))==0)flg=false;
            }
            if(flg)ans[u]+=arr[i];
        }
    }
    for(int u=1; u<=q; u++){
        memset(qu, 0, sizeof qu);
        scanf("%s", qu+1);
        int nw=0;
        for(int i=1; i<=n; i++){
            nw*=3;
            if(qu[i]=='1')nw++;
            if(qu[i]=='?')nw+=2;
        }
        printf("%d\n", ans[nw]);
    }
}

Compilation message

snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:46:40: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
                 if(qu[j]=='0'&&(i&(1<<n-j)))flg=false;
                                       ~^~
snake_escaping.cpp:47:40: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
                 if(qu[j]=='1'&&(i&(1<<n-j))==0)flg=false;
                                       ~^~
snake_escaping.cpp:28:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &q);
     ~~~~~^~~~~~~~~~~~~~~~~
snake_escaping.cpp:29:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s", str);
     ~~~~~^~~~~~~~~~~
snake_escaping.cpp:54:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%s", qu+1);
         ~~~~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 856 ms 632 KB Output is correct
2 Correct 866 ms 888 KB Output is correct
3 Correct 860 ms 760 KB Output is correct
4 Correct 855 ms 684 KB Output is correct
5 Correct 857 ms 760 KB Output is correct
6 Correct 860 ms 504 KB Output is correct
7 Correct 860 ms 624 KB Output is correct
8 Correct 859 ms 760 KB Output is correct
9 Correct 857 ms 888 KB Output is correct
10 Correct 894 ms 632 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 856 ms 632 KB Output is correct
2 Correct 866 ms 888 KB Output is correct
3 Correct 860 ms 760 KB Output is correct
4 Correct 855 ms 684 KB Output is correct
5 Correct 857 ms 760 KB Output is correct
6 Correct 860 ms 504 KB Output is correct
7 Correct 860 ms 624 KB Output is correct
8 Correct 859 ms 760 KB Output is correct
9 Correct 857 ms 888 KB Output is correct
10 Correct 894 ms 632 KB Output is correct
11 Correct 1146 ms 4640 KB Output is correct
12 Correct 1114 ms 4340 KB Output is correct
13 Correct 1140 ms 3604 KB Output is correct
14 Correct 1137 ms 3728 KB Output is correct
15 Correct 1134 ms 4812 KB Output is correct
16 Correct 1158 ms 3704 KB Output is correct
17 Correct 1154 ms 3832 KB Output is correct
18 Correct 1116 ms 5752 KB Output is correct
19 Correct 1147 ms 2680 KB Output is correct
20 Correct 1155 ms 4344 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 856 ms 632 KB Output is correct
2 Correct 866 ms 888 KB Output is correct
3 Correct 860 ms 760 KB Output is correct
4 Correct 855 ms 684 KB Output is correct
5 Correct 857 ms 760 KB Output is correct
6 Correct 860 ms 504 KB Output is correct
7 Correct 860 ms 624 KB Output is correct
8 Correct 859 ms 760 KB Output is correct
9 Correct 857 ms 888 KB Output is correct
10 Correct 894 ms 632 KB Output is correct
11 Correct 1146 ms 4640 KB Output is correct
12 Correct 1114 ms 4340 KB Output is correct
13 Correct 1140 ms 3604 KB Output is correct
14 Correct 1137 ms 3728 KB Output is correct
15 Correct 1134 ms 4812 KB Output is correct
16 Correct 1158 ms 3704 KB Output is correct
17 Correct 1154 ms 3832 KB Output is correct
18 Correct 1116 ms 5752 KB Output is correct
19 Correct 1147 ms 2680 KB Output is correct
20 Correct 1155 ms 4344 KB Output is correct
21 Execution timed out 2083 ms 1060 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 856 ms 632 KB Output is correct
2 Correct 866 ms 888 KB Output is correct
3 Correct 860 ms 760 KB Output is correct
4 Correct 855 ms 684 KB Output is correct
5 Correct 857 ms 760 KB Output is correct
6 Correct 860 ms 504 KB Output is correct
7 Correct 860 ms 624 KB Output is correct
8 Correct 859 ms 760 KB Output is correct
9 Correct 857 ms 888 KB Output is correct
10 Correct 894 ms 632 KB Output is correct
11 Execution timed out 2068 ms 5376 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 856 ms 632 KB Output is correct
2 Correct 866 ms 888 KB Output is correct
3 Correct 860 ms 760 KB Output is correct
4 Correct 855 ms 684 KB Output is correct
5 Correct 857 ms 760 KB Output is correct
6 Correct 860 ms 504 KB Output is correct
7 Correct 860 ms 624 KB Output is correct
8 Correct 859 ms 760 KB Output is correct
9 Correct 857 ms 888 KB Output is correct
10 Correct 894 ms 632 KB Output is correct
11 Correct 1146 ms 4640 KB Output is correct
12 Correct 1114 ms 4340 KB Output is correct
13 Correct 1140 ms 3604 KB Output is correct
14 Correct 1137 ms 3728 KB Output is correct
15 Correct 1134 ms 4812 KB Output is correct
16 Correct 1158 ms 3704 KB Output is correct
17 Correct 1154 ms 3832 KB Output is correct
18 Correct 1116 ms 5752 KB Output is correct
19 Correct 1147 ms 2680 KB Output is correct
20 Correct 1155 ms 4344 KB Output is correct
21 Execution timed out 2083 ms 1060 KB Time limit exceeded
22 Halted 0 ms 0 KB -