4fd800b3a8 2011-02-23        kinaba: #include <iostream>
4fd800b3a8 2011-02-23        kinaba: #include <sstream>
4fd800b3a8 2011-02-23        kinaba: #include <iomanip>
4fd800b3a8 2011-02-23        kinaba: #include <vector>
4fd800b3a8 2011-02-23        kinaba: #include <string>
4fd800b3a8 2011-02-23        kinaba: #include <map>
4fd800b3a8 2011-02-23        kinaba: #include <set>
4fd800b3a8 2011-02-23        kinaba: #include <algorithm>
4fd800b3a8 2011-02-23        kinaba: #include <numeric>
4fd800b3a8 2011-02-23        kinaba: #include <iterator>
4fd800b3a8 2011-02-23        kinaba: #include <functional>
4fd800b3a8 2011-02-23        kinaba: #include <complex>
4fd800b3a8 2011-02-23        kinaba: #include <queue>
4fd800b3a8 2011-02-23        kinaba: #include <stack>
4fd800b3a8 2011-02-23        kinaba: #include <cmath>
4fd800b3a8 2011-02-23        kinaba: #include <cassert>
4fd800b3a8 2011-02-23        kinaba: #include <cstring>
4fd800b3a8 2011-02-23        kinaba: using namespace std;
4fd800b3a8 2011-02-23        kinaba: typedef long long LL;
4fd800b3a8 2011-02-23        kinaba: typedef complex<double> CMP;
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: class TheMoviesLevelOneDivOne { public:
4fd800b3a8 2011-02-23        kinaba: 	long long find(int n, int m, vector <int> row, vector <int> seat)
4fd800b3a8 2011-02-23        kinaba: 	{
4fd800b3a8 2011-02-23        kinaba: 		LL all = LL(n)*LL(m-1);
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: 		set< pair<int,int> > dead;
4fd800b3a8 2011-02-23        kinaba: 		for(int i=0; i<row.size(); ++i)
4fd800b3a8 2011-02-23        kinaba: 		{
4fd800b3a8 2011-02-23        kinaba: 			int y = row[i]-1;
4fd800b3a8 2011-02-23        kinaba: 			int x = seat[i]-1;
4fd800b3a8 2011-02-23        kinaba: 			if(x<m-1)dead.insert( make_pair(y,x) );
4fd800b3a8 2011-02-23        kinaba: 			if(x>0) dead.insert( make_pair(y,x-1) );
4fd800b3a8 2011-02-23        kinaba: 		}
4fd800b3a8 2011-02-23        kinaba: 		return all - dead.size();
4fd800b3a8 2011-02-23        kinaba: 	}
4fd800b3a8 2011-02-23        kinaba: };
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: // BEGIN CUT HERE
4fd800b3a8 2011-02-23        kinaba: #include <ctime>
4fd800b3a8 2011-02-23        kinaba: double start_time; string timer()
4fd800b3a8 2011-02-23        kinaba:  { ostringstream os; os << " (" << int((clock()-start_time)/CLOCKS_PER_SEC*1000) << " msec)"; return os.str(); }
4fd800b3a8 2011-02-23        kinaba: template<typename T> ostream& operator<<(ostream& os, const vector<T>& v)
4fd800b3a8 2011-02-23        kinaba:  { os << "{ ";
4fd800b3a8 2011-02-23        kinaba:    for(typename vector<T>::const_iterator it=v.begin(); it!=v.end(); ++it)
4fd800b3a8 2011-02-23        kinaba:    os << '\"' << *it << '\"' << (it+1==v.end() ? "" : ", "); os << " }"; return os; }
4fd800b3a8 2011-02-23        kinaba: void verify_case(const long long& Expected, const long long& Received) {
4fd800b3a8 2011-02-23        kinaba:  bool ok = (Expected == Received);
4fd800b3a8 2011-02-23        kinaba:  if(ok) cerr << "PASSED" << timer() << endl;  else { cerr << "FAILED" << timer() << endl;
4fd800b3a8 2011-02-23        kinaba:  cerr << "\to: \"" << Expected << '\"' << endl << "\tx: \"" << Received << '\"' << endl; } }
4fd800b3a8 2011-02-23        kinaba: #define CASE(N) {cerr << "Test Case #" << N << "..." << flush; start_time=clock();
4fd800b3a8 2011-02-23        kinaba: #define END	 verify_case(_, TheMoviesLevelOneDivOne().find(n, m, row, seat));}
4fd800b3a8 2011-02-23        kinaba: int main(){
4fd800b3a8 2011-02-23        kinaba: 
4fd800b3a8 2011-02-23        kinaba: CASE(0)
4fd800b3a8 2011-02-23        kinaba: 	int n = 2;
4fd800b3a8 2011-02-23        kinaba: 	int m = 3;
4fd800b3a8 2011-02-23        kinaba: 	int row_[] = {1, 2};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> row(row_, row_+sizeof(row_)/sizeof(*row_));
4fd800b3a8 2011-02-23        kinaba: 	int seat_[] = {2, 3};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> seat(seat_, seat_+sizeof(seat_)/sizeof(*seat_));
4fd800b3a8 2011-02-23        kinaba: 	long long _ = 1LL;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(1)
4fd800b3a8 2011-02-23        kinaba: 	int n = 2;
4fd800b3a8 2011-02-23        kinaba: 	int m = 3;
4fd800b3a8 2011-02-23        kinaba: 	int row_[] = {1, 1, 1, 2, 2, 2};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> row(row_, row_+sizeof(row_)/sizeof(*row_));
4fd800b3a8 2011-02-23        kinaba: 	int seat_[] = {1, 2, 3, 1, 2, 3};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> seat(seat_, seat_+sizeof(seat_)/sizeof(*seat_));
4fd800b3a8 2011-02-23        kinaba: 	long long _ = 0LL;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(2)
4fd800b3a8 2011-02-23        kinaba: 	int n = 4;
4fd800b3a8 2011-02-23        kinaba: 	int m = 7;
4fd800b3a8 2011-02-23        kinaba: 	int row_[] = {1};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> row(row_, row_+sizeof(row_)/sizeof(*row_));
4fd800b3a8 2011-02-23        kinaba: 	int seat_[] = {1};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> seat(seat_, seat_+sizeof(seat_)/sizeof(*seat_));
4fd800b3a8 2011-02-23        kinaba: 	long long _ = 23LL;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(3)
4fd800b3a8 2011-02-23        kinaba: 	int n = 10;
4fd800b3a8 2011-02-23        kinaba: 	int m = 8;
4fd800b3a8 2011-02-23        kinaba: 	int row_[] = {1, 9, 6, 10, 6, 7, 9, 3, 9, 2};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> row(row_, row_+sizeof(row_)/sizeof(*row_));
4fd800b3a8 2011-02-23        kinaba: 	int seat_[] = {7, 7, 3, 3, 7, 1, 5, 1, 6, 2};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> seat(seat_, seat_+sizeof(seat_)/sizeof(*seat_));
4fd800b3a8 2011-02-23        kinaba: 	long long _ = 54LL;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(4)
4fd800b3a8 2011-02-23        kinaba: 	int n = 1;
4fd800b3a8 2011-02-23        kinaba: 	int m = 1;
4fd800b3a8 2011-02-23        kinaba: 	int row_[] = {1};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> row(row_, row_+sizeof(row_)/sizeof(*row_));
4fd800b3a8 2011-02-23        kinaba: 	  int seat_[] = {1};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> seat(seat_, seat_+sizeof(seat_)/sizeof(*seat_));
4fd800b3a8 2011-02-23        kinaba: 	long long _ = 0LL;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(5)
4fd800b3a8 2011-02-23        kinaba: 	int n = 1000000000;
4fd800b3a8 2011-02-23        kinaba: 	int m = 1;
4fd800b3a8 2011-02-23        kinaba: 	int row_[] = {1};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> row(row_, row_+sizeof(row_)/sizeof(*row_));
4fd800b3a8 2011-02-23        kinaba: 	  int seat_[] = {1};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> seat(seat_, seat_+sizeof(seat_)/sizeof(*seat_));
4fd800b3a8 2011-02-23        kinaba: 	long long _ = 0LL;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(6)
4fd800b3a8 2011-02-23        kinaba: 	int n = 1000000000;
4fd800b3a8 2011-02-23        kinaba: 	int m = 100000001;
4fd800b3a8 2011-02-23        kinaba: 	int row_[] = {1};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> row(row_, row_+sizeof(row_)/sizeof(*row_));
4fd800b3a8 2011-02-23        kinaba: 	  int seat_[] = {1};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> seat(seat_, seat_+sizeof(seat_)/sizeof(*seat_));
4fd800b3a8 2011-02-23        kinaba: 	long long _ = 100000000000000000LL - 1;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(7)
4fd800b3a8 2011-02-23        kinaba: 	int n = 1000000000;
4fd800b3a8 2011-02-23        kinaba: 	int m = 100000001;
4fd800b3a8 2011-02-23        kinaba: 	int row_[] = {2};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> row(row_, row_+sizeof(row_)/sizeof(*row_));
4fd800b3a8 2011-02-23        kinaba: 	  int seat_[] = {1};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> seat(seat_, seat_+sizeof(seat_)/sizeof(*seat_));
4fd800b3a8 2011-02-23        kinaba: 	long long _ = 100000000000000000LL - 1;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(8)
4fd800b3a8 2011-02-23        kinaba: 	int n = 1000000000;
4fd800b3a8 2011-02-23        kinaba: 	int m = 100000001;
4fd800b3a8 2011-02-23        kinaba: 	int row_[] = {1};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> row(row_, row_+sizeof(row_)/sizeof(*row_));
4fd800b3a8 2011-02-23        kinaba: 	  int seat_[] = {2};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> seat(seat_, seat_+sizeof(seat_)/sizeof(*seat_));
4fd800b3a8 2011-02-23        kinaba: 	long long _ = 100000000000000000LL - 2;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(9)
4fd800b3a8 2011-02-23        kinaba: 	int n = 1000000000;
4fd800b3a8 2011-02-23        kinaba: 	int m = 100000001;
4fd800b3a8 2011-02-23        kinaba: 	int row_[] = {1};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> row(row_, row_+sizeof(row_)/sizeof(*row_));
4fd800b3a8 2011-02-23        kinaba: 	  int seat_[] = {100000001};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> seat(seat_, seat_+sizeof(seat_)/sizeof(*seat_));
4fd800b3a8 2011-02-23        kinaba: 	long long _ = 100000000000000000LL - 1;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(10)
4fd800b3a8 2011-02-23        kinaba: 	int n = 1000000000;
4fd800b3a8 2011-02-23        kinaba: 	int m = 100000001;
4fd800b3a8 2011-02-23        kinaba: 	int row_[] = {1};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> row(row_, row_+sizeof(row_)/sizeof(*row_));
4fd800b3a8 2011-02-23        kinaba: 	  int seat_[] = {100000000};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> seat(seat_, seat_+sizeof(seat_)/sizeof(*seat_));
4fd800b3a8 2011-02-23        kinaba: 	long long _ = 100000000000000000LL - 2;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(11)
4fd800b3a8 2011-02-23        kinaba: 	int n = 3;
4fd800b3a8 2011-02-23        kinaba: 	int m = 3;
4fd800b3a8 2011-02-23        kinaba: 	int row_[] = {1,2,3};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> row(row_, row_+sizeof(row_)/sizeof(*row_));
4fd800b3a8 2011-02-23        kinaba: 	  int seat_[] = {2,2,2};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> seat(seat_, seat_+sizeof(seat_)/sizeof(*seat_));
4fd800b3a8 2011-02-23        kinaba: 	long long _ = 0LL;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: CASE(12)
4fd800b3a8 2011-02-23        kinaba: 	int n = 3;
4fd800b3a8 2011-02-23        kinaba: 	int m = 3;
4fd800b3a8 2011-02-23        kinaba: 	int row_[] = {1,2,3,2,2};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> row(row_, row_+sizeof(row_)/sizeof(*row_));
4fd800b3a8 2011-02-23        kinaba: 	  int seat_[] = {1,2,3,1,3};
4fd800b3a8 2011-02-23        kinaba: 	  vector <int> seat(seat_, seat_+sizeof(seat_)/sizeof(*seat_));
4fd800b3a8 2011-02-23        kinaba: 	long long _ = 2LL;
4fd800b3a8 2011-02-23        kinaba: END
4fd800b3a8 2011-02-23        kinaba: }
4fd800b3a8 2011-02-23        kinaba: // END CUT HERE