QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #313265 | #4832. Telepathy | tuanlinh123 | 0 | 7ms | 5876kb | C++20 | 575b | 2024-01-24 16:58:14 | 2024-01-24 16:58:15 |
answer
#include<bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ld long double
using namespace std;
ll str[8]={2, 0, 1, 1, 2, 2, 2, 2};
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
string s; cin >> s;
ll n, k; cin >> n >> k >> s;
vector <ll> ans;
for (ll i=1; i<=n; i+=10)
{
ll bit=(s[i-1]-'0')+(s[i]-'0')*2+(s[i+1]-'0')*4;
ans.pb(i+str[bit]-1);
}
for (ll i:ans) cout << i << " ";
}
詳細信息
Test #1:
score: 0
Wrong Answer
time: 7ms
memory: 5876kb
input:
Flim 1000000 100000 1101111111100010011110111001110011110110100000111110011111111111110111110100000001001000000110111000000101110000001100111110100100000100010111001011111010001000101100101100001111011100110010010000100100100101110100100110101001001000001011111101111111001100101000010110001011011000...
output:
1 10 22 32 40 50 62 71 81 92 102 112 122 132 141 152 162 172 181 191 202 211 222 232 241 252 262 272 282 292 302 311 322 331 340 352 362 372 381 392 401 410 422 432 442 452 462 472 482 492 502 511 522 532 542 552 562 572 581 591 602 612 622 632 641 652 662 672 682 692 702 712 722 731 742 751 760 771...
input:
Flam 1000000 100000 0000001101000100010010001001011111000101010011011001010100101001110101001011001011100001011100110100011110011010100101110101101101100101111011000111001101001100010000010010101110101010111110001100110000110001001111010010000010111101110001011011101101010000111111011111100100010001...
output:
2 12 20 32 41 51 60 72 82 91 102 112 121 130 141 151 161 172 182 192 202 212 222 232 242 251 261 271 282 292 302 311 321 332 342 351 361 372 381 390 401 410 422 432 442 452 462 472 481 492 502 512 522 532 542 551 562 571 581 591 602 612 621 632 641 652 662 670 681 692 702 711 721 732 742 752 762 772...
result:
wrong answer 47569 matched, but you need to match at least 66666 positions