Submission #1291297


Source Code Expand

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<vector>
#include<map>
#include<queue>
#include<algorithm>


using namespace std;

using ll=long long;
using vi=vector<int>;
using vvi=vector<vi>;
using pii=pair<int,int>;
using vc=vector<char>;


struct q_t
{
	int x;
	bool operator<(const q_t& rhs) const
	{
		return x>rhs.x;
	}
};


priority_queue<q_t> que;


void push(q_t q)
{
	que.push(q);
}


int pop(q_t& q)
{
	if(que.empty()) return 0;
	q=que.top();
	que.pop();
	return 1;
}


template<typename T>
vector<vector<T> > vv_alloc(int w, int h, const T& f=T())
{
	vector<vector<T> > ret;

	ret.resize(h);
	for(auto& x : ret) x.resize(w, f);
	return ret;
}


vc input(void)
{
	vc ret;
	char buf[20+2];

	scanf("%s", buf);
	ret.resize(strlen(buf)+1);
	strcpy(&ret[0], buf);
	return ret;
}


int main(void)
{
	int n;
	vector<vc> s, sa, sz;
	vc t;
	int rank_a, rank_z;

	while(scanf("%d", &n)==1)
	{
		s.resize(n);
		for(int i=0;i<n;i++) s[i]=input();
		sa=s;
		sz=s;
		for(auto& se:sa)
			for(char& c:se)
				if(c=='?') c='a';

		for(auto& se:sz)
			for(char& c:se)
				if(c=='?') c='z';

		t=input();

		rank_a=1;
		for(auto& se:sa)
		{
			if(strcmp(&t[0], &se[0])>=0) rank_a++;
		}
		rank_z=1;
		for(auto& se:sz)
		{
			if(strcmp(&t[0], &se[0])>0) rank_z++;
		}

		for(int i=rank_z;i<rank_a;i++) printf("%d ", i);
		printf("%d\n", rank_a);
	}

	return 0;
}

Submission Info

Submission Time
Task A - Atcoder Handles
User myanta
Language C++14 (GCC 5.4.1)
Score 250
Code Size 1479 Byte
Status AC
Exec Time 6 ms
Memory 1792 KB

Compile Error

./Main.cpp: In function ‘vc input()’:
./Main.cpp:63:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s", buf);
                  ^

Judge Result

Set Name Subtask1 Subtask2
Score / Max Score 130 / 130 120 / 120
Status
AC × 3
AC × 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 AC 1 ms 256 KB
sub1_in2.txt AC 1 ms 384 KB
sub1_in3.txt AC 1 ms 384 KB
sub2_in1.txt AC 1 ms 256 KB
sub2_in2.txt AC 4 ms 1024 KB
sub2_in3.txt AC 6 ms 1792 KB