oj.uz

답안 #552236

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
552236 2022-04-22T20:36:49 Z urosk Snake Escaping (JOI18_snake_escaping) C++14
22 / 100
 2000 ms 24136 KB 
// __builtin_popcount(x) broj bitova
// __builtin_popcountll(x)
// __builtin_clz(x) vodece nule
// __builtin_clzll(x)
// __builtin_ctz(x) nule na pocetku
// __builtin_ctzll(x)
// 2000000011
// 2000000033
#include "bits/stdc++.h"
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define ld double
#define ll int
#define ull unsigned long long
#define llinf 100000000000000000LL // 10^17
#define iinf 2000000000 // 2*10^9
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) ((ll)(a.size()))
#define all(a) a.begin(),a.end()
#define rall(a) a.begin(),a.end(),greater<int>()
#define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());}
#define pi 3.14159265358979323846
#define here cerr<<"=============================================================================\n"
#define ceri(a,l,r) {for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
#define ceri2(a,l,r,n,m) {for(ll i = l;i<=r;i++){for(ll j = n;j<=m;j++) cerr<<a[i][j]<< " ";cerr<<endl;}}
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define daj_mi_malo_vremena ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);
using namespace std;
using namespace __gnu_pbds;

template<typename T> using vc = vector<T>;
template<typename T> using vvc = vc<vc<T>>;
typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<ll,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_multiset;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rnd(ll l,ll r){
    return uniform_int_distribution<ll>(l,r)(rng);
}

void setIO(string inoutname)
{
	freopen((inoutname+".in").c_str(),"r",stdin);
    	freopen((inoutname+".out").c_str(),"w",stdout);
}
#define mod 1
ll gcd(ll a, ll b)
{
   if(b==0) return a;
   if(a==0) return b;
   if(a>=b)  return gcd(a%b,b);
   return  gcd(a,b%a);
}
ll lcm(ll a,ll b){
   return (a/gcd(a,b))*b;
}
ll add(ll x,ll y){
    x+=y;
    if(x<0){
        x%=mod;
        x+=mod;
	if(x==mod) x = 0;
    }else{
        if(x>=mod) x%=mod;
    }
    return x;
}
ll mul(ll a,ll b){
	ll ans = (a*b)%mod;
	if(ans<0) ans+=mod;
	return ans;
}
ll po(ll x,ll y){
    if(y==0) return 1LL;
    ll ans = po(x,y/2);
    ans = mul(ans,ans);
    if(y&1) ans = mul(ans,x);
    return ans;
}
ll inv(ll x){return po(x,mod-2);}
#define maxn 2000005
ll n,q;
ll l;
ll sub[maxn],sup[maxn],btc[maxn];
ll s[maxn];
void tc(){
	daj_mi_malo_vremena
    cin >> l >> q;
    n = (1<<l)-1;
    string ss; cin >> ss;
    for(ll i = 0;i<=n;i++) s[i] = (ss[i]-'0');
    for(ll i = 0;i<=n;i++){
        btc[i] = __builtin_popcountll(i);
        sub[i] = sup[i] = s[i];
    }
    for(ll j = 0;j<l;j++){
        for(ll i = 0;i<=n;i++){
            if(((1<<j)&i)==0){
                sup[i]+=sup[i^(1<<j)];
            }else{
                sub[i]+=sub[i^(1<<j)];
            }
        }
    }

    ceri(sub,0,n);
    ceri(btc,0,n);
    while(q--){
        string ss; cin >> ss;
        ll a = 0,b = 0,c = 0;
        ll ca = 0,cb = 0,cc = 0;
        for(ll i = 0;i<l;i++){
            ll k = l-i-1;
            if(ss[i]=='0'){
                a|=(1<<k); ca++;
            }else if(ss[i]=='1'){
                b|=(1<<k); cb++;
            }else{
                c|=(1<<k); cc++;
            }
        }
        ll mc = min({ca,cb,cc});
        ll ans = 0;
        if(ca == mc){
            for(ll mask = a;mask!=0;mask=a&(mask-1)){
                ans+=(1-2*((btc[mask])&1))*sup[b|mask];
            }
            ans+=sup[b];
        }else if(cb==mc){
            for(ll mask = b;mask!=0;mask=b&(mask-1)){
                ans+=(1-2*((btc[mask])&1))*sub[c|(b^mask)];
            }
            ans += sub[c|b];
        }else{
            for(ll mask = c;mask!=0;mask=c&(mask-1)){
                ans+=s[b|mask];
            }
            ans+=s[b];
        }
        cout<<ans<<endl;
    }
}
int main(){
	daj_mi_malo_vremena
	//setIO("lol");
	int t; t = 1;
	while(t--){
		tc();
	}
	return 0;
}

Compilation message

snake_escaping.cpp: In function 'void setIO(std::string)':
snake_escaping.cpp:50:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |  freopen((inoutname+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
snake_escaping.cpp:51:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |      freopen((inoutname+".out").c_str(),"w",stdout);
      |      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 340 KB Output is correct
2 Correct 6 ms 380 KB Output is correct
3 Correct 5 ms 340 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 5 ms 340 KB Output is correct
6 Correct 6 ms 396 KB Output is correct
7 Correct 5 ms 340 KB Output is correct
8 Correct 5 ms 340 KB Output is correct
9 Correct 5 ms 340 KB Output is correct
10 Correct 5 ms 396 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 340 KB Output is correct
2 Correct 6 ms 380 KB Output is correct
3 Correct 5 ms 340 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 5 ms 340 KB Output is correct
6 Correct 6 ms 396 KB Output is correct
7 Correct 5 ms 340 KB Output is correct
8 Correct 5 ms 340 KB Output is correct
9 Correct 5 ms 340 KB Output is correct
10 Correct 5 ms 396 KB Output is correct
11 Correct 199 ms 15068 KB Output is correct
12 Correct 197 ms 14712 KB Output is correct
13 Correct 219 ms 13976 KB Output is correct
14 Correct 213 ms 14048 KB Output is correct
15 Correct 197 ms 15132 KB Output is correct
16 Correct 234 ms 14308 KB Output is correct
17 Correct 233 ms 14324 KB Output is correct
18 Correct 164 ms 16056 KB Output is correct
19 Correct 190 ms 13252 KB Output is correct
20 Correct 214 ms 14728 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 340 KB Output is correct
2 Correct 6 ms 380 KB Output is correct
3 Correct 5 ms 340 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 5 ms 340 KB Output is correct
6 Correct 6 ms 396 KB Output is correct
7 Correct 5 ms 340 KB Output is correct
8 Correct 5 ms 340 KB Output is correct
9 Correct 5 ms 340 KB Output is correct
10 Correct 5 ms 396 KB Output is correct
11 Correct 199 ms 15068 KB Output is correct
12 Correct 197 ms 14712 KB Output is correct
13 Correct 219 ms 13976 KB Output is correct
14 Correct 213 ms 14048 KB Output is correct
15 Correct 197 ms 15132 KB Output is correct
16 Correct 234 ms 14308 KB Output is correct
17 Correct 233 ms 14324 KB Output is correct
18 Correct 164 ms 16056 KB Output is correct
19 Correct 190 ms 13252 KB Output is correct
20 Correct 214 ms 14728 KB Output is correct
21 Correct 253 ms 18176 KB Output is correct
22 Correct 259 ms 18420 KB Output is correct
23 Correct 286 ms 17404 KB Output is correct
24 Correct 294 ms 17192 KB Output is correct
25 Correct 259 ms 19308 KB Output is correct
26 Correct 304 ms 17696 KB Output is correct
27 Correct 313 ms 17740 KB Output is correct
28 Correct 208 ms 20188 KB Output is correct
29 Correct 246 ms 16208 KB Output is correct
30 Correct 272 ms 18380 KB Output is correct
31 Correct 280 ms 18200 KB Output is correct
32 Correct 301 ms 18252 KB Output is correct
33 Correct 258 ms 17100 KB Output is correct
34 Correct 299 ms 17236 KB Output is correct
35 Correct 307 ms 17780 KB Output is correct
36 Correct 224 ms 16248 KB Output is correct
37 Correct 243 ms 18308 KB Output is correct
38 Correct 254 ms 16292 KB Output is correct
39 Correct 286 ms 17452 KB Output is correct
40 Correct 301 ms 17316 KB Output is correct

Subtask #4
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 340 KB Output is correct
2 Correct 6 ms 380 KB Output is correct
3 Correct 5 ms 340 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 5 ms 340 KB Output is correct
6 Correct 6 ms 396 KB Output is correct
7 Correct 5 ms 340 KB Output is correct
8 Correct 5 ms 340 KB Output is correct
9 Correct 5 ms 340 KB Output is correct
10 Correct 5 ms 396 KB Output is correct
11 Execution timed out 2063 ms 24136 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 340 KB Output is correct
2 Correct 6 ms 380 KB Output is correct
3 Correct 5 ms 340 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 5 ms 340 KB Output is correct
6 Correct 6 ms 396 KB Output is correct
7 Correct 5 ms 340 KB Output is correct
8 Correct 5 ms 340 KB Output is correct
9 Correct 5 ms 340 KB Output is correct
10 Correct 5 ms 396 KB Output is correct
11 Correct 199 ms 15068 KB Output is correct
12 Correct 197 ms 14712 KB Output is correct
13 Correct 219 ms 13976 KB Output is correct
14 Correct 213 ms 14048 KB Output is correct
15 Correct 197 ms 15132 KB Output is correct
16 Correct 234 ms 14308 KB Output is correct
17 Correct 233 ms 14324 KB Output is correct
18 Correct 164 ms 16056 KB Output is correct
19 Correct 190 ms 13252 KB Output is correct
20 Correct 214 ms 14728 KB Output is correct
21 Correct 253 ms 18176 KB Output is correct
22 Correct 259 ms 18420 KB Output is correct
23 Correct 286 ms 17404 KB Output is correct
24 Correct 294 ms 17192 KB Output is correct
25 Correct 259 ms 19308 KB Output is correct
26 Correct 304 ms 17696 KB Output is correct
27 Correct 313 ms 17740 KB Output is correct
28 Correct 208 ms 20188 KB Output is correct
29 Correct 246 ms 16208 KB Output is correct
30 Correct 272 ms 18380 KB Output is correct
31 Correct 280 ms 18200 KB Output is correct
32 Correct 301 ms 18252 KB Output is correct
33 Correct 258 ms 17100 KB Output is correct
34 Correct 299 ms 17236 KB Output is correct
35 Correct 307 ms 17780 KB Output is correct
36 Correct 224 ms 16248 KB Output is correct
37 Correct 243 ms 18308 KB Output is correct
38 Correct 254 ms 16292 KB Output is correct
39 Correct 286 ms 17452 KB Output is correct
40 Correct 301 ms 17316 KB Output is correct
41 Execution timed out 2063 ms 24136 KB Time limit exceeded
42 Halted 0 ms 0 KB -