oj.uz

Submission #256791

# Submission time Handle Problem Language Result Execution time Memory
256791 2020-08-03T08:07:22 Z 최은수(#5036) Snake Escaping (JOI18_snake_escaping) C++17
22 / 100
 2000 ms 18692 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=10;
int sum[200000];
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 3 ms 896 KB Output is correct
2 Correct 3 ms 768 KB Output is correct
3 Correct 3 ms 768 KB Output is correct
4 Correct 3 ms 896 KB Output is correct
5 Correct 3 ms 896 KB Output is correct
6 Correct 3 ms 896 KB Output is correct
7 Correct 3 ms 768 KB Output is correct
8 Correct 3 ms 896 KB Output is correct
9 Correct 3 ms 896 KB Output is correct
10 Correct 4 ms 768 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 896 KB Output is correct
2 Correct 3 ms 768 KB Output is correct
3 Correct 3 ms 768 KB Output is correct
4 Correct 3 ms 896 KB Output is correct
5 Correct 3 ms 896 KB Output is correct
6 Correct 3 ms 896 KB Output is correct
7 Correct 3 ms 768 KB Output is correct
8 Correct 3 ms 896 KB Output is correct
9 Correct 3 ms 896 KB Output is correct
10 Correct 4 ms 768 KB Output is correct
11 Correct 275 ms 16372 KB Output is correct
12 Correct 266 ms 16004 KB Output is correct
13 Correct 233 ms 15236 KB Output is correct
14 Correct 244 ms 15360 KB Output is correct
15 Correct 306 ms 16512 KB Output is correct
16 Correct 259 ms 15552 KB Output is correct
17 Correct 267 ms 15492 KB Output is correct
18 Correct 227 ms 17284 KB Output is correct
19 Correct 214 ms 14400 KB Output is correct
20 Correct 275 ms 16004 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 896 KB Output is correct
2 Correct 3 ms 768 KB Output is correct
3 Correct 3 ms 768 KB Output is correct
4 Correct 3 ms 896 KB Output is correct
5 Correct 3 ms 896 KB Output is correct
6 Correct 3 ms 896 KB Output is correct
7 Correct 3 ms 768 KB Output is correct
8 Correct 3 ms 896 KB Output is correct
9 Correct 3 ms 896 KB Output is correct
10 Correct 4 ms 768 KB Output is correct
11 Correct 275 ms 16372 KB Output is correct
12 Correct 266 ms 16004 KB Output is correct
13 Correct 233 ms 15236 KB Output is correct
14 Correct 244 ms 15360 KB Output is correct
15 Correct 306 ms 16512 KB Output is correct
16 Correct 259 ms 15552 KB Output is correct
17 Correct 267 ms 15492 KB Output is correct
18 Correct 227 ms 17284 KB Output is correct
19 Correct 214 ms 14400 KB Output is correct
20 Correct 275 ms 16004 KB Output is correct
21 Correct 327 ms 16704 KB Output is correct
22 Correct 357 ms 17028 KB Output is correct
23 Correct 332 ms 15792 KB Output is correct
24 Correct 318 ms 15632 KB Output is correct
25 Correct 338 ms 17540 KB Output is correct
26 Correct 336 ms 16132 KB Output is correct
27 Correct 327 ms 16032 KB Output is correct
28 Correct 302 ms 18692 KB Output is correct
29 Correct 266 ms 14724 KB Output is correct
30 Correct 347 ms 16772 KB Output is correct
31 Correct 334 ms 16572 KB Output is correct
32 Correct 329 ms 16772 KB Output is correct
33 Correct 300 ms 15544 KB Output is correct
34 Correct 313 ms 15684 KB Output is correct
35 Correct 343 ms 16004 KB Output is correct
36 Correct 270 ms 14720 KB Output is correct
37 Correct 327 ms 16756 KB Output is correct
38 Correct 272 ms 14596 KB Output is correct
39 Correct 316 ms 15748 KB Output is correct
40 Correct 327 ms 15624 KB Output is correct

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 896 KB Output is correct
2 Correct 3 ms 768 KB Output is correct
3 Correct 3 ms 768 KB Output is correct
4 Correct 3 ms 896 KB Output is correct
5 Correct 3 ms 896 KB Output is correct
6 Correct 3 ms 896 KB Output is correct
7 Correct 3 ms 768 KB Output is correct
8 Correct 3 ms 896 KB Output is correct
9 Correct 3 ms 896 KB Output is correct
10 Correct 4 ms 768 KB Output is correct
11 Execution timed out 2039 ms 2764 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 896 KB Output is correct
2 Correct 3 ms 768 KB Output is correct
3 Correct 3 ms 768 KB Output is correct
4 Correct 3 ms 896 KB Output is correct
5 Correct 3 ms 896 KB Output is correct
6 Correct 3 ms 896 KB Output is correct
7 Correct 3 ms 768 KB Output is correct
8 Correct 3 ms 896 KB Output is correct
9 Correct 3 ms 896 KB Output is correct
10 Correct 4 ms 768 KB Output is correct
11 Correct 275 ms 16372 KB Output is correct
12 Correct 266 ms 16004 KB Output is correct
13 Correct 233 ms 15236 KB Output is correct
14 Correct 244 ms 15360 KB Output is correct
15 Correct 306 ms 16512 KB Output is correct
16 Correct 259 ms 15552 KB Output is correct
17 Correct 267 ms 15492 KB Output is correct
18 Correct 227 ms 17284 KB Output is correct
19 Correct 214 ms 14400 KB Output is correct
20 Correct 275 ms 16004 KB Output is correct
21 Correct 327 ms 16704 KB Output is correct
22 Correct 357 ms 17028 KB Output is correct
23 Correct 332 ms 15792 KB Output is correct
24 Correct 318 ms 15632 KB Output is correct
25 Correct 338 ms 17540 KB Output is correct
26 Correct 336 ms 16132 KB Output is correct
27 Correct 327 ms 16032 KB Output is correct
28 Correct 302 ms 18692 KB Output is correct
29 Correct 266 ms 14724 KB Output is correct
30 Correct 347 ms 16772 KB Output is correct
31 Correct 334 ms 16572 KB Output is correct
32 Correct 329 ms 16772 KB Output is correct
33 Correct 300 ms 15544 KB Output is correct
34 Correct 313 ms 15684 KB Output is correct
35 Correct 343 ms 16004 KB Output is correct
36 Correct 270 ms 14720 KB Output is correct
37 Correct 327 ms 16756 KB Output is correct
38 Correct 272 ms 14596 KB Output is correct
39 Correct 316 ms 15748 KB Output is correct
40 Correct 327 ms 15624 KB Output is correct
41 Execution timed out 2039 ms 2764 KB Time limit exceeded
42 Halted 0 ms 0 KB -