Submission #873279

#	Time	Username	Problem	Language	Result	Execution time	Memory
873279		garam1732	Snake Escaping (JOI18_snake_escaping)	C++14	75 / 100	788 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];

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

void solve(vector<int>& v, int s, int e, int x) {
    //cout << s << bl << e << bl << x << endl;
    if(s > e) return;
    if(x == qry[e].s.size()) {
        for(int i = s; i <= e; i++) ans[qry[i].x] = v[0];
        return;
    }

    int a = s;
    vector<int> w, u;
    for(a = s; a <= e; a++) {
        if(qry[a].s[x] != '0') break;
    }

    for(int i = 0; i < v.size(); i++) {
        if(2*i < v.size()) w.push_back(v[i]);
        else u.push_back(v[i]);
    }

    solve(w, s, a-1, x+1);

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

    solve(u, s, a-1, x+1);

    s = a;
    for(int i = 0; 2*i<v.size(); i++) v[i] += v[i+v.size()/2];
    v.resize(v.size()/2);
    solve(v, s, e, x+1);
}

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

    int l, q; cin >> l >> q;
    string s; cin >> s;
    for(int i = 0; i < s.size(); i++) v.push_back(s[i]-'0');

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

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

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

Compilation message (stderr)

snake_escaping.cpp: In function 'void solve(std::vector<int>&, int, int, int)':
snake_escaping.cpp:28:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |     if(x == qry[e].s.size()) {
      |        ~~^~~~~~~~~~~~~~~~~~
snake_escaping.cpp:39:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     for(int i = 0; i < v.size(); i++) {
      |                    ~~^~~~~~~~~~
snake_escaping.cpp:40:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |         if(2*i < v.size()) w.push_back(v[i]);
      |            ~~~~^~~~~~~~~~
snake_escaping.cpp:54:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |     for(int i = 0; 2*i<v.size(); i++) v[i] += v[i+v.size()/2];
      |                    ~~~^~~~~~~~~
snake_escaping.cpp: In function 'int main()':
snake_escaping.cpp:64:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |     for(int i = 0; i < s.size(); i++) v.push_back(s[i]-'0');
      |                    ~~^~~~~~~~~~

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