QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #490272 | #4832. Telepathy | TheRaptor | 0 | 8ms | 4244kb | C++14 | 314b | 2024-07-25 13:52:54 | 2024-07-25 13:52:55 |
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;
for(int i=0; i<n; i+=10){
int out=9;
for(int j=0; j<2; j++){
if(s[i+j]=='1') out=min(out,j);
}
cout << i+out+1 << ' ';
}
}
详细
Test #1:
score: 0
Wrong Answer
time: 8ms
memory: 4244kb
input:
Flim 1000000 100000 1101111111100010011110111001110011110110100000111110011111111111110111110100000001001000000110111000000101110000001100111110100100000100010111001011111010001000101100101100001111011100110010010000100100100101110100100110101001001000001011111101111111001100101000010110001011011000...
output:
1 11 21 40 41 51 61 71 82 92 110 120 121 140 141 151 161 180 181 192 210 212 221 240 241 260 270 271 290 292 310 312 322 331 341 352 362 371 382 400 401 411 421 431 441 451 462 472 481 492 501 511 521 531 541 560 570 571 582 592 602 611 630 640 642 652 670 680 681 700 710 711 730 731 741 751 761 771...
input:
Flam 1000000 100000 0000001101000100010010001001011111000101010011011001010100101001110101001011001011100001011100110100011110011010100101110101101101100101111011000111001101001100010000010010101110101010111110001100110000110001001111010010000010111101110001011011101101010000111111011111100100010001...
output:
10 20 21 31 42 52 61 80 81 91 102 111 122 131 141 151 162 171 181 200 210 211 230 232 241 252 261 272 290 291 310 311 322 332 341 351 362 380 382 391 402 411 422 431 450 460 461 472 482 500 510 520 522 531 541 551 561 571 581 592 610 620 621 631 642 652 670 671 682 691 701 711 721 731 741 752 762 77...
result:
wrong answer 65368 matched, but you need to match at least 66666 positions