Submission #1213107


Source Code Expand

#include <cstdio>
#include <algorithm>
#include <cstring>

#define maxn 10010
char s[maxn][30];
bool unknown[maxn][30];
int r[maxn], len[maxn];
inline bool cmp1(int a, int b)
{
	for (int i = 1; i <= len[a] && i <= len[b]; ++i)
		if (s[a][i] != s[b][i]) return s[a][i] < s[b][i];
	return len[a] == len[b] ? a < b : len[a] < len[b];
}
inline bool cmp2(int a, int b)
{
	for (int i = 1; i <= len[a] && i <= len[b]; ++i)
		if (s[a][i] != s[b][i]) return s[a][i] < s[b][i];
	return len[a] == len[b] ? a > b : len[a] < len[b];
}
int main()
{
	int n; scanf("%d", &n);
	for (int i = 1; i <= n + 1; ++i) r[i] = i;
	for (int i = 1; i <= n + 1; ++i)
		scanf("%s", s[i] + 1);
	for (int i = 1; i <= n + 1; ++i)
	{
		len[i] = strlen(s[i] + 1);
		for (int j = 1; j <= len[i]; ++j)
			if (s[i][j] == '?')
				unknown[i][j] = 1, s[i][j] = 'a';
	}
	std::sort(r + 1, r + n + 2, cmp1);
	int left, right;
	for (int i = 1; i <= n + 1; ++i)
		if (r[i] == n + 1)
		{
			left = i;
			break;
		}
	for (int i = 1; i <= n + 1; ++i)
		for (int j = 1; j <= len[i]; ++j)
			if (unknown[i][j])
				s[i][j] = 'z';
	std::sort(r + 1, r + n + 2, cmp2);
	for (int i = 1; i <= n + 1; ++i)
		if (r[i] == n + 1)
		{
			right = i;
			break;
		}
	for (int i = right; i <= left; ++i) printf("%d ", i); puts("");
	return 0;
}

Submission Info

Submission Time
Task A - Atcoder Handles
User chentong
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1334 Byte
Status WA
Exec Time 6 ms
Memory 768 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:23:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  int n; scanf("%d", &n);
                        ^
./Main.cpp:26:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s", s[i] + 1);
                        ^

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 128 KB
sub1_in2.txt WA 1 ms 128 KB
sub1_in3.txt WA 1 ms 256 KB
sub2_in1.txt WA 1 ms 128 KB
sub2_in2.txt WA 4 ms 512 KB
sub2_in3.txt WA 6 ms 768 KB