QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #313222 | #4832. Telepathy | tuanlinh123 | 0 | 7ms | 5880kb | C++20 | 616b | 2024-01-24 16:41:42 | 2024-01-24 16:41:43 |
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};
ll str[8]={2, 0, 1, 0, 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]);
}
for (ll i:ans) cout << i << " ";
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 7ms
memory: 5880kb
input:
Flim 1000000 100000 1101111111100010011110111001110011110110100000111110011111111111110111110100000001001000000110111000000101110000001100111110100100000100010111001011111010001000101100101100001111011100110010010000100100100101110100100110101001001000001011111101111111001100101000010110001011011000...
output:
1 11 23 33 41 51 63 71 82 93 103 113 123 133 141 153 163 173 181 192 203 212 223 233 241 253 263 273 283 293 303 312 323 331 341 353 363 373 382 393 401 411 423 433 443 453 463 473 483 493 503 511 523 533 543 553 563 573 582 592 603 613 623 633 642 653 663 673 683 693 703 713 723 731 743 751 761 771...
input:
Flam 1000000 100000 0000001101000100010010001001011111000101010011011001010100101001110101001011001011100001011100110100011110011010100101110101101101100101111011000111001101001100010000010010101110101010111110001100110000110001001111010010000010111101110001011011101101010000111111011111100100010001...
output:
3 13 21 33 42 52 61 73 83 91 103 113 122 131 141 151 162 173 183 193 203 213 223 233 243 252 261 272 283 293 303 311 322 333 343 351 362 373 382 391 402 411 423 433 443 453 463 473 482 493 503 513 523 533 543 551 563 571 581 592 603 613 621 633 642 653 663 671 682 693 703 711 721 733 743 753 763 773...
result:
wrong answer 65576 matched, but you need to match at least 66666 positions