QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #310708 | #4832. Telepathy | lhzawa | 0 | 8ms | 4932kb | C++14 | 251b | 2024-01-21 17:02:04 | 2024-01-21 17:02:05 |
answer
#include<bits/stdc++.h>
const int maxn = 1e6 + 10, limk = 1e5;
char s[maxn];
int main() {
scanf("%*s%*d%*d%s", s + 1);
for (int i = 1; i <= limk * 3; i += 3) printf("%d ", i + (s[i] == '1' && s[i + 1] == '1' && s[i + 2] == '1'));
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 8ms
memory: 4932kb
input:
Flim 1000000 100000 1101111111100010011110111001110011110110100000111110011111111111110111110100000001001000000110111000000101110000001100111110100100000100010111001011111010001000101100101100001111011100110010010000100100100101110100100110101001001000001011111101111111001100101000010110001011011000...
output:
1 5 8 10 13 16 20 22 25 29 31 35 37 40 43 46 50 52 56 59 62 65 67 71 73 76 79 82 85 88 91 94 97 100 103 107 109 112 115 118 122 124 127 130 133 136 139 142 145 149 151 154 157 160 163 166 169 172 176 178 181 184 187 190 193 196 199 202 205 209 211 214 217 220 223 226 229 232 235 239 241 245 248 250 ...
input:
Flam 1000000 100000 0000001101000100010010001001011111000101010011011001010100101001110101001011001011100001011100110100011110011010100101110101101101100101111011000111001101001100010000010010101110101010111110001100110000110001001111010010000010111101110001011011101101010000111111011111100100010001...
output:
1 4 7 10 13 16 19 22 25 28 32 34 37 40 43 46 49 52 55 58 61 65 67 70 73 76 79 82 85 88 91 94 97 100 104 106 109 112 115 119 121 124 127 130 133 137 139 142 145 148 151 154 157 160 163 166 169 172 176 178 181 184 188 190 193 196 199 202 205 208 212 214 217 220 223 226 229 233 235 238 241 244 247 250 ...
result:
wrong answer 49725 matched, but you need to match at least 66666 positions