oj.uz

답안 #399856

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
399856 2021-05-06T18:17:47 Z MarcoMeijer Snake Escaping (JOI18_snake_escaping) C++14
75 / 100
 2000 ms 35124 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];
vi withQ, withoutQ;
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);
            withoutQ.pb(i);
        } else {
            withQ.pb(i);
        }
    }

    // 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));
        FOR(j,withoutQ) tot[j] = a[bm|nxt1[j]];
        FOR(j,withQ) 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

# 결과 실행 시간 메모리 Grader output
1 Correct 568 ms 8884 KB Output is correct
2 Correct 564 ms 8780 KB Output is correct
3 Correct 572 ms 8832 KB Output is correct
4 Correct 562 ms 8888 KB Output is correct
5 Correct 547 ms 8836 KB Output is correct
6 Correct 570 ms 8884 KB Output is correct
7 Correct 570 ms 8840 KB Output is correct
8 Correct 563 ms 8760 KB Output is correct
9 Correct 568 ms 8840 KB Output is correct
10 Correct 565 ms 8884 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 568 ms 8884 KB Output is correct
2 Correct 564 ms 8780 KB Output is correct
3 Correct 572 ms 8832 KB Output is correct
4 Correct 562 ms 8888 KB Output is correct
5 Correct 547 ms 8836 KB Output is correct
6 Correct 570 ms 8884 KB Output is correct
7 Correct 570 ms 8840 KB Output is correct
8 Correct 563 ms 8760 KB Output is correct
9 Correct 568 ms 8840 KB Output is correct
10 Correct 565 ms 8884 KB Output is correct
11 Correct 1290 ms 24520 KB Output is correct
12 Correct 1249 ms 24256 KB Output is correct
13 Correct 1271 ms 23476 KB Output is correct
14 Correct 1276 ms 23616 KB Output is correct
15 Correct 1277 ms 24720 KB Output is correct
16 Correct 1296 ms 23704 KB Output is correct
17 Correct 1296 ms 23820 KB Output is correct
18 Correct 1251 ms 25572 KB Output is correct
19 Correct 1285 ms 22488 KB Output is correct
20 Correct 1314 ms 24264 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 568 ms 8884 KB Output is correct
2 Correct 564 ms 8780 KB Output is correct
3 Correct 572 ms 8832 KB Output is correct
4 Correct 562 ms 8888 KB Output is correct
5 Correct 547 ms 8836 KB Output is correct
6 Correct 570 ms 8884 KB Output is correct
7 Correct 570 ms 8840 KB Output is correct
8 Correct 563 ms 8760 KB Output is correct
9 Correct 568 ms 8840 KB Output is correct
10 Correct 565 ms 8884 KB Output is correct
11 Correct 1290 ms 24520 KB Output is correct
12 Correct 1249 ms 24256 KB Output is correct
13 Correct 1271 ms 23476 KB Output is correct
14 Correct 1276 ms 23616 KB Output is correct
15 Correct 1277 ms 24720 KB Output is correct
16 Correct 1296 ms 23704 KB Output is correct
17 Correct 1296 ms 23820 KB Output is correct
18 Correct 1251 ms 25572 KB Output is correct
19 Correct 1285 ms 22488 KB Output is correct
20 Correct 1314 ms 24264 KB Output is correct
21 Correct 1347 ms 28496 KB Output is correct
22 Correct 1263 ms 24756 KB Output is correct
23 Correct 1313 ms 27648 KB Output is correct
24 Correct 1313 ms 27420 KB Output is correct
25 Correct 1293 ms 29480 KB Output is correct
26 Correct 1320 ms 27936 KB Output is correct
27 Correct 1319 ms 27912 KB Output is correct
28 Correct 1253 ms 26596 KB Output is correct
29 Correct 1334 ms 26664 KB Output is correct
30 Correct 1329 ms 28560 KB Output is correct
31 Correct 1323 ms 28452 KB Output is correct
32 Correct 1356 ms 28456 KB Output is correct
33 Correct 1320 ms 27368 KB Output is correct
34 Correct 1305 ms 27528 KB Output is correct
35 Correct 1327 ms 27856 KB Output is correct
36 Correct 1234 ms 26408 KB Output is correct
37 Correct 1264 ms 24628 KB Output is correct
38 Correct 1389 ms 26524 KB Output is correct
39 Correct 1321 ms 27840 KB Output is correct
40 Correct 1320 ms 27508 KB Output is correct

Subtask #4
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 568 ms 8884 KB Output is correct
2 Correct 564 ms 8780 KB Output is correct
3 Correct 572 ms 8832 KB Output is correct
4 Correct 562 ms 8888 KB Output is correct
5 Correct 547 ms 8836 KB Output is correct
6 Correct 570 ms 8884 KB Output is correct
7 Correct 570 ms 8840 KB Output is correct
8 Correct 563 ms 8760 KB Output is correct
9 Correct 568 ms 8840 KB Output is correct
10 Correct 565 ms 8884 KB Output is correct
11 Correct 625 ms 16572 KB Output is correct
12 Correct 632 ms 16820 KB Output is correct
13 Correct 628 ms 16772 KB Output is correct
14 Correct 649 ms 16820 KB Output is correct
15 Correct 689 ms 16844 KB Output is correct
16 Correct 648 ms 16840 KB Output is correct
17 Correct 644 ms 16772 KB Output is correct
18 Correct 615 ms 16560 KB Output is correct
19 Correct 626 ms 16648 KB Output is correct
20 Correct 625 ms 16692 KB Output is correct
21 Correct 663 ms 16820 KB Output is correct
22 Correct 648 ms 16856 KB Output is correct
23 Correct 666 ms 16692 KB Output is correct
24 Correct 650 ms 16792 KB Output is correct
25 Correct 646 ms 16772 KB Output is correct
26 Correct 598 ms 16568 KB Output is correct
27 Correct 616 ms 16692 KB Output is correct
28 Correct 629 ms 16688 KB Output is correct
29 Correct 661 ms 16892 KB Output is correct
30 Correct 645 ms 16960 KB Output is correct
31 Correct 624 ms 16820 KB Output is correct
32 Correct 648 ms 16820 KB Output is correct
33 Correct 645 ms 16904 KB Output is correct
34 Correct 600 ms 16444 KB Output is correct
35 Correct 673 ms 16772 KB Output is correct
36 Correct 665 ms 16772 KB Output is correct
37 Correct 674 ms 16956 KB Output is correct
38 Correct 674 ms 16820 KB Output is correct
39 Correct 670 ms 16948 KB Output is correct
40 Correct 676 ms 16772 KB Output is correct

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 568 ms 8884 KB Output is correct
2 Correct 564 ms 8780 KB Output is correct
3 Correct 572 ms 8832 KB Output is correct
4 Correct 562 ms 8888 KB Output is correct
5 Correct 547 ms 8836 KB Output is correct
6 Correct 570 ms 8884 KB Output is correct
7 Correct 570 ms 8840 KB Output is correct
8 Correct 563 ms 8760 KB Output is correct
9 Correct 568 ms 8840 KB Output is correct
10 Correct 565 ms 8884 KB Output is correct
11 Correct 1290 ms 24520 KB Output is correct
12 Correct 1249 ms 24256 KB Output is correct
13 Correct 1271 ms 23476 KB Output is correct
14 Correct 1276 ms 23616 KB Output is correct
15 Correct 1277 ms 24720 KB Output is correct
16 Correct 1296 ms 23704 KB Output is correct
17 Correct 1296 ms 23820 KB Output is correct
18 Correct 1251 ms 25572 KB Output is correct
19 Correct 1285 ms 22488 KB Output is correct
20 Correct 1314 ms 24264 KB Output is correct
21 Correct 1347 ms 28496 KB Output is correct
22 Correct 1263 ms 24756 KB Output is correct
23 Correct 1313 ms 27648 KB Output is correct
24 Correct 1313 ms 27420 KB Output is correct
25 Correct 1293 ms 29480 KB Output is correct
26 Correct 1320 ms 27936 KB Output is correct
27 Correct 1319 ms 27912 KB Output is correct
28 Correct 1253 ms 26596 KB Output is correct
29 Correct 1334 ms 26664 KB Output is correct
30 Correct 1329 ms 28560 KB Output is correct
31 Correct 1323 ms 28452 KB Output is correct
32 Correct 1356 ms 28456 KB Output is correct
33 Correct 1320 ms 27368 KB Output is correct
34 Correct 1305 ms 27528 KB Output is correct
35 Correct 1327 ms 27856 KB Output is correct
36 Correct 1234 ms 26408 KB Output is correct
37 Correct 1264 ms 24628 KB Output is correct
38 Correct 1389 ms 26524 KB Output is correct
39 Correct 1321 ms 27840 KB Output is correct
40 Correct 1320 ms 27508 KB Output is correct
41 Correct 625 ms 16572 KB Output is correct
42 Correct 632 ms 16820 KB Output is correct
43 Correct 628 ms 16772 KB Output is correct
44 Correct 649 ms 16820 KB Output is correct
45 Correct 689 ms 16844 KB Output is correct
46 Correct 648 ms 16840 KB Output is correct
47 Correct 644 ms 16772 KB Output is correct
48 Correct 615 ms 16560 KB Output is correct
49 Correct 626 ms 16648 KB Output is correct
50 Correct 625 ms 16692 KB Output is correct
51 Correct 663 ms 16820 KB Output is correct
52 Correct 648 ms 16856 KB Output is correct
53 Correct 666 ms 16692 KB Output is correct
54 Correct 650 ms 16792 KB Output is correct
55 Correct 646 ms 16772 KB Output is correct
56 Correct 598 ms 16568 KB Output is correct
57 Correct 616 ms 16692 KB Output is correct
58 Correct 629 ms 16688 KB Output is correct
59 Correct 661 ms 16892 KB Output is correct
60 Correct 645 ms 16960 KB Output is correct
61 Correct 624 ms 16820 KB Output is correct
62 Correct 648 ms 16820 KB Output is correct
63 Correct 645 ms 16904 KB Output is correct
64 Correct 600 ms 16444 KB Output is correct
65 Correct 673 ms 16772 KB Output is correct
66 Correct 665 ms 16772 KB Output is correct
67 Correct 674 ms 16956 KB Output is correct
68 Correct 674 ms 16820 KB Output is correct
69 Correct 670 ms 16948 KB Output is correct
70 Correct 676 ms 16772 KB Output is correct
71 Correct 1664 ms 32672 KB Output is correct
72 Correct 1653 ms 32696 KB Output is correct
73 Correct 1872 ms 35124 KB Output is correct
74 Execution timed out 2093 ms 32012 KB Time limit exceeded
75 Halted 0 ms 0 KB -