Submission #18068


Source Code Expand

Copy
#define _USE_MATH_DEFINES
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>


#ifdef _DEBUG
#define typeof(X) std::identity<decltype(X)>::type //C++0x (for vs2010)
#else
#define typeof(X) __typeof__(X) // for gcc
#endif

#define sz(a)  int((a).size())
#define FOREACH(it, c) for (typeof((c).begin()) it=(c).begin(); it != (c).end(); ++it)
#define FOR(i,count) for (int i = 0; i < (count); i++)

template <class T> void max_swap(T& a, const T& b) { a = max(a, b); }
template <class T> void min_swap(T& a, const T& b) { a = min(a, b); }

using namespace std;
static const double EPS = 1e-5;
typedef long long ll;
const int MODULO = 1000000007;
const int INF = 100000000; //1e8

typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
typedef complex<double> Cd;


int main(){
	int n;
	cin>>n;
	vector<string> s(n);
	for (int q = 0; q < n; q++)
	{
		cin>>s[q];
		reverse(s[q].begin(),s[q].end());
	}

	sort(s.begin(),s.end());

	for (int i = 0; i < n; i++)
	{
		reverse(s[i].begin(),s[i].end());
		cout << s[i] << endl;
	}

	return 0;
}

Submission Info

Submission Time
Task B - さかさま辞書
User math
Language C++ (GCC 4.4.7)
Score 100
Code Size 1510 Byte
Status AC
Exec Time 22 ms
Memory 800 KB

Judge Result

Set Name all
Score / Max Score 100 / 100
Status
AC × 28
Set Name Test Cases
all 00_sample_01.txt, 00_sample_02.txt, 01_rand_01.txt, 01_rand_02.txt, 01_rand_03.txt, 01_rand_04.txt, 01_rand_05.txt, 01_rand_06.txt, 01_rand_07.txt, 01_rand_08.txt, 01_rand_09.txt, 01_rand_10.txt, 02_long_01.txt, 02_long_02.txt, 02_long_03.txt, 03_short_01.txt, 03_short_02.txt, 03_short_03.txt, 04_max_01.txt, 04_max_02.txt, 04_max_03.txt, 04_max_04.txt, 04_max_05.txt, 05_samestring_01.txt, 05_samestring_02.txt, 05_samestring_03.txt, 05_samestring_04.txt, 05_samestring_05.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 21 ms 800 KB
00_sample_02.txt AC 21 ms 784 KB
01_rand_01.txt AC 21 ms 796 KB
01_rand_02.txt AC 21 ms 788 KB
01_rand_03.txt AC 22 ms 784 KB
01_rand_04.txt AC 21 ms 796 KB
01_rand_05.txt AC 22 ms 796 KB
01_rand_06.txt AC 20 ms 788 KB
01_rand_07.txt AC 21 ms 792 KB
01_rand_08.txt AC 21 ms 792 KB
01_rand_09.txt AC 20 ms 784 KB
01_rand_10.txt AC 21 ms 788 KB
02_long_01.txt AC 22 ms 784 KB
02_long_02.txt AC 22 ms 780 KB
02_long_03.txt AC 21 ms 764 KB
03_short_01.txt AC 21 ms 788 KB
03_short_02.txt AC 21 ms 752 KB
03_short_03.txt AC 21 ms 788 KB
04_max_01.txt AC 22 ms 792 KB
04_max_02.txt AC 22 ms 792 KB
04_max_03.txt AC 22 ms 788 KB
04_max_04.txt AC 20 ms 796 KB
04_max_05.txt AC 20 ms 792 KB
05_samestring_01.txt AC 22 ms 784 KB
05_samestring_02.txt AC 22 ms 788 KB
05_samestring_03.txt AC 22 ms 788 KB
05_samestring_04.txt AC 22 ms 796 KB
05_samestring_05.txt AC 21 ms 788 KB