oj.uz

Submission #256767

# Submission time Handle Problem Language Result Execution time Memory
256767 2020-08-03T07:49:11 Z 최은수(#5036) Snake Escaping (JOI18_snake_escaping) C++17
22 / 100
 2000 ms 18952 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=11;
int sum[180000];
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;
        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];
        for(int&t:v)
            sum[t]=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 7 ms 2048 KB Output is correct
2 Correct 9 ms 2048 KB Output is correct
3 Correct 7 ms 2048 KB Output is correct
4 Correct 8 ms 2048 KB Output is correct
5 Correct 7 ms 2048 KB Output is correct
6 Correct 7 ms 2048 KB Output is correct
7 Correct 7 ms 2048 KB Output is correct
8 Correct 7 ms 2048 KB Output is correct
9 Correct 10 ms 2048 KB Output is correct
10 Correct 7 ms 2048 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2048 KB Output is correct
2 Correct 9 ms 2048 KB Output is correct
3 Correct 7 ms 2048 KB Output is correct
4 Correct 8 ms 2048 KB Output is correct
5 Correct 7 ms 2048 KB Output is correct
6 Correct 7 ms 2048 KB Output is correct
7 Correct 7 ms 2048 KB Output is correct
8 Correct 7 ms 2048 KB Output is correct
9 Correct 10 ms 2048 KB Output is correct
10 Correct 7 ms 2048 KB Output is correct
11 Correct 356 ms 16944 KB Output is correct
12 Correct 266 ms 16688 KB Output is correct
13 Correct 236 ms 15788 KB Output is correct
14 Correct 233 ms 16048 KB Output is correct
15 Correct 244 ms 16944 KB Output is correct
16 Correct 238 ms 16048 KB Output is correct
17 Correct 246 ms 16048 KB Output is correct
18 Correct 198 ms 17968 KB Output is correct
19 Correct 192 ms 15024 KB Output is correct
20 Correct 262 ms 16688 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2048 KB Output is correct
2 Correct 9 ms 2048 KB Output is correct
3 Correct 7 ms 2048 KB Output is correct
4 Correct 8 ms 2048 KB Output is correct
5 Correct 7 ms 2048 KB Output is correct
6 Correct 7 ms 2048 KB Output is correct
7 Correct 7 ms 2048 KB Output is correct
8 Correct 7 ms 2048 KB Output is correct
9 Correct 10 ms 2048 KB Output is correct
10 Correct 7 ms 2048 KB Output is correct
11 Correct 356 ms 16944 KB Output is correct
12 Correct 266 ms 16688 KB Output is correct
13 Correct 236 ms 15788 KB Output is correct
14 Correct 233 ms 16048 KB Output is correct
15 Correct 244 ms 16944 KB Output is correct
16 Correct 238 ms 16048 KB Output is correct
17 Correct 246 ms 16048 KB Output is correct
18 Correct 198 ms 17968 KB Output is correct
19 Correct 192 ms 15024 KB Output is correct
20 Correct 262 ms 16688 KB Output is correct
21 Correct 290 ms 16992 KB Output is correct
22 Correct 316 ms 17172 KB Output is correct
23 Correct 320 ms 16136 KB Output is correct
24 Correct 297 ms 16004 KB Output is correct
25 Correct 294 ms 17956 KB Output is correct
26 Correct 302 ms 16392 KB Output is correct
27 Correct 300 ms 16404 KB Output is correct
28 Correct 227 ms 18952 KB Output is correct
29 Correct 232 ms 14984 KB Output is correct
30 Correct 319 ms 17160 KB Output is correct
31 Correct 310 ms 17016 KB Output is correct
32 Correct 296 ms 17040 KB Output is correct
33 Correct 263 ms 15856 KB Output is correct
34 Correct 293 ms 15880 KB Output is correct
35 Correct 304 ms 16388 KB Output is correct
36 Correct 216 ms 14984 KB Output is correct
37 Correct 308 ms 17032 KB Output is correct
38 Correct 234 ms 14984 KB Output is correct
39 Correct 286 ms 16136 KB Output is correct
40 Correct 292 ms 15880 KB Output is correct

Subtask #4
0 / 53.0

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

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2048 KB Output is correct
2 Correct 9 ms 2048 KB Output is correct
3 Correct 7 ms 2048 KB Output is correct
4 Correct 8 ms 2048 KB Output is correct
5 Correct 7 ms 2048 KB Output is correct
6 Correct 7 ms 2048 KB Output is correct
7 Correct 7 ms 2048 KB Output is correct
8 Correct 7 ms 2048 KB Output is correct
9 Correct 10 ms 2048 KB Output is correct
10 Correct 7 ms 2048 KB Output is correct
11 Correct 356 ms 16944 KB Output is correct
12 Correct 266 ms 16688 KB Output is correct
13 Correct 236 ms 15788 KB Output is correct
14 Correct 233 ms 16048 KB Output is correct
15 Correct 244 ms 16944 KB Output is correct
16 Correct 238 ms 16048 KB Output is correct
17 Correct 246 ms 16048 KB Output is correct
18 Correct 198 ms 17968 KB Output is correct
19 Correct 192 ms 15024 KB Output is correct
20 Correct 262 ms 16688 KB Output is correct
21 Correct 290 ms 16992 KB Output is correct
22 Correct 316 ms 17172 KB Output is correct
23 Correct 320 ms 16136 KB Output is correct
24 Correct 297 ms 16004 KB Output is correct
25 Correct 294 ms 17956 KB Output is correct
26 Correct 302 ms 16392 KB Output is correct
27 Correct 300 ms 16404 KB Output is correct
28 Correct 227 ms 18952 KB Output is correct
29 Correct 232 ms 14984 KB Output is correct
30 Correct 319 ms 17160 KB Output is correct
31 Correct 310 ms 17016 KB Output is correct
32 Correct 296 ms 17040 KB Output is correct
33 Correct 263 ms 15856 KB Output is correct
34 Correct 293 ms 15880 KB Output is correct
35 Correct 304 ms 16388 KB Output is correct
36 Correct 216 ms 14984 KB Output is correct
37 Correct 308 ms 17032 KB Output is correct
38 Correct 234 ms 14984 KB Output is correct
39 Correct 286 ms 16136 KB Output is correct
40 Correct 292 ms 15880 KB Output is correct
41 Execution timed out 2086 ms 4884 KB Time limit exceeded
42 Halted 0 ms 0 KB -