oj.uz

Submission #399861

# Submission time Handle Problem Language Result Execution time Memory
399861 2021-05-06T18:28:25 Z MarcoMeijer Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 2000 ms 33880 KB 
#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
// dp
template<class T> bool ckmin(T&a, T&b) { bool bl = a > b; a = min(a,b); return bl;}
template<class T> bool ckmax(T&a, T&b) { bool bl = a < b; a = max(a,b); return bl;}
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int N = (1<<20);
const int SQ = 8;

int n, l, q;
int a[N];
int nxt1[N], nxt2[N];
int tot[N], ans[N];
string s;
int query0[N], query1[N];
int f[N], m;
int lst[N];

int stringToInt(string s) {
    int res = 0;
    RE(i,20-SQ) {
        res *= 3;
        if(s[i] == '0') res += 0;
        if(s[i] == '1') res += 1;
        if(s[i] == '?') res += 2;
    }
    return res;
}
string intToString(int x) {
    string res;
    RE(_,20-SQ) {
        if((x%3) == 0) res += '0';
        if((x%3) == 1) res += '1';
        if((x%3) == 2) res += '?';
        x /= 3;
    }
    reverse(all(res));
    return res;
}

void program() {
    // pre calculations
    int ways3 = 1;
    m = (1<<(20-SQ));
    RE(_,20-SQ) ways3 *= 3;
    int x=0, y=m;
    RE(i,ways3) {
        string t = intToString(i);
        int a = 0;
        bool hasQ = false;
        RE(j,20-SQ) if(t[j] == '?') hasQ = true;
        if(hasQ) a = y++;
        else     a = x++;
        f[i] = a;
        
        nxt1[a] = -1, nxt2[a] = -1;
        RE(j,20-SQ) if(t[j] == '?') {
            t[j] = '0';
            nxt1[a] = f[stringToInt(t)];
            t[j] = '1';
            nxt2[a] = f[stringToInt(t)];
            break;
        }
        if(!hasQ) {
            nxt1[a] = 0;
            RE(j,20-SQ) if(t[19-SQ-j] == '1') nxt1[a] |= (1<<j);
        }
    }

    // input
    IN(l,q,s); n=(1<<l);
    RE(i,n) a[i] = s[i]-'0';
    string u; u.assign(20-l,'0');
    RE(i,q) {
        string t; IN(t);
        t = u + t;
        RE(j,SQ) if(t[SQ-1-j] == '0') query0[i] |= (1<<j);
        RE(j,SQ) if(t[SQ-1-j] == '1') query1[i] |= (1<<j);
        lst[i] = f[stringToInt(t.substr(SQ,20-SQ))];
    }

    RE(i,(1<<SQ)) {
        int bm = (i<<(20-SQ));
        RE(j,m) tot[j] = a[bm|nxt1[j]];
        REP(j,m,ways3) tot[j] = tot[nxt1[j]] + tot[nxt2[j]];
        int ri = ~i;
        RE(j,q)
            if((query0[j]&i) == 0 && (query1[j]&ri) == 0)
                ans[j] += tot[lst[j]];
    }

    RE(i,q) OUTL(ans[i]);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 256 ms 8684 KB Output is correct
2 Correct 255 ms 8684 KB Output is correct
3 Correct 251 ms 8772 KB Output is correct
4 Correct 251 ms 8644 KB Output is correct
5 Correct 251 ms 8772 KB Output is correct
6 Correct 259 ms 8720 KB Output is correct
7 Correct 249 ms 8644 KB Output is correct
8 Correct 252 ms 8696 KB Output is correct
9 Correct 259 ms 8644 KB Output is correct
10 Correct 250 ms 8660 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 256 ms 8684 KB Output is correct
2 Correct 255 ms 8684 KB Output is correct
3 Correct 251 ms 8772 KB Output is correct
4 Correct 251 ms 8644 KB Output is correct
5 Correct 251 ms 8772 KB Output is correct
6 Correct 259 ms 8720 KB Output is correct
7 Correct 249 ms 8644 KB Output is correct
8 Correct 252 ms 8696 KB Output is correct
9 Correct 259 ms 8644 KB Output is correct
10 Correct 250 ms 8660 KB Output is correct
11 Correct 822 ms 26664 KB Output is correct
12 Correct 797 ms 26312 KB Output is correct
13 Correct 816 ms 25484 KB Output is correct
14 Correct 809 ms 26652 KB Output is correct
15 Correct 817 ms 27584 KB Output is correct
16 Correct 835 ms 26692 KB Output is correct
17 Correct 835 ms 26656 KB Output is correct
18 Correct 789 ms 28572 KB Output is correct
19 Correct 818 ms 25700 KB Output is correct
20 Correct 881 ms 27280 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 256 ms 8684 KB Output is correct
2 Correct 255 ms 8684 KB Output is correct
3 Correct 251 ms 8772 KB Output is correct
4 Correct 251 ms 8644 KB Output is correct
5 Correct 251 ms 8772 KB Output is correct
6 Correct 259 ms 8720 KB Output is correct
7 Correct 249 ms 8644 KB Output is correct
8 Correct 252 ms 8696 KB Output is correct
9 Correct 259 ms 8644 KB Output is correct
10 Correct 250 ms 8660 KB Output is correct
11 Correct 822 ms 26664 KB Output is correct
12 Correct 797 ms 26312 KB Output is correct
13 Correct 816 ms 25484 KB Output is correct
14 Correct 809 ms 26652 KB Output is correct
15 Correct 817 ms 27584 KB Output is correct
16 Correct 835 ms 26692 KB Output is correct
17 Correct 835 ms 26656 KB Output is correct
18 Correct 789 ms 28572 KB Output is correct
19 Correct 818 ms 25700 KB Output is correct
20 Correct 881 ms 27280 KB Output is correct
21 Correct 844 ms 31532 KB Output is correct
22 Correct 822 ms 27716 KB Output is correct
23 Correct 853 ms 30680 KB Output is correct
24 Correct 883 ms 30412 KB Output is correct
25 Correct 834 ms 32452 KB Output is correct
26 Correct 866 ms 30968 KB Output is correct
27 Correct 864 ms 30856 KB Output is correct
28 Correct 807 ms 29380 KB Output is correct
29 Correct 855 ms 29036 KB Output is correct
30 Correct 868 ms 31172 KB Output is correct
31 Correct 856 ms 31200 KB Output is correct
32 Correct 860 ms 31044 KB Output is correct
33 Correct 851 ms 29848 KB Output is correct
34 Correct 856 ms 29892 KB Output is correct
35 Correct 863 ms 30404 KB Output is correct
36 Correct 801 ms 28956 KB Output is correct
37 Correct 809 ms 27044 KB Output is correct
38 Correct 845 ms 29000 KB Output is correct
39 Correct 873 ms 30020 KB Output is correct
40 Correct 866 ms 29860 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 256 ms 8684 KB Output is correct
2 Correct 255 ms 8684 KB Output is correct
3 Correct 251 ms 8772 KB Output is correct
4 Correct 251 ms 8644 KB Output is correct
5 Correct 251 ms 8772 KB Output is correct
6 Correct 259 ms 8720 KB Output is correct
7 Correct 249 ms 8644 KB Output is correct
8 Correct 252 ms 8696 KB Output is correct
9 Correct 259 ms 8644 KB Output is correct
10 Correct 250 ms 8660 KB Output is correct
11 Correct 315 ms 16712 KB Output is correct
12 Correct 320 ms 16740 KB Output is correct
13 Correct 311 ms 16900 KB Output is correct
14 Correct 330 ms 16916 KB Output is correct
15 Correct 376 ms 17048 KB Output is correct
16 Correct 335 ms 16920 KB Output is correct
17 Correct 335 ms 16944 KB Output is correct
18 Correct 291 ms 16740 KB Output is correct
19 Correct 310 ms 16792 KB Output is correct
20 Correct 316 ms 16840 KB Output is correct
21 Correct 375 ms 16960 KB Output is correct
22 Correct 339 ms 16912 KB Output is correct
23 Correct 364 ms 16920 KB Output is correct
24 Correct 341 ms 16916 KB Output is correct
25 Correct 333 ms 16996 KB Output is correct
26 Correct 286 ms 16616 KB Output is correct
27 Correct 311 ms 16768 KB Output is correct
28 Correct 303 ms 16788 KB Output is correct
29 Correct 338 ms 16916 KB Output is correct
30 Correct 325 ms 16996 KB Output is correct
31 Correct 300 ms 16888 KB Output is correct
32 Correct 336 ms 16952 KB Output is correct
33 Correct 330 ms 16872 KB Output is correct
34 Correct 289 ms 16740 KB Output is correct
35 Correct 351 ms 16916 KB Output is correct
36 Correct 351 ms 16996 KB Output is correct
37 Correct 352 ms 16912 KB Output is correct
38 Correct 357 ms 16912 KB Output is correct
39 Correct 349 ms 16912 KB Output is correct
40 Correct 354 ms 17064 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 256 ms 8684 KB Output is correct
2 Correct 255 ms 8684 KB Output is correct
3 Correct 251 ms 8772 KB Output is correct
4 Correct 251 ms 8644 KB Output is correct
5 Correct 251 ms 8772 KB Output is correct
6 Correct 259 ms 8720 KB Output is correct
7 Correct 249 ms 8644 KB Output is correct
8 Correct 252 ms 8696 KB Output is correct
9 Correct 259 ms 8644 KB Output is correct
10 Correct 250 ms 8660 KB Output is correct
11 Correct 822 ms 26664 KB Output is correct
12 Correct 797 ms 26312 KB Output is correct
13 Correct 816 ms 25484 KB Output is correct
14 Correct 809 ms 26652 KB Output is correct
15 Correct 817 ms 27584 KB Output is correct
16 Correct 835 ms 26692 KB Output is correct
17 Correct 835 ms 26656 KB Output is correct
18 Correct 789 ms 28572 KB Output is correct
19 Correct 818 ms 25700 KB Output is correct
20 Correct 881 ms 27280 KB Output is correct
21 Correct 844 ms 31532 KB Output is correct
22 Correct 822 ms 27716 KB Output is correct
23 Correct 853 ms 30680 KB Output is correct
24 Correct 883 ms 30412 KB Output is correct
25 Correct 834 ms 32452 KB Output is correct
26 Correct 866 ms 30968 KB Output is correct
27 Correct 864 ms 30856 KB Output is correct
28 Correct 807 ms 29380 KB Output is correct
29 Correct 855 ms 29036 KB Output is correct
30 Correct 868 ms 31172 KB Output is correct
31 Correct 856 ms 31200 KB Output is correct
32 Correct 860 ms 31044 KB Output is correct
33 Correct 851 ms 29848 KB Output is correct
34 Correct 856 ms 29892 KB Output is correct
35 Correct 863 ms 30404 KB Output is correct
36 Correct 801 ms 28956 KB Output is correct
37 Correct 809 ms 27044 KB Output is correct
38 Correct 845 ms 29000 KB Output is correct
39 Correct 873 ms 30020 KB Output is correct
40 Correct 866 ms 29860 KB Output is correct
41 Correct 315 ms 16712 KB Output is correct
42 Correct 320 ms 16740 KB Output is correct
43 Correct 311 ms 16900 KB Output is correct
44 Correct 330 ms 16916 KB Output is correct
45 Correct 376 ms 17048 KB Output is correct
46 Correct 335 ms 16920 KB Output is correct
47 Correct 335 ms 16944 KB Output is correct
48 Correct 291 ms 16740 KB Output is correct
49 Correct 310 ms 16792 KB Output is correct
50 Correct 316 ms 16840 KB Output is correct
51 Correct 375 ms 16960 KB Output is correct
52 Correct 339 ms 16912 KB Output is correct
53 Correct 364 ms 16920 KB Output is correct
54 Correct 341 ms 16916 KB Output is correct
55 Correct 333 ms 16996 KB Output is correct
56 Correct 286 ms 16616 KB Output is correct
57 Correct 311 ms 16768 KB Output is correct
58 Correct 303 ms 16788 KB Output is correct
59 Correct 338 ms 16916 KB Output is correct
60 Correct 325 ms 16996 KB Output is correct
61 Correct 300 ms 16888 KB Output is correct
62 Correct 336 ms 16952 KB Output is correct
63 Correct 330 ms 16872 KB Output is correct
64 Correct 289 ms 16740 KB Output is correct
65 Correct 351 ms 16916 KB Output is correct
66 Correct 351 ms 16996 KB Output is correct
67 Correct 352 ms 16912 KB Output is correct
68 Correct 357 ms 16912 KB Output is correct
69 Correct 349 ms 16912 KB Output is correct
70 Correct 354 ms 17064 KB Output is correct
71 Correct 1253 ms 30752 KB Output is correct
72 Correct 1251 ms 30880 KB Output is correct
73 Correct 1427 ms 33252 KB Output is correct
74 Correct 1693 ms 33880 KB Output is correct
75 Execution timed out 2074 ms 29544 KB Time limit exceeded
76 Halted 0 ms 0 KB -