Submission #873399

#	Time	Username	Problem	Language	Result	Execution time	Memory
873399		garam1732	Snake Escaping (JOI18_snake_escaping)	C++14	75 / 100	2099 ms	65536 KiB

snake_escaping

#include <bits/stdc++.h>
using namespace std;

#define ff first
#define ss second
#define bl " "
#define endl "\n"
#define all(v) v.begin(), v.end()
#define comp(v) v.erase(unique(all(v)), v.end())
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<pi, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1000100;
const int MOD = 1e9+7;

struct Query {
    string s; int x;
}qry[MAXN/2];

vector<int> v;
int ans[MAXN];

void solve(int s, int e, int l, int r, int x) {
    if(s > e) return;
    if(l == r) {
        for(int i = s; i <= e; i++) ans[qry[i].x] = v[l];
        return;
    }

    int a = s, mid = l+r>>1;
    for(a = s; a <= e; a++) {
        if(qry[a].s[x] != '0') break;
    }

    solve(s, a-1, l, mid, x+1);

    s = a;
    for(; a <= e; a++) {
        if(qry[a].s[x] != '1') break;
    }

    solve(s, a-1, mid+1, r, x+1);

    s = a;
    for(int i = l, j = mid+1; j <= r; i++, j++) v[i] += v[j];
    solve(s, e, l, mid, x+1);
    for(int i = l, j = mid+1; j <= r; i++, j++) v[i] -= v[j];
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);

    int l, q; cin >> l >> q; char x;
    for(int i = 0; i < (1<<l); i++) {
        cin >> x; v.push_back(x-'0');
    }

    for(int i = 0; i < q/2; i++) {
        cin >> qry[i].s; qry[i].x = i;
    }

    sort(qry, qry+q/2, [](Query a, Query b){return a.s < b.s;});
    solve(0, q/2-1, 0, (1<<l)-1, 0);

    for(int i = 0; i < q/2; i++) cout << ans[i] << endl;

    for(int i = q/2; i < q; i++) {
        cin >> qry[i-q/2].s; qry[i-q/2].x = i-q/2;
    }

    sort(qry, qry+q-q/2, [](Query a, Query b){return a.s < b.s;});
    solve(0, q-q/2-1, 0, (1<<l)-1, 0);

    for(int i = 0; i < q-q/2; i++) cout << ans[i] << endl;
}

Compilation message (stderr)

snake_escaping.cpp: In function 'void solve(int, int, int, int, int)':
snake_escaping.cpp:32:23: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   32 |     int a = s, mid = l+r>>1;
      |                      ~^~

• Subtask 1: 5 / 5
• Subtask 2: 7 / 7
• Subtask 3: 10 / 10
• Subtask 4: 53 / 53
• Subtask 5: 0 / 25