Submission #244576
Source Code Expand
#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <cmath>
using namespace std; using namespace placeholders;
using LL = long long; using ULL = unsigned long long;
using VI = vector<int>; using VVI = vector<VI>;
using VS = vector<string>;
using SS = stringstream;
using PII = pair<int,int>; using VPII = vector< pair<int,int> >;
template < typename T = int > using VT = vector<T>;
template < typename T = int > using VVT = VT< VT<T> >;
template < typename T = int > using LIM = numeric_limits<T>;
template < typename T > inline void input_n( VT< T > &out ) { copy_n( istream_iterator< T >( cin ), out.size(), out.begin() ); };
template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; };
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };
#define REP( i, m, n ) for ( int i = (int)( m ); i < (int)( n ); ++i )
#define FOR( e, c ) for ( auto &e : c )
#define ALL( c ) (c).begin(), (c).end()
#define AALL( a, t ) (t*)a, (t*)a + sizeof( a ) / sizeof( t )
#define DRANGE( c, p ) (c).begin(), (c).begin() + p, (c).end()
#define PB( n ) push_back( n )
#define EM( n ) emplace( n )
#define EB( n ) emplace_back( n )
#define MP( a, b ) make_pair( ( a ), ( b ) )
#define EXIST( c, e ) ( (c).find( e ) != (c).end() )
#define fst first
#define snd second
#define DUMP( x ) cerr << #x << " = " << ( x ) << endl
// 文字列 split / デリミタに含まれるいずれかの文字で分割
vector<string> split( const string &str, const string &delim = " " )
{
int start = 0;
vector<string> result;
for ( int pos; ( pos = str.find_first_of( delim, start ) ) != (int)string::npos; start = pos + 1 )
{
result.push_back( str.substr( start, pos - start ) );
}
result.push_back( str.substr( start ) );
result.erase(
remove_if( result.begin(), result.end(), not1( mem_fun_ref( &string::size ) ) ),
result.end() );
return result;
}
int main()
{
cin.tie( 0 );
ios::sync_with_stdio( false );
string s;
getline( cin, s );
const int L = s.size();
VI ps;
REP( i, 0, L )
{
if ( s[i] == '@' )
{
ps.PB( i );
}
}
set< string > res;
FOR( at, ps )
{
int pos = at + 1;
if ( !isalpha( s[ pos ] ) )
{
continue;
}
while ( pos < L && isalpha( s[ pos ] ) ) pos++;
res.insert( s.substr( at + 1, pos - at - 1 ) );
}
copy( ALL( res ), ostream_iterator< string >( cout, "\n" ) );
return 0;
}
Submission Info
Submission Time |
|
Task |
C - 次世代SNS |
User |
torus711 |
Language |
C++11 (GCC 4.8.1) |
Score |
100 |
Code Size |
2792 Byte |
Status |
AC |
Exec Time |
28 ms |
Memory |
936 KB |
Judge Result
Set Name |
All |
Score / Max Score |
100 / 100 |
Status |
|
Set Name |
Test Cases |
All |
test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, sample_01.txt, sample_02.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
24 ms |
808 KB |
sample_02.txt |
AC |
25 ms |
800 KB |
test_01.txt |
AC |
24 ms |
800 KB |
test_02.txt |
AC |
24 ms |
804 KB |
test_03.txt |
AC |
24 ms |
804 KB |
test_04.txt |
AC |
25 ms |
924 KB |
test_05.txt |
AC |
24 ms |
800 KB |
test_06.txt |
AC |
25 ms |
808 KB |
test_07.txt |
AC |
24 ms |
928 KB |
test_08.txt |
AC |
26 ms |
736 KB |
test_09.txt |
AC |
23 ms |
804 KB |
test_10.txt |
AC |
23 ms |
796 KB |
test_11.txt |
AC |
22 ms |
804 KB |
test_12.txt |
AC |
25 ms |
804 KB |
test_13.txt |
AC |
25 ms |
928 KB |
test_14.txt |
AC |
24 ms |
804 KB |
test_15.txt |
AC |
23 ms |
816 KB |
test_16.txt |
AC |
24 ms |
804 KB |
test_17.txt |
AC |
24 ms |
796 KB |
test_18.txt |
AC |
23 ms |
936 KB |
test_19.txt |
AC |
28 ms |
768 KB |
test_20.txt |
AC |
23 ms |
804 KB |