Submission #1213043


Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

string allA(string a) {
	for (int i = 0; i < a.size(); i++) {
		if (a[i] == '?') {
			a[i] = 'a';
		}
	}
	return a;
}

string allZ(string a) {
	for (int i = 0; i < a.size(); i++) {
		if (a[i] == '?') {
			a[i] = 'z';
		}
	}
	return a;
}

int main() {
	int n;
	cin >> n;
	vector<string> s(n);
	for (int i = 0; i < n; i++) {
		cin >> s[i];
	}
	string t;
	cin >> t;
	int low = 0;
	int high = 0;
	for (int i = 0; i < n; i++) {
		if (allA(s[i]) <= allZ(t)) {
			high++;
		}
		if (allZ(s[i]) < allA(t)) {
			low++;
		}
	}
	for (int i = low; i <= high; i++) {
		cout << i + 1 << " ";
	}
}

Submission Info

Submission Time
Task A - Atcoder Handles
User pekempey
Language C++14 (GCC 5.4.1)
Score 0
Code Size 730 Byte
Status WA
Exec Time 13 ms
Memory 896 KB

Judge Result

Set Name Subtask1 Subtask2
Score / Max Score 0 / 130 0 / 120
Status
WA × 3
WA × 6
Set Name Test Cases
Subtask1 sub1_in1.txt, sub1_in2.txt, sub1_in3.txt
Subtask2 sub1_in1.txt, sub1_in2.txt, sub1_in3.txt, sub2_in1.txt, sub2_in2.txt, sub2_in3.txt
Case Name Status Exec Time Memory
sub1_in1.txt WA 1 ms 256 KB
sub1_in2.txt WA 2 ms 256 KB
sub1_in3.txt WA 2 ms 256 KB
sub2_in1.txt WA 1 ms 256 KB
sub2_in2.txt WA 7 ms 640 KB
sub2_in3.txt WA 13 ms 896 KB