Submission #1213044


Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include<math.h>
#define rep(a) for(int i=0;i<a;i++)
#define nrep(a,b) for(int i=a;i<b;i++)
#define mrep(a) for(int i=a;i>=0;i--)
#define ll long long
#define INF 1145141919
#define MAX 100
using namespace std;

int main(){

	ll n; cin >> n;
	vector<string> s(n+1);
	rep(n+1) cin >> s[i];
	string target = s[n];
	sort(s.begin(), s.end());
	vector<ll> ans;
	rep(n + 1) if (target == s[i]) ans.push_back(i + 1);
	rep(ans.size()){
		if (i) cout << " ";
		cout << ans[i];
	}cout << endl;

	return 0;
}

Submission Info

Submission Time
Task A - Atcoder Handles
User untan
Language C++14 (GCC 5.4.1)
Score 130
Code Size 602 Byte
Status WA
Exec Time 12 ms
Memory 896 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 1 ms 256 KB
sub1_in2.txt AC 2 ms 256 KB
sub1_in3.txt AC 2 ms 256 KB
sub2_in1.txt WA 1 ms 256 KB
sub2_in2.txt WA 6 ms 512 KB
sub2_in3.txt WA 12 ms 896 KB