oj.uz

Submission #256798

# Submission time Handle Problem Language Result Execution time Memory
256798 2020-08-03T08:25:06 Z 최은수(#5036) Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 2000 ms 24568 KB 
#include<iostream>
#include<vector>
#include<algorithm>
#define ep emplace
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<ll,ll>pl;
const int inf=1e9+7;
const ll INF=1e18+7;
const int cut=9;
int sum[20000];
int p3[20];
int ans[1000010];
pair<pi,int>qid[1000010];
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int l,q;
    cin>>l>>q;
    string s;
    cin>>s;
    if(l<cut)
    {
        l=cut;
        while((int)s.size()<1<<l)
            s.push_back('0');
    }
    p3[0]=1;
    for(int i=1;i<15;i++)
        p3[i]=p3[i-1]*3;
    for(int i=0;i<q;i++)
    {
        string t;
        cin>>t;
        reverse(all(t));
        while((int)t.size()<l)
            t.push_back('0');
        int id=0;
        for(int j=0;j<cut;j++)
        {
            if(t[j]=='?')
                id+=p3[j]*2;
            else
                id+=((char)t[j]-'0')*p3[j];
        }
        qid[i].se=id;
        int id2=0,id3=0;
        for(int j=cut;j<l;j++)
        {
            if(t[j]=='?')
                id3+=1<<(j-cut);
            else
                id2+=((char)t[j]-'0')*(1<<(j-cut));
        }
        qid[i].fi.fi=id2;
        qid[i].fi.se=id3;
    }
    for(int i=0;i<1<<(l-cut);i++)
    {
        vector<int>v;
        v.reserve(p3[cut]);
        for(int j=0;j<1<<cut;j++)
        {
            int id=0;
            for(int k=0;k<cut;k++)
                id+=(j>>k&1)*p3[k];
            sum[id]=(char)s[i*(1<<cut)+j]-'0';
            v.eb(id);
        }
        for(int li=0;li<cut;li++)
        {
            for(int k=0,m=v.size();k<m;k++)
            {
                int j=v[k];
                int cut=j%p3[li+1]/p3[li];
                sum[j+(2-cut)*p3[li]]+=sum[j];
                if(cut==1)
                    v.eb(j+p3[li]);
            }
        }
        for(int j=0;j<q;j++)
            if(((qid[j].fi.fi^i)&~qid[j].fi.se)==0)
                ans[j]+=sum[qid[j].se];
        fill(sum,sum+p3[cut],0);
    }
    for(int i=0;i<q;i++)
        cout<<ans[i]<<'\n';
    cout.flush();
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 2 ms 640 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 2 ms 640 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 240 ms 22676 KB Output is correct
12 Correct 260 ms 22264 KB Output is correct
13 Correct 236 ms 21624 KB Output is correct
14 Correct 235 ms 21752 KB Output is correct
15 Correct 235 ms 22764 KB Output is correct
16 Correct 255 ms 21880 KB Output is correct
17 Correct 233 ms 21840 KB Output is correct
18 Correct 198 ms 23664 KB Output is correct
19 Correct 187 ms 20600 KB Output is correct
20 Correct 259 ms 22648 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 2 ms 640 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 240 ms 22676 KB Output is correct
12 Correct 260 ms 22264 KB Output is correct
13 Correct 236 ms 21624 KB Output is correct
14 Correct 235 ms 21752 KB Output is correct
15 Correct 235 ms 22764 KB Output is correct
16 Correct 255 ms 21880 KB Output is correct
17 Correct 233 ms 21840 KB Output is correct
18 Correct 198 ms 23664 KB Output is correct
19 Correct 187 ms 20600 KB Output is correct
20 Correct 259 ms 22648 KB Output is correct
21 Correct 326 ms 22560 KB Output is correct
22 Correct 332 ms 22648 KB Output is correct
23 Correct 291 ms 22136 KB Output is correct
24 Correct 292 ms 21680 KB Output is correct
25 Correct 348 ms 23604 KB Output is correct
26 Correct 305 ms 22312 KB Output is correct
27 Correct 314 ms 22008 KB Output is correct
28 Correct 225 ms 24568 KB Output is correct
29 Correct 225 ms 20600 KB Output is correct
30 Correct 335 ms 22776 KB Output is correct
31 Correct 318 ms 22556 KB Output is correct
32 Correct 308 ms 22520 KB Output is correct
33 Correct 283 ms 21496 KB Output is correct
34 Correct 284 ms 21496 KB Output is correct
35 Correct 304 ms 22008 KB Output is correct
36 Correct 217 ms 20472 KB Output is correct
37 Correct 311 ms 22520 KB Output is correct
38 Correct 225 ms 20600 KB Output is correct
39 Correct 287 ms 21752 KB Output is correct
40 Correct 289 ms 21752 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 2 ms 640 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 1284 ms 3864 KB Output is correct
12 Correct 1305 ms 3996 KB Output is correct
13 Correct 1259 ms 3864 KB Output is correct
14 Correct 1270 ms 3864 KB Output is correct
15 Correct 1341 ms 3996 KB Output is correct
16 Correct 1274 ms 3864 KB Output is correct
17 Correct 1274 ms 3864 KB Output is correct
18 Correct 1274 ms 4120 KB Output is correct
19 Correct 1247 ms 3740 KB Output is correct
20 Correct 1287 ms 4120 KB Output is correct
21 Correct 1290 ms 3992 KB Output is correct
22 Correct 1260 ms 3864 KB Output is correct
23 Correct 1240 ms 3864 KB Output is correct
24 Correct 1260 ms 3864 KB Output is correct
25 Correct 1265 ms 3992 KB Output is correct
26 Correct 1244 ms 3864 KB Output is correct
27 Correct 1278 ms 4120 KB Output is correct
28 Correct 1239 ms 3864 KB Output is correct
29 Correct 1249 ms 3992 KB Output is correct
30 Correct 1255 ms 3992 KB Output is correct
31 Correct 1246 ms 3992 KB Output is correct
32 Correct 1276 ms 3892 KB Output is correct
33 Correct 1270 ms 3896 KB Output is correct
34 Correct 1234 ms 3864 KB Output is correct
35 Correct 1316 ms 3864 KB Output is correct
36 Correct 1312 ms 3864 KB Output is correct
37 Correct 1311 ms 3864 KB Output is correct
38 Correct 1306 ms 3864 KB Output is correct
39 Correct 1314 ms 3864 KB Output is correct
40 Correct 1305 ms 3864 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 2 ms 640 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 240 ms 22676 KB Output is correct
12 Correct 260 ms 22264 KB Output is correct
13 Correct 236 ms 21624 KB Output is correct
14 Correct 235 ms 21752 KB Output is correct
15 Correct 235 ms 22764 KB Output is correct
16 Correct 255 ms 21880 KB Output is correct
17 Correct 233 ms 21840 KB Output is correct
18 Correct 198 ms 23664 KB Output is correct
19 Correct 187 ms 20600 KB Output is correct
20 Correct 259 ms 22648 KB Output is correct
21 Correct 326 ms 22560 KB Output is correct
22 Correct 332 ms 22648 KB Output is correct
23 Correct 291 ms 22136 KB Output is correct
24 Correct 292 ms 21680 KB Output is correct
25 Correct 348 ms 23604 KB Output is correct
26 Correct 305 ms 22312 KB Output is correct
27 Correct 314 ms 22008 KB Output is correct
28 Correct 225 ms 24568 KB Output is correct
29 Correct 225 ms 20600 KB Output is correct
30 Correct 335 ms 22776 KB Output is correct
31 Correct 318 ms 22556 KB Output is correct
32 Correct 308 ms 22520 KB Output is correct
33 Correct 283 ms 21496 KB Output is correct
34 Correct 284 ms 21496 KB Output is correct
35 Correct 304 ms 22008 KB Output is correct
36 Correct 217 ms 20472 KB Output is correct
37 Correct 311 ms 22520 KB Output is correct
38 Correct 225 ms 20600 KB Output is correct
39 Correct 287 ms 21752 KB Output is correct
40 Correct 289 ms 21752 KB Output is correct
41 Correct 1284 ms 3864 KB Output is correct
42 Correct 1305 ms 3996 KB Output is correct
43 Correct 1259 ms 3864 KB Output is correct
44 Correct 1270 ms 3864 KB Output is correct
45 Correct 1341 ms 3996 KB Output is correct
46 Correct 1274 ms 3864 KB Output is correct
47 Correct 1274 ms 3864 KB Output is correct
48 Correct 1274 ms 4120 KB Output is correct
49 Correct 1247 ms 3740 KB Output is correct
50 Correct 1287 ms 4120 KB Output is correct
51 Correct 1290 ms 3992 KB Output is correct
52 Correct 1260 ms 3864 KB Output is correct
53 Correct 1240 ms 3864 KB Output is correct
54 Correct 1260 ms 3864 KB Output is correct
55 Correct 1265 ms 3992 KB Output is correct
56 Correct 1244 ms 3864 KB Output is correct
57 Correct 1278 ms 4120 KB Output is correct
58 Correct 1239 ms 3864 KB Output is correct
59 Correct 1249 ms 3992 KB Output is correct
60 Correct 1255 ms 3992 KB Output is correct
61 Correct 1246 ms 3992 KB Output is correct
62 Correct 1276 ms 3892 KB Output is correct
63 Correct 1270 ms 3896 KB Output is correct
64 Correct 1234 ms 3864 KB Output is correct
65 Correct 1316 ms 3864 KB Output is correct
66 Correct 1312 ms 3864 KB Output is correct
67 Correct 1311 ms 3864 KB Output is correct
68 Correct 1306 ms 3864 KB Output is correct
69 Correct 1314 ms 3864 KB Output is correct
70 Correct 1305 ms 3864 KB Output is correct
71 Execution timed out 2092 ms 17844 KB Time limit exceeded
72 Halted 0 ms 0 KB -