QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #490372 | #4832. Telepathy | TheRaptor | 0 | 31ms | 4256kb | C++14 | 349b | 2024-07-25 14:56:42 | 2024-07-25 14:56:42 |
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;
mt19937 rng(999);
for(int i=0; i<n; i+=2){
if(s[i]!=s[i+1]){
if(s[i]=='1') cout << i << ' ';
else cout << i+1 << ' ';
}
else cout << i+rng()%2 << ' ';
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 31ms
memory: 4256kb
input:
Flim 1000000 100000 1101111111100010011110111001110011110110100000111110011111111111110111110100000001001000000110111000000101110000001100111110100100000100010111001011111010001000101100101100001111011100110010010000100100100101110100100110101001001000001011111101111111001100101000010110001011011000...
output:
0 3 4 7 9 10 12 14 17 19 20 23 24 27 29 31 33 34 37 38 40 43 45 46 48 50 53 54 57 58 61 63 65 67 69 70 73 74 76 78 81 82 84 87 88 91 92 95 96 98 101 103 105 107 108 110 113 114 117 118 121 122 124 127 129 130 133 134 137 139 141 142 144 147 148 150 152 155 156 158 160 162 165 166 169 171 173 174 176...
input:
Flam 1000000 100000 0000001101000100010010001001011111000101010011011001010100101001110101001011001011100001011100110100011110011010100101110101101101100101111011000111001101001100010000010010101110101010111110001100110000110001001111010010000010111101110001011011101101010000111111011111100100010001...
output:
0 2 5 7 9 10 13 15 17 19 20 23 24 27 29 31 33 34 37 39 41 43 45 47 48 51 53 55 56 58 60 63 64 67 69 70 72 75 76 78 81 82 85 87 89 91 93 94 97 98 101 102 104 107 108 110 112 115 117 118 121 123 124 126 129 130 133 135 137 138 140 143 145 146 149 151 153 154 156 159 161 162 165 167 168 170 172 175 176...
result:
wrong answer