QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #490526 | #4832. Telepathy | TheRaptor | 0 | 10ms | 4188kb | C++14 | 418b | 2024-07-25 15:34:50 | 2024-07-25 15:34:51 |
Judging History
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+=20){
int out=9;
for(int j=0; j<10; j++){
if(s[i+j]=='1') out=min(out,j);
}
cout << i+out+1 << ' ';
for(int j=out+1; j<20; j++){
if(s[i+j]=='0'){
cout << i+j+1 << ' ';
break;
}
}
}
}
詳細信息
Test #1:
score: 0
Wrong Answer
time: 10ms
memory: 4188kb
input:
Flim 1000000 100000 1101111111100010011110111001110011110110100000111110011111111111110111110100000001001000000110111000000101110000001100111110100100000100010111001011111010001000101100101100001111011100110010010000100100100101110100100110101001001000001011111101111111001100101000010110001011011000...
output:
1 3 21 22 41 42 61 67 82 83 104 105 121 124 141 143 161 162 181 183 203 204 221 222 241 243 264 265 285 287 303 306 322 324 341 342 362 367 382 383 401 403 421 424 441 446 462 467 481 484 501 508 521 524 541 542 563 564 582 583 602 605 623 626 642 643 663 664 681 685 703 705 723 724 741 748 761 762 ...
input:
Flam 1000000 100000 0000001101000100010010001001011111000101010011011001010100101001110101001011001011100001011100110100011110011010100101110101101101100101111011000111001101001100010000010010101110101010111110001100110000110001001111010010000010111101110001011011101101010000111111011111100100010001...
output:
7 9 21 22 42 43 61 62 81 84 102 106 122 123 141 143 162 163 181 182 203 205 225 226 241 242 261 263 283 284 303 306 322 323 341 344 362 363 382 383 402 403 422 424 445 446 461 466 482 483 503 506 522 526 541 542 561 564 581 583 607 608 621 623 642 643 664 667 682 683 701 705 721 723 741 745 762 764 ...
result:
wrong answer 62838 matched, but you need to match at least 66666 positions