oj.uz

Submission #256792

# Submission time Handle Problem Language Result Execution time Memory
256792 2020-08-03T08:08:24 Z 최은수(#5036) Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 2000 ms 18424 KB 
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2")
#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<pair<short,short>,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 2 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 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 2 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 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 264 ms 16248 KB Output is correct
12 Correct 301 ms 16196 KB Output is correct
13 Correct 266 ms 15224 KB Output is correct
14 Correct 246 ms 15224 KB Output is correct
15 Correct 256 ms 16248 KB Output is correct
16 Correct 264 ms 15480 KB Output is correct
17 Correct 258 ms 15352 KB Output is correct
18 Correct 231 ms 17272 KB Output is correct
19 Correct 210 ms 14200 KB Output is correct
20 Correct 265 ms 15864 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 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 264 ms 16248 KB Output is correct
12 Correct 301 ms 16196 KB Output is correct
13 Correct 266 ms 15224 KB Output is correct
14 Correct 246 ms 15224 KB Output is correct
15 Correct 256 ms 16248 KB Output is correct
16 Correct 264 ms 15480 KB Output is correct
17 Correct 258 ms 15352 KB Output is correct
18 Correct 231 ms 17272 KB Output is correct
19 Correct 210 ms 14200 KB Output is correct
20 Correct 265 ms 15864 KB Output is correct
21 Correct 348 ms 16248 KB Output is correct
22 Correct 364 ms 16504 KB Output is correct
23 Correct 322 ms 15480 KB Output is correct
24 Correct 322 ms 15224 KB Output is correct
25 Correct 342 ms 17364 KB Output is correct
26 Correct 346 ms 15864 KB Output is correct
27 Correct 348 ms 15912 KB Output is correct
28 Correct 299 ms 18424 KB Output is correct
29 Correct 291 ms 14316 KB Output is correct
30 Correct 363 ms 16452 KB Output is correct
31 Correct 337 ms 16376 KB Output is correct
32 Correct 328 ms 16248 KB Output is correct
33 Correct 321 ms 15224 KB Output is correct
34 Correct 333 ms 15224 KB Output is correct
35 Correct 352 ms 15736 KB Output is correct
36 Correct 279 ms 14456 KB Output is correct
37 Correct 363 ms 16420 KB Output is correct
38 Correct 292 ms 14288 KB Output is correct
39 Correct 355 ms 15388 KB Output is correct
40 Correct 331 ms 15468 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 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 1514 ms 2492 KB Output is correct
12 Correct 1511 ms 2588 KB Output is correct
13 Correct 1505 ms 2460 KB Output is correct
14 Correct 1512 ms 2460 KB Output is correct
15 Correct 1513 ms 2584 KB Output is correct
16 Correct 1523 ms 2460 KB Output is correct
17 Correct 1511 ms 2460 KB Output is correct
18 Correct 1506 ms 2620 KB Output is correct
19 Correct 1508 ms 2460 KB Output is correct
20 Correct 1522 ms 2496 KB Output is correct
21 Correct 1514 ms 2492 KB Output is correct
22 Correct 1519 ms 2460 KB Output is correct
23 Correct 1522 ms 2460 KB Output is correct
24 Correct 1510 ms 2460 KB Output is correct
25 Correct 1510 ms 2460 KB Output is correct
26 Correct 1524 ms 2460 KB Output is correct
27 Correct 1525 ms 2492 KB Output is correct
28 Correct 1512 ms 2460 KB Output is correct
29 Correct 1515 ms 2460 KB Output is correct
30 Correct 1515 ms 2460 KB Output is correct
31 Correct 1531 ms 2460 KB Output is correct
32 Correct 1519 ms 2588 KB Output is correct
33 Correct 1513 ms 2460 KB Output is correct
34 Correct 1500 ms 2460 KB Output is correct
35 Correct 1516 ms 2460 KB Output is correct
36 Correct 1511 ms 2460 KB Output is correct
37 Correct 1521 ms 2460 KB Output is correct
38 Correct 1505 ms 2460 KB Output is correct
39 Correct 1507 ms 2460 KB Output is correct
40 Correct 1509 ms 2460 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 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 264 ms 16248 KB Output is correct
12 Correct 301 ms 16196 KB Output is correct
13 Correct 266 ms 15224 KB Output is correct
14 Correct 246 ms 15224 KB Output is correct
15 Correct 256 ms 16248 KB Output is correct
16 Correct 264 ms 15480 KB Output is correct
17 Correct 258 ms 15352 KB Output is correct
18 Correct 231 ms 17272 KB Output is correct
19 Correct 210 ms 14200 KB Output is correct
20 Correct 265 ms 15864 KB Output is correct
21 Correct 348 ms 16248 KB Output is correct
22 Correct 364 ms 16504 KB Output is correct
23 Correct 322 ms 15480 KB Output is correct
24 Correct 322 ms 15224 KB Output is correct
25 Correct 342 ms 17364 KB Output is correct
26 Correct 346 ms 15864 KB Output is correct
27 Correct 348 ms 15912 KB Output is correct
28 Correct 299 ms 18424 KB Output is correct
29 Correct 291 ms 14316 KB Output is correct
30 Correct 363 ms 16452 KB Output is correct
31 Correct 337 ms 16376 KB Output is correct
32 Correct 328 ms 16248 KB Output is correct
33 Correct 321 ms 15224 KB Output is correct
34 Correct 333 ms 15224 KB Output is correct
35 Correct 352 ms 15736 KB Output is correct
36 Correct 279 ms 14456 KB Output is correct
37 Correct 363 ms 16420 KB Output is correct
38 Correct 292 ms 14288 KB Output is correct
39 Correct 355 ms 15388 KB Output is correct
40 Correct 331 ms 15468 KB Output is correct
41 Correct 1514 ms 2492 KB Output is correct
42 Correct 1511 ms 2588 KB Output is correct
43 Correct 1505 ms 2460 KB Output is correct
44 Correct 1512 ms 2460 KB Output is correct
45 Correct 1513 ms 2584 KB Output is correct
46 Correct 1523 ms 2460 KB Output is correct
47 Correct 1511 ms 2460 KB Output is correct
48 Correct 1506 ms 2620 KB Output is correct
49 Correct 1508 ms 2460 KB Output is correct
50 Correct 1522 ms 2496 KB Output is correct
51 Correct 1514 ms 2492 KB Output is correct
52 Correct 1519 ms 2460 KB Output is correct
53 Correct 1522 ms 2460 KB Output is correct
54 Correct 1510 ms 2460 KB Output is correct
55 Correct 1510 ms 2460 KB Output is correct
56 Correct 1524 ms 2460 KB Output is correct
57 Correct 1525 ms 2492 KB Output is correct
58 Correct 1512 ms 2460 KB Output is correct
59 Correct 1515 ms 2460 KB Output is correct
60 Correct 1515 ms 2460 KB Output is correct
61 Correct 1531 ms 2460 KB Output is correct
62 Correct 1519 ms 2588 KB Output is correct
63 Correct 1513 ms 2460 KB Output is correct
64 Correct 1500 ms 2460 KB Output is correct
65 Correct 1516 ms 2460 KB Output is correct
66 Correct 1511 ms 2460 KB Output is correct
67 Correct 1521 ms 2460 KB Output is correct
68 Correct 1505 ms 2460 KB Output is correct
69 Correct 1507 ms 2460 KB Output is correct
70 Correct 1509 ms 2460 KB Output is correct
71 Execution timed out 2090 ms 13340 KB Time limit exceeded
72 Halted 0 ms 0 KB -