QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #324366 | #4832. Telepathy | ucup-team1069# | 0 | 9ms | 4932kb | C++23 | 1.2kb | 2024-02-10 18:00:50 | 2024-02-10 18:00:51 |
answer
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int n = 1e6, k = 1e5;
string s, t;
cin >> s >> n >> k >> t;
vector<int> ans;
int B = 5;
for (int i = 0; i < n; i += B) {
int p = 0;
for (int j = 0; j < B; ++j) {
if (t[i + j] == '0') {
p = i + j + 1;
}
}
if (p == 0) {
p = i + B;
}
ans.push_back(p);
if (ans.size() == k) break;
}
for (int i : ans) cout << i << " ";
cout << '\n';
return 0;
if (s == "Flim") {
for (int i = 0; i < n; ++i) {
if (t[i] == '0') {
ans.push_back(i + 1);
if (ans.size() == k) break;
}
}
sort(ans.begin(), ans.end());
for (int i : ans) cout << i << " ";
}
else {
for (int i = n - 1; i >= 0; --i) {
if (t[i] == '1') {
ans.push_back(i + 1);
if (ans.size() == k) break;
}
}
sort(ans.begin(), ans.end());
for (int i : ans) cout << i << " ";
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 9ms
memory: 4932kb
input:
Flim 1000000 100000 1101111111100010011110111001110011110110100000111110011111111111110111110100000001001000000110111000000101110000001100111110100100000100010111001011111010001000101100101100001111011100110010010000100100100101110100100110101001001000001011111101111111001100101000010110001011011000...
output:
3 10 14 17 22 27 32 40 45 46 53 60 65 67 75 80 84 90 94 100 105 110 114 118 124 130 135 139 144 146 155 160 165 168 174 179 184 190 195 199 205 207 214 220 225 230 234 236 243 250 255 260 265 270 275 280 284 288 294 300 302 309 315 320 325 330 335 339 345 348 355 360 361 369 372 379 385 390 395 400 ...
input:
Flam 1000000 100000 0000001101000100010010001001011111000101010011011001010100101001110101001011001011100001011100110100011110011010100101110101101101100101111011000111001101001100010000010010101110101010111110001100110000110001001111010010000010111101110001011011101101010000111111011111100100010001...
output:
5 9 15 20 24 29 35 39 44 50 55 60 63 69 74 80 85 89 94 100 101 110 115 117 123 129 135 140 145 150 155 160 165 170 174 180 184 190 195 200 205 210 215 220 224 226 235 239 242 249 255 256 263 270 275 279 285 290 295 299 302 308 313 320 323 330 331 340 345 350 355 357 364 370 375 380 384 390 394 399 4...
result:
wrong answer 66296 matched, but you need to match at least 66666 positions