QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #313174 | #4832. Telepathy | tuanlinh123 | 0 | 7ms | 5740kb | C++20 | 571b | 2024-01-24 16:26:49 | 2024-01-24 16:26:50 |
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 s[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]-'0')+(s[i+1]-'0')*2+(s[i+2]-'0')*4;
ans.pb(i+s[bit]);
}
for (ll i:ans) cout << i << " ";
}
详细
Test #1:
score: 0
Wrong Answer
time: 7ms
memory: 5740kb
input:
Flim 1000000 100000 1101111111100010011110111001110011110110100000111110011111111111110111110100000001001000000110111000000101110000001100111110100100000100010111001011111010001000101100101100001111011100110010010000100100100101110100100110101001001000001011111101111111001100101000010110001011011000...
output:
50 60 70 80 90 100 110 120 130 140 150 160 170 180 190 199 210 220 230 240 249 260 269 280 290 300 310 320 330 340 350 360 370 380 390 400 410 420 430 440 450 460 470 480 490 499 510 520 530 540 550 560 570 580 590 599 609 619 630 640 650 660 670 679 690 700 709 720 730 739 750 759 769 780 790 800 8...
input:
Flam 1000000 100000 0000001101000100010010001001011111000101010011011001010100101001110101001011001011100001011100110100011110011010100101110101101101100101111011000111001101001100010000010010101110101010111110001100110000110001001111010010000010111101110001011011101101010000111111011111100100010001...
output:
49 59 69 80 89 99 109 119 129 139 150 159 169 179 189 199 209 219 229 240 250 260 269 280 290 299 309 319 329 340 350 359 369 380 389 399 409 419 429 439 449 459 469 480 489 500 510 519 529 539 550 560 570 580 590 599 609 619 629 639 649 659 669 680 689 700 709 719 729 740 750 759 769 780 790 799 80...
result:
wrong answer