QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #662793 | #4832. Telepathy | rotcar07 | 0 | 17ms | 5424kb | C++23 | 305b | 2024-10-21 10:34:02 | 2024-10-21 10:34:03 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
constexpr int x[8]={2,2,0,2,1,1,0,2};
int main(){
string s;cin>>s;
int n,k;cin>>n>>k>>s;
for(int i=0;i<k;i++){
int a[3];for(int j=0;j<3;j++) a[j]=s[i*3+j]-'0';
cout<<i*3+x[a[0]*4+a[1]*2+a[2]]<<' ';
}
cout<<'\n';
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 17ms
memory: 5424kb
input:
Flim 1000000 100000 1101111111100010011110111001110011110110100000111110011111111111110111110100000001001000000110111000000101110000001100111110100100000100010111001011111010001000101100101100001111011100110010010000100100100101110100100110101001001000001011111101111111001100101000010110001011011000...
output:
0 5 8 9 14 17 20 23 25 29 32 35 38 39 44 47 50 53 56 59 62 65 68 71 72 77 80 82 85 89 92 95 97 101 102 107 110 113 114 119 122 123 126 131 132 137 140 142 145 149 151 155 157 159 162 165 168 173 176 178 180 185 188 191 194 195 198 201 204 209 210 213 218 219 223 226 229 233 235 239 240 245 248 250 2...
input:
Flam 1000000 100000 0000001101000100010010001001011111000101010011011001010100101001110101001011001011100001011100110100011110011010100101110101101101100101111011000111001101001100010000010010101110101010111110001100110000110001001111010010000010111101110001011011101101010000111111011111100100010001...
output:
2 5 6 10 12 17 20 23 25 28 32 34 36 40 44 46 49 52 54 57 61 65 66 70 73 76 79 81 86 88 90 95 96 101 104 107 109 111 114 119 120 123 126 129 132 137 139 142 146 148 150 154 156 161 164 167 170 171 176 177 181 185 188 191 192 197 200 203 206 208 212 214 218 221 224 227 228 233 236 238 241 243 246 250 ...
result:
wrong answer