oj.uz

Submission #256778

# Submission time Handle Problem Language Result Execution time Memory
256778 2020-08-03T07:56:04 Z 최은수(#5036) Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 2000 ms 18344 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[60000];
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 2 ms 684 KB Output is correct
2 Correct 2 ms 684 KB Output is correct
3 Correct 2 ms 684 KB Output is correct
4 Correct 2 ms 684 KB Output is correct
5 Correct 2 ms 684 KB Output is correct
6 Correct 2 ms 684 KB Output is correct
7 Correct 2 ms 684 KB Output is correct
8 Correct 2 ms 684 KB Output is correct
9 Correct 2 ms 684 KB Output is correct
10 Correct 2 ms 684 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 684 KB Output is correct
2 Correct 2 ms 684 KB Output is correct
3 Correct 2 ms 684 KB Output is correct
4 Correct 2 ms 684 KB Output is correct
5 Correct 2 ms 684 KB Output is correct
6 Correct 2 ms 684 KB Output is correct
7 Correct 2 ms 684 KB Output is correct
8 Correct 2 ms 684 KB Output is correct
9 Correct 2 ms 684 KB Output is correct
10 Correct 2 ms 684 KB Output is correct
11 Correct 269 ms 16328 KB Output is correct
12 Correct 269 ms 16072 KB Output is correct
13 Correct 239 ms 15292 KB Output is correct
14 Correct 247 ms 15360 KB Output is correct
15 Correct 249 ms 16272 KB Output is correct
16 Correct 272 ms 15580 KB Output is correct
17 Correct 259 ms 15432 KB Output is correct
18 Correct 218 ms 17356 KB Output is correct
19 Correct 214 ms 14404 KB Output is correct
20 Correct 271 ms 15944 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 684 KB Output is correct
2 Correct 2 ms 684 KB Output is correct
3 Correct 2 ms 684 KB Output is correct
4 Correct 2 ms 684 KB Output is correct
5 Correct 2 ms 684 KB Output is correct
6 Correct 2 ms 684 KB Output is correct
7 Correct 2 ms 684 KB Output is correct
8 Correct 2 ms 684 KB Output is correct
9 Correct 2 ms 684 KB Output is correct
10 Correct 2 ms 684 KB Output is correct
11 Correct 269 ms 16328 KB Output is correct
12 Correct 269 ms 16072 KB Output is correct
13 Correct 239 ms 15292 KB Output is correct
14 Correct 247 ms 15360 KB Output is correct
15 Correct 249 ms 16272 KB Output is correct
16 Correct 272 ms 15580 KB Output is correct
17 Correct 259 ms 15432 KB Output is correct
18 Correct 218 ms 17356 KB Output is correct
19 Correct 214 ms 14404 KB Output is correct
20 Correct 271 ms 15944 KB Output is correct
21 Correct 342 ms 16296 KB Output is correct
22 Correct 355 ms 16552 KB Output is correct
23 Correct 325 ms 15596 KB Output is correct
24 Correct 326 ms 15544 KB Output is correct
25 Correct 331 ms 17320 KB Output is correct
26 Correct 338 ms 15852 KB Output is correct
27 Correct 333 ms 15912 KB Output is correct
28 Correct 290 ms 18344 KB Output is correct
29 Correct 292 ms 14376 KB Output is correct
30 Correct 370 ms 16496 KB Output is correct
31 Correct 339 ms 16440 KB Output is correct
32 Correct 334 ms 16404 KB Output is correct
33 Correct 308 ms 15272 KB Output is correct
34 Correct 331 ms 15400 KB Output is correct
35 Correct 335 ms 15916 KB Output is correct
36 Correct 286 ms 14504 KB Output is correct
37 Correct 340 ms 16296 KB Output is correct
38 Correct 281 ms 14332 KB Output is correct
39 Correct 331 ms 15528 KB Output is correct
40 Correct 413 ms 15272 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 684 KB Output is correct
2 Correct 2 ms 684 KB Output is correct
3 Correct 2 ms 684 KB Output is correct
4 Correct 2 ms 684 KB Output is correct
5 Correct 2 ms 684 KB Output is correct
6 Correct 2 ms 684 KB Output is correct
7 Correct 2 ms 684 KB Output is correct
8 Correct 2 ms 684 KB Output is correct
9 Correct 2 ms 684 KB Output is correct
10 Correct 2 ms 684 KB Output is correct
11 Correct 1500 ms 2580 KB Output is correct
12 Correct 1501 ms 3740 KB Output is correct
13 Correct 1499 ms 3740 KB Output is correct
14 Correct 1514 ms 3740 KB Output is correct
15 Correct 1511 ms 3864 KB Output is correct
16 Correct 1517 ms 3740 KB Output is correct
17 Correct 1501 ms 3740 KB Output is correct
18 Correct 1492 ms 3992 KB Output is correct
19 Correct 1481 ms 3740 KB Output is correct
20 Correct 1538 ms 3864 KB Output is correct
21 Correct 1503 ms 3896 KB Output is correct
22 Correct 1499 ms 3740 KB Output is correct
23 Correct 1493 ms 3744 KB Output is correct
24 Correct 1495 ms 3740 KB Output is correct
25 Correct 1497 ms 3740 KB Output is correct
26 Correct 1490 ms 3740 KB Output is correct
27 Correct 1493 ms 3856 KB Output is correct
28 Correct 1488 ms 3740 KB Output is correct
29 Correct 1487 ms 3740 KB Output is correct
30 Correct 1494 ms 3740 KB Output is correct
31 Correct 1502 ms 3740 KB Output is correct
32 Correct 1507 ms 3740 KB Output is correct
33 Correct 1500 ms 3740 KB Output is correct
34 Correct 1495 ms 3740 KB Output is correct
35 Correct 1500 ms 3740 KB Output is correct
36 Correct 1488 ms 3740 KB Output is correct
37 Correct 1492 ms 3740 KB Output is correct
38 Correct 1502 ms 3740 KB Output is correct
39 Correct 1497 ms 3740 KB Output is correct
40 Correct 1481 ms 3740 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 684 KB Output is correct
2 Correct 2 ms 684 KB Output is correct
3 Correct 2 ms 684 KB Output is correct
4 Correct 2 ms 684 KB Output is correct
5 Correct 2 ms 684 KB Output is correct
6 Correct 2 ms 684 KB Output is correct
7 Correct 2 ms 684 KB Output is correct
8 Correct 2 ms 684 KB Output is correct
9 Correct 2 ms 684 KB Output is correct
10 Correct 2 ms 684 KB Output is correct
11 Correct 269 ms 16328 KB Output is correct
12 Correct 269 ms 16072 KB Output is correct
13 Correct 239 ms 15292 KB Output is correct
14 Correct 247 ms 15360 KB Output is correct
15 Correct 249 ms 16272 KB Output is correct
16 Correct 272 ms 15580 KB Output is correct
17 Correct 259 ms 15432 KB Output is correct
18 Correct 218 ms 17356 KB Output is correct
19 Correct 214 ms 14404 KB Output is correct
20 Correct 271 ms 15944 KB Output is correct
21 Correct 342 ms 16296 KB Output is correct
22 Correct 355 ms 16552 KB Output is correct
23 Correct 325 ms 15596 KB Output is correct
24 Correct 326 ms 15544 KB Output is correct
25 Correct 331 ms 17320 KB Output is correct
26 Correct 338 ms 15852 KB Output is correct
27 Correct 333 ms 15912 KB Output is correct
28 Correct 290 ms 18344 KB Output is correct
29 Correct 292 ms 14376 KB Output is correct
30 Correct 370 ms 16496 KB Output is correct
31 Correct 339 ms 16440 KB Output is correct
32 Correct 334 ms 16404 KB Output is correct
33 Correct 308 ms 15272 KB Output is correct
34 Correct 331 ms 15400 KB Output is correct
35 Correct 335 ms 15916 KB Output is correct
36 Correct 286 ms 14504 KB Output is correct
37 Correct 340 ms 16296 KB Output is correct
38 Correct 281 ms 14332 KB Output is correct
39 Correct 331 ms 15528 KB Output is correct
40 Correct 413 ms 15272 KB Output is correct
41 Correct 1500 ms 2580 KB Output is correct
42 Correct 1501 ms 3740 KB Output is correct
43 Correct 1499 ms 3740 KB Output is correct
44 Correct 1514 ms 3740 KB Output is correct
45 Correct 1511 ms 3864 KB Output is correct
46 Correct 1517 ms 3740 KB Output is correct
47 Correct 1501 ms 3740 KB Output is correct
48 Correct 1492 ms 3992 KB Output is correct
49 Correct 1481 ms 3740 KB Output is correct
50 Correct 1538 ms 3864 KB Output is correct
51 Correct 1503 ms 3896 KB Output is correct
52 Correct 1499 ms 3740 KB Output is correct
53 Correct 1493 ms 3744 KB Output is correct
54 Correct 1495 ms 3740 KB Output is correct
55 Correct 1497 ms 3740 KB Output is correct
56 Correct 1490 ms 3740 KB Output is correct
57 Correct 1493 ms 3856 KB Output is correct
58 Correct 1488 ms 3740 KB Output is correct
59 Correct 1487 ms 3740 KB Output is correct
60 Correct 1494 ms 3740 KB Output is correct
61 Correct 1502 ms 3740 KB Output is correct
62 Correct 1507 ms 3740 KB Output is correct
63 Correct 1500 ms 3740 KB Output is correct
64 Correct 1495 ms 3740 KB Output is correct
65 Correct 1500 ms 3740 KB Output is correct
66 Correct 1488 ms 3740 KB Output is correct
67 Correct 1492 ms 3740 KB Output is correct
68 Correct 1502 ms 3740 KB Output is correct
69 Correct 1497 ms 3740 KB Output is correct
70 Correct 1481 ms 3740 KB Output is correct
71 Execution timed out 2075 ms 14028 KB Time limit exceeded
72 Halted 0 ms 0 KB -