oj.uz

Submission #399848

# Submission time Handle Problem Language Result Execution time Memory
399848 2021-05-06T18:01:17 Z MarcoMeijer Snake Escaping (JOI18_snake_escaping) C++14
58 / 100
 2000 ms 15996 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 = 12;

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 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;
    RE(_,20-SQ) ways3 *= 3;
    RE(i,ways3) {
        string t = intToString(i);
        nxt1[i] = -1, nxt2[i] = -1;
        RE(j,20-SQ) if(t[j] == '?') {
            t[j] = '0';
            nxt1[i] = stringToInt(t);
            t[j] = '1';
            nxt2[i] = stringToInt(t);
            break;
        }
        if(nxt1[i] == -1) {
            nxt1[i] = 0;
            RE(j,20-SQ) if(t[19-SQ-j] == '1') nxt1[i] |= (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] = stringToInt(t.substr(SQ,20-SQ));
    }

    RE(i,(1<<SQ)) {
        int bm = (i<<(20-SQ));
        RE(j,ways3) {
            if(nxt2[j] == -1) {
                tot[j] = a[bm|nxt1[j]];
            } else {
                tot[j] = tot[nxt1[j]] + tot[nxt2[j]];
            }
        }
        RE(j,q)
            if((query0[j]&i) == 0 && (query1[j]&(~i)) == 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 38 ms 460 KB Output is correct
2 Correct 38 ms 468 KB Output is correct
3 Correct 38 ms 460 KB Output is correct
4 Correct 38 ms 476 KB Output is correct
5 Correct 38 ms 460 KB Output is correct
6 Correct 38 ms 468 KB Output is correct
7 Correct 38 ms 460 KB Output is correct
8 Correct 40 ms 460 KB Output is correct
9 Correct 40 ms 464 KB Output is correct
10 Correct 38 ms 460 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 460 KB Output is correct
2 Correct 38 ms 468 KB Output is correct
3 Correct 38 ms 460 KB Output is correct
4 Correct 38 ms 476 KB Output is correct
5 Correct 38 ms 460 KB Output is correct
6 Correct 38 ms 468 KB Output is correct
7 Correct 38 ms 460 KB Output is correct
8 Correct 40 ms 460 KB Output is correct
9 Correct 40 ms 464 KB Output is correct
10 Correct 38 ms 460 KB Output is correct
11 Execution timed out 2097 ms 15996 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 460 KB Output is correct
2 Correct 38 ms 468 KB Output is correct
3 Correct 38 ms 460 KB Output is correct
4 Correct 38 ms 476 KB Output is correct
5 Correct 38 ms 460 KB Output is correct
6 Correct 38 ms 468 KB Output is correct
7 Correct 38 ms 460 KB Output is correct
8 Correct 40 ms 460 KB Output is correct
9 Correct 40 ms 464 KB Output is correct
10 Correct 38 ms 460 KB Output is correct
11 Execution timed out 2097 ms 15996 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 460 KB Output is correct
2 Correct 38 ms 468 KB Output is correct
3 Correct 38 ms 460 KB Output is correct
4 Correct 38 ms 476 KB Output is correct
5 Correct 38 ms 460 KB Output is correct
6 Correct 38 ms 468 KB Output is correct
7 Correct 38 ms 460 KB Output is correct
8 Correct 40 ms 460 KB Output is correct
9 Correct 40 ms 464 KB Output is correct
10 Correct 38 ms 460 KB Output is correct
11 Correct 333 ms 6644 KB Output is correct
12 Correct 342 ms 8516 KB Output is correct
13 Correct 331 ms 8684 KB Output is correct
14 Correct 436 ms 8676 KB Output is correct
15 Correct 1104 ms 8796 KB Output is correct
16 Correct 618 ms 8676 KB Output is correct
17 Correct 532 ms 8668 KB Output is correct
18 Correct 285 ms 8480 KB Output is correct
19 Correct 303 ms 8540 KB Output is correct
20 Correct 355 ms 8696 KB Output is correct
21 Correct 719 ms 8676 KB Output is correct
22 Correct 535 ms 8672 KB Output is correct
23 Correct 941 ms 8672 KB Output is correct
24 Correct 476 ms 8704 KB Output is correct
25 Correct 528 ms 8672 KB Output is correct
26 Correct 273 ms 8348 KB Output is correct
27 Correct 309 ms 8464 KB Output is correct
28 Correct 337 ms 8636 KB Output is correct
29 Correct 685 ms 8788 KB Output is correct
30 Correct 428 ms 8668 KB Output is correct
31 Correct 276 ms 8676 KB Output is correct
32 Correct 488 ms 8644 KB Output is correct
33 Correct 544 ms 8676 KB Output is correct
34 Correct 248 ms 8420 KB Output is correct
35 Correct 937 ms 8696 KB Output is correct
36 Correct 917 ms 8676 KB Output is correct
37 Correct 925 ms 8716 KB Output is correct
38 Correct 923 ms 8764 KB Output is correct
39 Correct 933 ms 8676 KB Output is correct
40 Correct 922 ms 8672 KB Output is correct

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 460 KB Output is correct
2 Correct 38 ms 468 KB Output is correct
3 Correct 38 ms 460 KB Output is correct
4 Correct 38 ms 476 KB Output is correct
5 Correct 38 ms 460 KB Output is correct
6 Correct 38 ms 468 KB Output is correct
7 Correct 38 ms 460 KB Output is correct
8 Correct 40 ms 460 KB Output is correct
9 Correct 40 ms 464 KB Output is correct
10 Correct 38 ms 460 KB Output is correct
11 Execution timed out 2097 ms 15996 KB Time limit exceeded
12 Halted 0 ms 0 KB -