Submission #371318

---

Source Code Expand

//by tzupengwang™
#include<bits/stdc++.h>
using namespace std;

#define FO(it,c) for (__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
typedef long long ll;
typedef pair<int,int> ii;

map< string , int > mp ;
map< int , string > r ;
int cnt = 0 ;
vector< int > v ;

void init() {
	mp[ "not" ] = 0 ;
	r[ 0 ] = "not" ;
	string s ;
	while ( cin >> s ) {
		if ( !mp.count( s ) ) {
			mp[ s ] = ++ cnt ;
			r[ cnt ] = s ;
		}
		v.push_back( mp[ s ] ) ;
	}
}

int st[ 100000 ] , sts ;

void process() {
	sts = 0 ;
	FO( it , v ) {
		if ( *it == 0 ) { st[ sts ++ ] = 0 ; continue ; }
		while ( sts >= 2 && st[ sts - 1 ] == 0 && st[ sts - 2 ] == 0 ) sts -= 2 ;
		st[ sts ++ ] = *it ;
	}
	for ( int i = 0 ; i < sts ; i ++ ) {
		cout << r[ st[ i ] ] ;
		if ( i == sts - 1 ) printf( "\n" ) ;
		else printf( " " ) ;
	}
}

int main() {
	init() ;
	process() ;
	return 0 ;
}

Submission Info

Judge Result