Submission #1213009


Source Code Expand

#include "bits/stdc++.h"
#define MOD 1000000007
#define INF 11234567890
#define in std::cin
#define out std::cout
#define rep(i,N) for(LL i=0;i<N;++i)
typedef long long int LL;

int N;
std::string S[112345], T;
std::vector<int>ans;

int main()
{
	in >> N;
	rep(i, N)
	{
		in >> S[i];
		rep(j, S[i].length())
		{
			if (S[i][j] == '?') { return 0; }
		}
	}
	in >> T;

	S[N] = T;
	std::sort(S, S + N + 1);
	rep(i, N + 1)
	{
		if (S[i] == T)
		{
			ans.push_back(i + 1);
		}
	}

	rep(i, ans.size())
	{
		if (i == ans.size() - 1)
		{
			out << ans[i] << std::endl;
		}
		else
		{
			out << ans[i] << " ";
		}
	}
	return 0;
}

Submission Info

Submission Time
Task A - Atcoder Handles
User Bwambocos
Language C++14 (GCC 5.4.1)
Score 130
Code Size 667 Byte
Status WA
Exec Time 2 ms
Memory 1152 KB

Judge Result

Set Name Subtask1 Subtask2
Score / Max Score 130 / 130 0 / 120
Status
AC × 3
AC × 3
WA × 3
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 AC 2 ms 1152 KB
sub1_in2.txt AC 2 ms 1152 KB
sub1_in3.txt AC 2 ms 1152 KB
sub2_in1.txt WA 2 ms 1152 KB
sub2_in2.txt WA 2 ms 1152 KB
sub2_in3.txt WA 2 ms 1152 KB