oj.uz

Submission #256780

# Submission time Handle Problem Language Result Execution time Memory
256780 2020-08-03T07:57:31 Z 최은수(#5036) Snake Escaping (JOI18_snake_escaping) C++17
75 / 100
 2000 ms 19832 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=8;
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;
        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 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 408 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 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 408 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 254 ms 18040 KB Output is correct
12 Correct 277 ms 17784 KB Output is correct
13 Correct 244 ms 16888 KB Output is correct
14 Correct 257 ms 17016 KB Output is correct
15 Correct 258 ms 18056 KB Output is correct
16 Correct 258 ms 17276 KB Output is correct
17 Correct 272 ms 17112 KB Output is correct
18 Correct 246 ms 19052 KB Output is correct
19 Correct 211 ms 15992 KB Output is correct
20 Correct 284 ms 17656 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 408 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 254 ms 18040 KB Output is correct
12 Correct 277 ms 17784 KB Output is correct
13 Correct 244 ms 16888 KB Output is correct
14 Correct 257 ms 17016 KB Output is correct
15 Correct 258 ms 18056 KB Output is correct
16 Correct 258 ms 17276 KB Output is correct
17 Correct 272 ms 17112 KB Output is correct
18 Correct 246 ms 19052 KB Output is correct
19 Correct 211 ms 15992 KB Output is correct
20 Correct 284 ms 17656 KB Output is correct
21 Correct 380 ms 17784 KB Output is correct
22 Correct 379 ms 18088 KB Output is correct
23 Correct 349 ms 17016 KB Output is correct
24 Correct 363 ms 16788 KB Output is correct
25 Correct 371 ms 18804 KB Output is correct
26 Correct 376 ms 17276 KB Output is correct
27 Correct 383 ms 17272 KB Output is correct
28 Correct 322 ms 19832 KB Output is correct
29 Correct 315 ms 15992 KB Output is correct
30 Correct 390 ms 18032 KB Output is correct
31 Correct 457 ms 17784 KB Output is correct
32 Correct 356 ms 17784 KB Output is correct
33 Correct 340 ms 16736 KB Output is correct
34 Correct 343 ms 16760 KB Output is correct
35 Correct 370 ms 17404 KB Output is correct
36 Correct 304 ms 15864 KB Output is correct
37 Correct 375 ms 17784 KB Output is correct
38 Correct 324 ms 15736 KB Output is correct
39 Correct 365 ms 17016 KB Output is correct
40 Correct 356 ms 16760 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 408 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 1297 ms 3584 KB Output is correct
12 Correct 1284 ms 3608 KB Output is correct
13 Correct 1291 ms 3468 KB Output is correct
14 Correct 1283 ms 3480 KB Output is correct
15 Correct 1295 ms 3612 KB Output is correct
16 Correct 1285 ms 3608 KB Output is correct
17 Correct 1289 ms 3480 KB Output is correct
18 Correct 1304 ms 3864 KB Output is correct
19 Correct 1284 ms 3352 KB Output is correct
20 Correct 1286 ms 3600 KB Output is correct
21 Correct 1281 ms 3608 KB Output is correct
22 Correct 1292 ms 3480 KB Output is correct
23 Correct 1289 ms 3480 KB Output is correct
24 Correct 1291 ms 3480 KB Output is correct
25 Correct 1291 ms 3480 KB Output is correct
26 Correct 1270 ms 3352 KB Output is correct
27 Correct 1289 ms 3596 KB Output is correct
28 Correct 1274 ms 3352 KB Output is correct
29 Correct 1292 ms 3464 KB Output is correct
30 Correct 1309 ms 3464 KB Output is correct
31 Correct 1327 ms 3464 KB Output is correct
32 Correct 1383 ms 3464 KB Output is correct
33 Correct 1304 ms 3464 KB Output is correct
34 Correct 1281 ms 3352 KB Output is correct
35 Correct 1311 ms 3480 KB Output is correct
36 Correct 1296 ms 3460 KB Output is correct
37 Correct 1293 ms 3460 KB Output is correct
38 Correct 1303 ms 3464 KB Output is correct
39 Correct 1313 ms 3464 KB Output is correct
40 Correct 1308 ms 3480 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 408 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 254 ms 18040 KB Output is correct
12 Correct 277 ms 17784 KB Output is correct
13 Correct 244 ms 16888 KB Output is correct
14 Correct 257 ms 17016 KB Output is correct
15 Correct 258 ms 18056 KB Output is correct
16 Correct 258 ms 17276 KB Output is correct
17 Correct 272 ms 17112 KB Output is correct
18 Correct 246 ms 19052 KB Output is correct
19 Correct 211 ms 15992 KB Output is correct
20 Correct 284 ms 17656 KB Output is correct
21 Correct 380 ms 17784 KB Output is correct
22 Correct 379 ms 18088 KB Output is correct
23 Correct 349 ms 17016 KB Output is correct
24 Correct 363 ms 16788 KB Output is correct
25 Correct 371 ms 18804 KB Output is correct
26 Correct 376 ms 17276 KB Output is correct
27 Correct 383 ms 17272 KB Output is correct
28 Correct 322 ms 19832 KB Output is correct
29 Correct 315 ms 15992 KB Output is correct
30 Correct 390 ms 18032 KB Output is correct
31 Correct 457 ms 17784 KB Output is correct
32 Correct 356 ms 17784 KB Output is correct
33 Correct 340 ms 16736 KB Output is correct
34 Correct 343 ms 16760 KB Output is correct
35 Correct 370 ms 17404 KB Output is correct
36 Correct 304 ms 15864 KB Output is correct
37 Correct 375 ms 17784 KB Output is correct
38 Correct 324 ms 15736 KB Output is correct
39 Correct 365 ms 17016 KB Output is correct
40 Correct 356 ms 16760 KB Output is correct
41 Correct 1297 ms 3584 KB Output is correct
42 Correct 1284 ms 3608 KB Output is correct
43 Correct 1291 ms 3468 KB Output is correct
44 Correct 1283 ms 3480 KB Output is correct
45 Correct 1295 ms 3612 KB Output is correct
46 Correct 1285 ms 3608 KB Output is correct
47 Correct 1289 ms 3480 KB Output is correct
48 Correct 1304 ms 3864 KB Output is correct
49 Correct 1284 ms 3352 KB Output is correct
50 Correct 1286 ms 3600 KB Output is correct
51 Correct 1281 ms 3608 KB Output is correct
52 Correct 1292 ms 3480 KB Output is correct
53 Correct 1289 ms 3480 KB Output is correct
54 Correct 1291 ms 3480 KB Output is correct
55 Correct 1291 ms 3480 KB Output is correct
56 Correct 1270 ms 3352 KB Output is correct
57 Correct 1289 ms 3596 KB Output is correct
58 Correct 1274 ms 3352 KB Output is correct
59 Correct 1292 ms 3464 KB Output is correct
60 Correct 1309 ms 3464 KB Output is correct
61 Correct 1327 ms 3464 KB Output is correct
62 Correct 1383 ms 3464 KB Output is correct
63 Correct 1304 ms 3464 KB Output is correct
64 Correct 1281 ms 3352 KB Output is correct
65 Correct 1311 ms 3480 KB Output is correct
66 Correct 1296 ms 3460 KB Output is correct
67 Correct 1293 ms 3460 KB Output is correct
68 Correct 1303 ms 3464 KB Output is correct
69 Correct 1313 ms 3464 KB Output is correct
70 Correct 1308 ms 3480 KB Output is correct
71 Execution timed out 2083 ms 13296 KB Time limit exceeded
72 Halted 0 ms 0 KB -