QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#342748	#4832. Telepathy	nguyentunglam	0	7ms	4356kb	C++17	811b	2024-03-01 16:18:24	2024-03-01 16:18:24

Judging History

你现在查看的是最新测评结果

[2024-03-01 16:18:24]
评测

测评结果：0
用时：7ms
内存：4356kb

查看

[2024-03-01 16:18:24]
提交

answer

#include<bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define endl "\n"
using namespace std;

const int m = 5;

int p[1 << m] = {0,4,4,4,2,2,2,2,2,1,4,4,2,2,2,2,1,1,4,4,1,1,3,3,1,1,4,4,1,1,0,3};

int32_t main() {
  #define task ""

  cin.tie(0) -> sync_with_stdio(0);

  if (fopen("task.inp", "r")) {
    freopen("task.inp", "r", stdin);
    freopen("task.out", "w", stdout);
  }

  if (fopen(task".inp", "r")) {
    freopen (task".inp", "r", stdin);
    freopen (task".out", "w", stdout);
  }

  string player; cin >> player;

  int n, k; cin >> n >> k;

  string str; cin >> str;

  for(int i = 0; i < n; i += 10) {
    int mask = 0;
    for(int j = 0; j < m; j++) if (str[i + j] == '1') mask |= (1 << j);
    int pos = p[mask];
    cout << i + pos + 1;
  }

}

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0

Wrong Answer

time: 7ms

memory: 4356kb

input:

Flim
1000000 100000
1101111111100010011110111001110011110110100000111110011111111111110111110100000001001000000110111000000101110000001100111110100100000100010111001011111010001000101100101100001111011100110010010000100100100101110100100110101001001000001011111101111111001100101000010110001011011000...

output:

512223245526475859410311212413314515316317218519520321522323224525326327328229430231532333534235336137238539140541542343344445246147348449350451552453354355356357258559560361362263364565366267268369270371272373574475576577578579280281382583584585586587388289190391392193394295196297298399510021012102...

input:

Flam
1000000 100000
0000001101000100010010001001011111000101010011011001010100101001110101001011001011100001011100110100011110011010100101110101101101100101111011000111001101001100010000010010101110101010111110001100110000110001001111010010000010111101110001011011101101010000111111011111100100010001...

output:

113223345556272839510111312513214515516517218219320321322223324225526527528329330231532533134335536537138539240541242343344245346447448549250251352153454355556457558559560161262563464565166267268569370371572573274375376377278379580581582583584485286387288589390391292593294595396297298599210021013102...

result:

wrong answer