Submission #18188
Source Code Expand
Copy
#include <iostream> #include <sstream> #include <fstream> #include <string> #include <vector> #include <list> #include <set> #include <map> #include <queue> #include <stack> #include <deque> #include <complex> #include <algorithm> #include <cstdio> #include <cmath> #include <cstring> #define REP(i,x) for(int i=0 ; i<(int)(x) ; i++) #define ALL(x) (x).begin(),(x).end() #define LL long long using namespace std; int main(){ int N; while(~scanf("%d",&N)){ vector<pair<string,string> > dict(N); REP(i,N){ char buf[64]; scanf("%s",buf); dict[i].first = dict[i].second = string(buf); reverse(ALL(dict[i].first)); } sort(ALL(dict)); REP(i,N)printf("%s\n",dict[i].second.c_str()); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - さかさま辞書 |
User | nel215 |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 757 Byte |
Status | AC |
Exec Time | 45 ms |
Memory | 900 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:30:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
Judge Result
Set Name | all | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
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 | 24 ms | 784 KB |
00_sample_02.txt | AC | 23 ms | 780 KB |
01_rand_01.txt | AC | 24 ms | 784 KB |
01_rand_02.txt | AC | 23 ms | 784 KB |
01_rand_03.txt | AC | 23 ms | 780 KB |
01_rand_04.txt | AC | 21 ms | 784 KB |
01_rand_05.txt | AC | 21 ms | 720 KB |
01_rand_06.txt | AC | 23 ms | 772 KB |
01_rand_07.txt | AC | 22 ms | 768 KB |
01_rand_08.txt | AC | 23 ms | 788 KB |
01_rand_09.txt | AC | 24 ms | 784 KB |
01_rand_10.txt | AC | 21 ms | 784 KB |
02_long_01.txt | AC | 25 ms | 844 KB |
02_long_02.txt | AC | 22 ms | 780 KB |
02_long_03.txt | AC | 25 ms | 852 KB |
03_short_01.txt | AC | 22 ms | 772 KB |
03_short_02.txt | AC | 23 ms | 900 KB |
03_short_03.txt | AC | 20 ms | 784 KB |
04_max_01.txt | AC | 23 ms | 764 KB |
04_max_02.txt | AC | 22 ms | 776 KB |
04_max_03.txt | AC | 23 ms | 780 KB |
04_max_04.txt | AC | 24 ms | 788 KB |
04_max_05.txt | AC | 45 ms | 860 KB |
05_samestring_01.txt | AC | 22 ms | 772 KB |
05_samestring_02.txt | AC | 22 ms | 736 KB |
05_samestring_03.txt | AC | 23 ms | 868 KB |
05_samestring_04.txt | AC | 28 ms | 856 KB |
05_samestring_05.txt | AC | 25 ms | 772 KB |