QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #490378 | #4832. Telepathy | TheRaptor | 0 | 8ms | 4248kb | C++14 | 354b | 2024-07-25 14:57:35 | 2024-07-25 14:57:35 |
answer
#include <bits/stdc++.h>
using namespace std;
int32_t main(){
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
int n,k;
cin >> n >> k;
cin >> s;
mt19937 rng(999);
for(int i=0; i<n; i+=10){
if(s[i]!=s[i+1]){
if(s[i]=='1') cout << i+1 << ' ';
else cout << i+2 << ' ';
}
else cout << i+rng()%2+1 << ' ';
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 8ms
memory: 4248kb
input:
Flim 1000000 100000 1101111111100010011110111001110011110110100000111110011111111111110111110100000001001000000110111000000101110000001100111110100100000100010111001011111010001000101100101100001111011100110010010000100100100101110100100110101001001000001011111101111111001100101000010110001011011000...
output:
1 11 21 31 41 51 62 72 82 92 101 112 122 132 142 151 161 172 181 192 202 212 221 232 241 251 261 271 282 292 301 312 322 332 341 352 362 371 382 392 402 411 422 431 441 451 462 472 481 492 501 511 522 531 541 551 562 571 582 592 602 611 621 632 642 652 662 671 681 692 701 711 722 731 742 752 761 771...
input:
Flam 1000000 100000 0000001101000100010010001001011111000101010011011001010100101001110101001011001011100001011100110100011110011010100101110101101101100101111011000111001101001100010000010010101110101010111110001100110000110001001111010010000010111101110001011011101101010000111111011111100100010001...
output:
1 11 21 32 42 52 61 72 81 92 102 111 122 131 142 152 162 171 181 192 202 211 222 232 241 252 262 272 281 291 301 312 322 332 341 352 362 372 382 391 402 411 422 431 442 452 461 472 482 491 501 511 522 531 541 552 561 572 581 592 602 612 621 631 642 652 662 671 682 691 701 712 721 731 742 752 762 771...
result:
wrong answer 62340 matched, but you need to match at least 66666 positions