oj.uz

Submission #399842

# Submission time Handle Problem Language Result Execution time Memory
399842 2021-05-06T17:52:02 Z MarcoMeijer Snake Escaping (JOI18_snake_escaping) C++14
5 / 100
 2000 ms 23236 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 = (1<<10);

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,10) {
        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(_,10) {
        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
    RE(i,59049) {
        string t = intToString(i);
        nxt1[i] = -1, nxt2[i] = -1;
        RE(j,10) 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,10) if(t[10-j-1] == '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,10) if(t[9-j] == 0) query0[i] |= (1<<j);
        RE(j,10) if(t[9-j] == 1) query1[i] |= (1<<j);
        lst[i] = stringToInt(t.substr(10,10));
    }

    RE(i,SQ) {
        RE(j,59049) {
            if(nxt2[j] == -1) {
                tot[j] = a[(i<<10)|nxt1[j]];
            } else {
                tot[j] = tot[nxt1[j]] + tot[nxt2[j]];
            }
        }
        RE(j,q) {
            bool possible = true;
            if(query0[j]&i) possible = false;
            if(query1[j]&(~i)) possible = false;
            if(possible) 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 82 ms 972 KB Output is correct
2 Correct 94 ms 972 KB Output is correct
3 Correct 83 ms 972 KB Output is correct
4 Correct 83 ms 972 KB Output is correct
5 Correct 84 ms 1084 KB Output is correct
6 Correct 83 ms 1072 KB Output is correct
7 Correct 83 ms 972 KB Output is correct
8 Correct 82 ms 972 KB Output is correct
9 Correct 84 ms 1044 KB Output is correct
10 Correct 82 ms 992 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 972 KB Output is correct
2 Correct 94 ms 972 KB Output is correct
3 Correct 83 ms 972 KB Output is correct
4 Correct 83 ms 972 KB Output is correct
5 Correct 84 ms 1084 KB Output is correct
6 Correct 83 ms 1072 KB Output is correct
7 Correct 83 ms 972 KB Output is correct
8 Correct 82 ms 972 KB Output is correct
9 Correct 84 ms 1044 KB Output is correct
10 Correct 82 ms 992 KB Output is correct
11 Correct 1750 ms 13004 KB Output is correct
12 Correct 1916 ms 23236 KB Output is correct
13 Execution timed out 2059 ms 20288 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 972 KB Output is correct
2 Correct 94 ms 972 KB Output is correct
3 Correct 83 ms 972 KB Output is correct
4 Correct 83 ms 972 KB Output is correct
5 Correct 84 ms 1084 KB Output is correct
6 Correct 83 ms 1072 KB Output is correct
7 Correct 83 ms 972 KB Output is correct
8 Correct 82 ms 972 KB Output is correct
9 Correct 84 ms 1044 KB Output is correct
10 Correct 82 ms 992 KB Output is correct
11 Correct 1750 ms 13004 KB Output is correct
12 Correct 1916 ms 23236 KB Output is correct
13 Execution timed out 2059 ms 20288 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 972 KB Output is correct
2 Correct 94 ms 972 KB Output is correct
3 Correct 83 ms 972 KB Output is correct
4 Correct 83 ms 972 KB Output is correct
5 Correct 84 ms 1084 KB Output is correct
6 Correct 83 ms 1072 KB Output is correct
7 Correct 83 ms 972 KB Output is correct
8 Correct 82 ms 972 KB Output is correct
9 Correct 84 ms 1044 KB Output is correct
10 Correct 82 ms 992 KB Output is correct
11 Incorrect 176 ms 7012 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 972 KB Output is correct
2 Correct 94 ms 972 KB Output is correct
3 Correct 83 ms 972 KB Output is correct
4 Correct 83 ms 972 KB Output is correct
5 Correct 84 ms 1084 KB Output is correct
6 Correct 83 ms 1072 KB Output is correct
7 Correct 83 ms 972 KB Output is correct
8 Correct 82 ms 972 KB Output is correct
9 Correct 84 ms 1044 KB Output is correct
10 Correct 82 ms 992 KB Output is correct
11 Correct 1750 ms 13004 KB Output is correct
12 Correct 1916 ms 23236 KB Output is correct
13 Execution timed out 2059 ms 20288 KB Time limit exceeded
14 Halted 0 ms 0 KB -