QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#357633#4832. Telepathyiliaaaaa0 0ms0kbC++20588b2024-03-19 03:59:232024-03-19 03:59:23

Judging History

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

  • [2024-03-19 03:59:23]
  • 评测
  • 测评结果:0
  • 用时:0ms
  • 内存:0kb
  • [2024-03-19 03:59:23]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef long double ld;
#define F first
#define S second
#define All(x) (x).begin(), (x).end()
#define len(x) (int) (x).size()
#define pb push_back

int32_t main() {
	ios:: sync_with_stdio(0), cin.tie(0), cout.tie(0);
	string a, b;
	cin >> b >> a;
	int n, k;
	cin >> n >> k;
	vector<int> ans;
	for (int i = 0; i < k; i++)
		if (a[2 * i] == '1')
			ans.pb(2 * i + 1);
		else
			ans.pb(2 * i + 2);
	for (int i: ans)
		cout << i << ' ';
	cout << '\n';
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Stage 1: Program answer Runtime Error

input:

Flim
1000000 100000
1101111111100010011110111001110011110110100000111110011111111111110111110100000001001000000110111000000101110000001100111110100100000100010111001011111010001000101100101100001111011100110010010000100100100101110100100110101001001000001011111101111111001100101000010110001011011000...

output:


input:


output:


result: