結果

問題 No.342 一番ワロタｗｗ
コンテスト
ユーザー IL_msta
提出日時 2017-01-20 18:10:53
言語 C++11（廃止可能性あり）
(gcc 13.3.0)
結果
RE  
実行時間 -
コード長 5,724 bytes
コンパイル時間 2,126 ms
コンパイル使用メモリ 124,756 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-12-23 02:53:13
合計ジャッジ時間 5,048 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample RE * 3
other RE * 14
権限があれば一括ダウンロードができます

ソースコード

diff # 

#ifdef __GNUC__
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#endif

#define _USE_MATH_DEFINES

#include <iostream>
#include <iomanip>

#include <sstream>
#include <algorithm>
#include <cmath>

#include <string>
#include <cstring>
#include <vector>
#include <valarray>
#include <array>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include<cassert>//assert();
#include <fstream>
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
 
#define PII pair<int,int>
/////////
#ifdef getchar_unlocked
#define mygc(c) (c)=getchar_unlocked()
#else
#define mygc(c) (c)=getchar()
#endif
#ifdef putchar_unlocked
#define mypc(c) putchar_unlocked(c)
#else
#define mypc(c) putchar(c)
#endif
/////////
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
/////////
using namespace::std;
/////////
#ifdef _DEBUG
#define DEBUG_BOOL(b) assert(b)
#else
#define DEBUG_BOOL(b) 
#endif
/////数値読み込み
#define ENABLE_READER_ON(T)	\
inline void reader(T &x){int k;x = 0;bool flag = true;\
while(true){mygc(k);\
if( k == '-'){flag = false;break;}if('0' <= k && k <= '9'){x = k - '0';break;}\
}\
if( flag ){while(true){mygc(k);if( k<'0' || '9'<k)break;x = x * 10 + (k - '0');}}\
else{while(true){mygc(k);if( k<'0' || '9'<k)break;x = x * 10 - (k-'0');}}\
}
//整数
ENABLE_READER_ON(int)
ENABLE_READER_ON(long)
ENABLE_READER_ON(long long)
ENABLE_READER_ON(unsigned int)
ENABLE_READER_ON(unsigned long)
ENABLE_READER_ON(unsigned long long)

//////
//文字読み込み
inline int reader(char c[]){int i,s=0;
for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}
c[s++]=i;
for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}
c[s]='\0';return s;
}

inline int reader(string& c,int size=100){int i;c.reserve(size);
for(;;){mygc(i);if(i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF)break;}
c.push_back(i);
for(;;){mygc(i);if(i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF)break;c.push_back(i);}
return c.size();}

/////////
//数値出力
#define ENABLE_WRITER_ON(T)	\
inline void writer(T x){char f[20];int s = 0;\
if (x<0){mypc('-');while(x){f[s++] = ~(x%10)+1,x /= 10;}}\
else{while(x){f[s++] = (x % 10), x /= 10;}}\
if (!s)f[s++] = 0;while (s--)mypc(f[s] + '0');}

ENABLE_WRITER_ON(int)
ENABLE_WRITER_ON(long)
ENABLE_WRITER_ON(long long)
ENABLE_WRITER_ON(unsigned int)
ENABLE_WRITER_ON(unsigned long)
ENABLE_WRITER_ON(unsigned long long)
/////////
inline void writer(const char c[]){for (int i = 0; c[i] != '\0'; i++)mypc(c[i]); }
inline void writer(const string str){writer( str.c_str() );}
///////////////////////////////////////////////////////////
// 最大公約数
template<class T>
inline T gcd(T a, T b){return b == 0 ? a : gcd(b, a % b);}
// 最小公倍数
template<class T>
inline T lcm(T a, T b){return a * b / gcd(a, b);}
////////////////////////////////

class UTF8{
public:
	int size;
	vector<string> str;
	UTF8(){
		size = 0;
		str.resize(0);
	}
	string operator[](int i){
		return str[i];
	}
	int set(string strInput){
		this->str = vector<string>(0);
		int len = strInput.size();
		unsigned char temp;
		for(int i=0;i<len;++i){
			temp = strInput[i];
			if( temp <= 0x7F ){
				this->str.push_back( (string)(strInput.substr( i, 1 )) );
			}else if( 0xC2 <= temp && temp <= 0xDF ){
				if( i+ 1 >= len ){
					this->size = this->str.size();
					return size;
				}
				this->str.push_back( strInput.substr( i, 2 ) );
				i += 1;
			}else if(0xE0 <= temp && temp <= 0xEF ){
				if( i+2 >= len ){
					this->size = this->str.size();
					return size;
				}
				this->str.push_back( strInput.substr( i, 3 ) );
				i += 2;
			}else if(0xF0 <= temp && temp <= 0xF7 ){
				if( i+3 >= len ){
					this->size = this->str.size();
					return size;
				}
				this->str.push_back( strInput.substr( i, 4 ) );
				i+= 3;
			}
		}
		this->size = this->str.size();
		return this->size;
	}

	void operator=(UTF8 utf8){
		this->size = utf8.size;
		this->str = utf8.str;
	}
	void operator=(UTF8* utf8){
		this->size = utf8->size;
		this->str = utf8->str;
	}
	UTF8 operator+(string str_s){
		UTF8 ret;
		ret = this;
		ret.str.push_back(str_s);
		ret.size = ret.str.size();
		return ret;
	}
};

inline void solve(){
	UTF8 utf8;
	string str;
	//reader(str);
	fstream file;
	file.open("utf8.txt");
	getline(file, str);

	int size = utf8.set(str);
	//ef bd 97
	char w[] = {(char)0xef,(char)0xbd,(char)0x97};
	string wStr(w,end(w));
	int pos = 0;
	while( utf8[pos] == wStr ){
		++pos;
	}
	int MAX = 0;
	int count = 0;
	vector<UTF8> maxUtf;
	UTF8 tempUtf;
	for(pos;pos<size;++pos){
		if( utf8[pos] != wStr ){
			if( count ){//wがあった時
				if( count > MAX ){
					MAX = count;
					maxUtf.resize(0);
					maxUtf.push_back( tempUtf );
				}else if( count == MAX ){
					maxUtf.push_back( tempUtf );
				}
				count = 0;
				tempUtf.str.resize(0);
				tempUtf.size = 0;
			}
			//
			tempUtf = tempUtf + utf8[pos];
		}else{
			++count;
		}
	}
	if( count && tempUtf.size ){
		if( count > MAX ){
			MAX = count;
			maxUtf.resize(0);
			maxUtf.push_back( tempUtf );
		}else if( count == MAX ){
			maxUtf.push_back( tempUtf );
		}
	}

	vector<UTF8>::iterator itr,end;
	vector<string>::iterator strIt,strEnd;
	itr = maxUtf.begin();
	end = maxUtf.end();
	for(;itr != end;++itr){
		strIt = itr->str.begin();
		strEnd = itr->str.end();
		for(;strIt != strEnd;++strIt){
			cout << *strIt;
		}
		cout << endl;
	}
}

int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//小数を10進数表示
    cout << setprecision(16);//小数をいっぱい表示する。16?

	solve();

	return 0;
}
0