Submission #1693090
Source Code Expand
//#include <bits/stdc++.h> #include <vector> #include <list> #include <queue> #include <deque> #include <map> #include <stack> #include <bitset> #include <array> #include <set> #include <string> #include <iterator> #include <algorithm> #include <numeric> #include <ios> #include <sstream> #include <iostream> #include <fstream> #include <climits> using namespace std; using ll=long long; using vi=vector<int>; using vvi=vector<vi>; using vs=vector<string>; using pii=pair<int,int>; using pll=pair<ll,ll>; void OUT(bool isTrue, string t="YES", string f="NO"){ cout<<(isTrue?t:f)<<endl; } void out(bool isTrue, string t="yes", string f="yes"){ cout<<(isTrue?t:f)<<endl; } template <typename T> string printItr(T b, T e, string delim=" ") { stringstream ss; ostream_iterator<decltype(*b)> out_it(ss, delim.c_str()); copy(b,e - 1, out_it); ss<<*(e-1); return ss.str(); } void bulk(){} template <class Head, class... Tail> void bulk(Head& head, Tail&... tail){ cin>>head; bulk(tail...); } #define rep(i,n) for(int i=0;i<n;i++) #define rrep(i,n) for(int i=n-1;i>=0;i--) #define range(i,m,n) for(int i=m; i<n;i++) #define each(i,n) for(auto i:n) #define all(i) i.begin(),i.end() #define cint(...) \ int __VA_ARGS__;\ bulk(__VA_ARGS__); int main(void){ cint(n,l); vs a(n); rep(i,n)cin>>a[i]; sort(all(a)); rep(i,n)cout<<a[i]; }
Submission Info
Submission Time | |
---|---|
Task | B - Iroha Loves Strings (ABC Edition) |
User | plcherrim |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 1468 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt |
All | subtask0_sample_01.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 1 ms | 256 KB |
subtask1_02.txt | AC | 2 ms | 256 KB |
subtask1_03.txt | AC | 1 ms | 256 KB |
subtask1_04.txt | AC | 1 ms | 256 KB |
subtask1_05.txt | AC | 1 ms | 256 KB |
subtask1_06.txt | AC | 1 ms | 256 KB |
subtask1_07.txt | AC | 2 ms | 256 KB |
subtask1_08.txt | AC | 1 ms | 256 KB |
subtask1_09.txt | AC | 1 ms | 256 KB |