QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#309778 | #8129. Binary Sequence | ucup-team027# | AC ✓ | 47ms | 12204kb | C++23 | 1.1kb | 2024-01-20 20:41:55 | 2024-01-20 20:41:57 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
string tobin(int n) {
if (n == 0) return "0";
string ans;
while (n) {
ans.push_back('0' + (n % 2));
n /= 2;
}
reverse(ans.begin(), ans.end());
return ans;
}
string process(string s) {
char prv = '-';
int cnt = 0;
string ans;
for (char c: s) {
if (c != prv) {
if (prv == '-') {
prv = c; cnt = 1; continue;
} else {
ans += tobin(cnt);
ans += prv;
prv = c; cnt = 1;
}
} else {
cnt++;
}
}
ans += tobin(cnt);
ans += prv;
return ans;
}
signed main() {
ios::sync_with_stdio(0); cin.tie(0);
vector<string> rx;
string s = "1";
rx.push_back(s);
for (int i = 1; i <= 36; i++) {
s = process(s);
rx.push_back(s);
}
int t; cin >> t;
while (t--) {
long long n; int m;
cin >> n >> m; n--;
if (n <= 36) {
if (m >= rx[n].size()) cout << "0\n";
else cout << rx[n][rx[n].size() - m - 1] << '\n';
} else {
n %= 2; n ^= 1; n += 35;
cout << rx[n][rx[n].size() - m - 1] << '\n';
}
}
return 0;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 37ms
memory: 12160kb
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: 28ms
memory: 11972kb
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: 35ms
memory: 12204kb
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: 47ms
memory: 12140kb
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