답안 #80207 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
80207	2018-10-19T14:29:04 Z	Bodo171	Snake Escaping (JOI18_snake_escaping)	C++14	65 / 100	2000 ms	13640 KB

snake_escaping

#include <iostream>
#include <fstream>
using namespace std;
const int nmax=(1<<20)+5;
string s,str;
char t;
char pc[nmax],v[nmax];
int sub[nmax],supra[nmax];
int l,q,i,j,m0,m1,mq,mn,ans;
bool brk;
int main()
{
   // freopen("data.in","r",stdin);
    ios_base::sync_with_stdio(false);
    cin>>l>>q;
    getline(cin,str);
    getline(cin,str);
    for(i=0;i<(1<<l);i++)
    {
        if(i!=0)
            pc[i]=pc[(i&(i-1))]+1;
        sub[i]=supra[i]=v[i]=str[i]-'0';
    }
    for(i=0;i<l;i++)
        for(j=0;j<(1<<l);j++)
           if(((1<<i)&j))
              sub[j]+=sub[(j^(1<<i))];
            else supra[j]+=supra[(j^(1<<i))];
    for(int cnt=1;cnt<=q;cnt++)
    {
        cin>>s;
        m0=m1=mq=0;
        for(j=l-1;j>=0;j--)
        {
            t=s[l-1-j];
            if(t=='0') m0+=(1<<j);
            if(t=='1') m1+=(1<<j);
            if(t=='?') mq+=(1<<j);
        }
        mn=min(min(pc[m0],pc[m1]),pc[mq]);
        ans=0;brk=0;
        if(mn==pc[m0])
        {
            ans=supra[m1];
            i=m0;
            while(i!=0)
            {
                if((pc[i]&1)) ans-=supra[(i|m1)];
                else ans+=supra[(i|m1)];
                i=((i-1)&m0);
            }
        }
        else
        {
            if(mn==pc[m1])
            {
                i=m1;
                while(!brk)
                {
                    if(i==0)
                        brk=1;
                    if(((pc[m1]-pc[i])&1)) ans-=sub[(i|mq)];
                    else ans+=sub[(i|mq)];
                    i=((i-1)&m1);
                }
            }
            else
            {
                    i=mq;
                    while(!brk)
                    {
                        ans+=v[(m1|i)];
                        if(i==0)
                            brk=1;
                        i=((i-1)&mq);
                    }
            }
        }
        cout<<ans<<'\n';
    }
    return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	376 KB	Output is correct
2	Correct	4 ms	520 KB	Output is correct
3	Correct	4 ms	520 KB	Output is correct
4	Correct	4 ms	520 KB	Output is correct
5	Correct	4 ms	520 KB	Output is correct
6	Correct	5 ms	520 KB	Output is correct
7	Correct	4 ms	712 KB	Output is correct
8	Correct	4 ms	712 KB	Output is correct
9	Correct	4 ms	712 KB	Output is correct
10	Correct	4 ms	712 KB	Output is correct
11	Correct	1756 ms	4968 KB	Output is correct
12	Correct	1755 ms	4968 KB	Output is correct
13	Correct	1880 ms	4968 KB	Output is correct
14	Correct	1851 ms	4968 KB	Output is correct
15	Correct	1818 ms	5356 KB	Output is correct
16	Correct	1917 ms	5356 KB	Output is correct
17	Correct	1887 ms	5356 KB	Output is correct
18	Correct	1815 ms	6400 KB	Output is correct
19	Correct	1818 ms	6400 KB	Output is correct
20	Correct	1858 ms	6400 KB	Output is correct

Subtask #3
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	376 KB	Output is correct
2	Correct	4 ms	520 KB	Output is correct
3	Correct	4 ms	520 KB	Output is correct
4	Correct	4 ms	520 KB	Output is correct
5	Correct	4 ms	520 KB	Output is correct
6	Correct	5 ms	520 KB	Output is correct
7	Correct	4 ms	712 KB	Output is correct
8	Correct	4 ms	712 KB	Output is correct
9	Correct	4 ms	712 KB	Output is correct
10	Correct	4 ms	712 KB	Output is correct
11	Correct	1756 ms	4968 KB	Output is correct
12	Correct	1755 ms	4968 KB	Output is correct
13	Correct	1880 ms	4968 KB	Output is correct
14	Correct	1851 ms	4968 KB	Output is correct
15	Correct	1818 ms	5356 KB	Output is correct
16	Correct	1917 ms	5356 KB	Output is correct
17	Correct	1887 ms	5356 KB	Output is correct
18	Correct	1815 ms	6400 KB	Output is correct
19	Correct	1818 ms	6400 KB	Output is correct
20	Correct	1858 ms	6400 KB	Output is correct
21	Correct	1825 ms	6400 KB	Output is correct
22	Execution timed out	2017 ms	6400 KB	Time limit exceeded
23	Halted	0 ms	0 KB	-

Subtask #4
53.0 / 53.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	376 KB	Output is correct
2	Correct	4 ms	520 KB	Output is correct
3	Correct	4 ms	520 KB	Output is correct
4	Correct	4 ms	520 KB	Output is correct
5	Correct	4 ms	520 KB	Output is correct
6	Correct	5 ms	520 KB	Output is correct
7	Correct	4 ms	712 KB	Output is correct
8	Correct	4 ms	712 KB	Output is correct
9	Correct	4 ms	712 KB	Output is correct
10	Correct	4 ms	712 KB	Output is correct
11	Correct	160 ms	13196 KB	Output is correct
12	Correct	150 ms	13200 KB	Output is correct
13	Correct	149 ms	13200 KB	Output is correct
14	Correct	159 ms	13276 KB	Output is correct
15	Correct	143 ms	13276 KB	Output is correct
16	Correct	168 ms	13276 KB	Output is correct
17	Correct	160 ms	13276 KB	Output is correct
18	Correct	128 ms	13340 KB	Output is correct
19	Correct	139 ms	13340 KB	Output is correct
20	Correct	144 ms	13340 KB	Output is correct
21	Correct	155 ms	13340 KB	Output is correct
22	Correct	159 ms	13340 KB	Output is correct
23	Correct	138 ms	13340 KB	Output is correct
24	Correct	167 ms	13340 KB	Output is correct
25	Correct	181 ms	13340 KB	Output is correct
26	Correct	138 ms	13340 KB	Output is correct
27	Correct	145 ms	13340 KB	Output is correct
28	Correct	161 ms	13340 KB	Output is correct
29	Correct	148 ms	13340 KB	Output is correct
30	Correct	150 ms	13340 KB	Output is correct
31	Correct	145 ms	13340 KB	Output is correct
32	Correct	175 ms	13340 KB	Output is correct
33	Correct	167 ms	13340 KB	Output is correct
34	Correct	160 ms	13340 KB	Output is correct
35	Correct	168 ms	13620 KB	Output is correct
36	Correct	161 ms	13620 KB	Output is correct
37	Correct	158 ms	13620 KB	Output is correct
38	Correct	157 ms	13620 KB	Output is correct
39	Correct	160 ms	13640 KB	Output is correct
40	Correct	156 ms	13640 KB	Output is correct

Subtask #5
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	376 KB	Output is correct
2	Correct	4 ms	520 KB	Output is correct
3	Correct	4 ms	520 KB	Output is correct
4	Correct	4 ms	520 KB	Output is correct
5	Correct	4 ms	520 KB	Output is correct
6	Correct	5 ms	520 KB	Output is correct
7	Correct	4 ms	712 KB	Output is correct
8	Correct	4 ms	712 KB	Output is correct
9	Correct	4 ms	712 KB	Output is correct
10	Correct	4 ms	712 KB	Output is correct
11	Correct	1756 ms	4968 KB	Output is correct
12	Correct	1755 ms	4968 KB	Output is correct
13	Correct	1880 ms	4968 KB	Output is correct
14	Correct	1851 ms	4968 KB	Output is correct
15	Correct	1818 ms	5356 KB	Output is correct
16	Correct	1917 ms	5356 KB	Output is correct
17	Correct	1887 ms	5356 KB	Output is correct
18	Correct	1815 ms	6400 KB	Output is correct
19	Correct	1818 ms	6400 KB	Output is correct
20	Correct	1858 ms	6400 KB	Output is correct
21	Correct	1825 ms	6400 KB	Output is correct
22	Execution timed out	2017 ms	6400 KB	Time limit exceeded
23	Halted	0 ms	0 KB	-

답안 #80207

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 7.0 / 7.0

Subtask #3 0 / 10.0

Subtask #4 53.0 / 53.0

Subtask #5 0 / 25.0

Subtask #1
5.0 / 5.0

Subtask #2
7.0 / 7.0

Subtask #3
0 / 10.0

Subtask #4
53.0 / 53.0

Subtask #5
0 / 25.0