QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#309154#8129. Binary Sequenceucup-team1631#AC ✓87ms110860kbC++202.2kb2024-01-20 15:12:342024-01-20 15:12:34

Judging History

你现在查看的是最新测评结果

  • [2024-01-20 15:12:34]
  • 评测
  • 测评结果:AC
  • 用时:87ms
  • 内存:110860kb
  • [2024-01-20 15:12:34]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#include <time.h> 
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;

#define all(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)
template<class T>
bool chmax(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p < q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}
template<class T>
bool chmin(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p > q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}



int main() {

    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll N;
    cin >> N;
    vvll G(1, { 1 });
    ll OVCNT = 0;
    while (1) {
        ll LN = G.back().size();
        vll NG;
        ll k = 0, c = -1;


        for (ll i = LN - 1; i >= 0; i--) {
            if (c != G.back()[i] && k != 0) {
                NG.push_back(c);
                while (k > 0) {
                    NG.push_back(k % 2);
                    k /= 2;
                }
                c = G.back()[i];
                k = 1;
            }
            else {
                c = G.back()[i];
                k++;
            }
            if (NG.size() > 2e6) {
                k = 0;
                OVCNT++;
                break;
            }
        }
        if (k > 0) {
            NG.push_back(c);
            while (k > 0) {
                NG.push_back(k % 2);
                k /= 2;
            }
        }
        reverse(all(NG));
        G.push_back(NG);
        if (OVCNT > 1) {
            break;
        }
    }

    ll GN=G.size();
    rep(i,GN)reverse(all(G[i]));
    rep(i, N) {
        ll A,B;
        cin>>A>>B;
        A--;
        if(A>=GN){
            ll D=A-GN-1;
            if(D%2==0)A=GN-1;
            else A=GN-2;
        }
        if(A<GN){
            if(G[A].size()<=B)cout<<0<<endl;
            else cout<<G[A][B]<<endl;
        }
    }

}

这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 44ms
memory: 110100kb

input:

10
4 0
4 1
4 2
4 3
4 4
4 5
4 6
6 3
6 7
118999881999119725 3

output:

1
1
0
1
1
1
0
1
1
0

result:

ok 10 numbers

Test #2:

score: 0
Accepted
time: 47ms
memory: 110860kb

input:

10
28 69772
10 7908
4 3198
4 85913
14 52729
3 20445
9 88912
17 23743
25 37356
2 97697

output:

0
0
0
0
0
0
0
0
0
0

result:

ok 10 numbers

Test #3:

score: 0
Accepted
time: 40ms
memory: 110072kb

input:

100
29 110358
18 13645
18 590344
36 550462
11 133055
8 769352
11 265432
7 158530
12 29189
2 830361
11 584395
31 693707
7 879812
19 25069
21 616926
3 85158
31 675739
17 118385
24 315535
29 59615
10 33445
17 609235
8 738138
20 209540
4 287616
32 522302
26 959741
5 453537
27 74313
28 296289
28 857972
2...

output:

0
0
0
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
0
1
0
0
0
1
0
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
1
1
0
0
0
0
1
0
0
0
0
0
1
0
1
0
1
0
1
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
1
0
0

result:

ok 100 numbers

Test #4:

score: 0
Accepted
time: 87ms
memory: 110176kb

input:

100000
702433635413308636 962533
864089450531108488 538792
262747333715821506 454514
859830947243984718 105219
365621373252206174 447331
890829905503831899 507146
116987306031929573 154370
157986473366693144 364746
502917586764426513 49981
874588963478161584 594867
467219058104100510 790503
11034861...

output:

1
1
1
1
1
1
1
0
1
0
1
0
1
1
1
1
0
1
1
1
1
1
0
1
0
0
0
0
1
1
1
0
0
1
1
0
0
1
0
1
1
1
1
0
0
0
0
1
1
0
0
1
0
0
1
0
1
1
1
1
1
1
1
0
1
1
1
0
0
0
1
1
1
0
1
1
1
1
1
1
0
1
0
1
1
1
0
0
0
1
0
0
1
0
1
1
1
1
1
1
0
0
0
0
0
0
0
1
0
0
1
0
1
0
1
0
1
1
0
1
1
0
1
0
0
0
1
1
0
1
1
0
0
1
1
1
1
1
0
0
0
0
0
0
1
1
1
0
0
1
...

result:

ok 100000 numbers

Extra Test:

score: 0
Extra Test Passed