Submission #302614


Source Code Expand

// #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <locale>
#include <cctype>
#include <sstream>
using namespace std;

typedef long long LL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef map<int, int> MAPII;
typedef vector<pair<int, int> > VPII;
typedef multimap<int, string, greater<int> > MuMIS;

#define MP make_pair
#define fastIO  cin.tie(0); ios::sync_with_stdio(false);
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
//for gcc (未test)
// #define FOREACH_IT(it,c) for(typeof(c)::iterator it=(c).begin(); it!=(c).end(); ++it)
//for Visual Studio
#define foreach_it(type,it,c) for(type::iterator it=c.begin(),c_end=c.end();it!=c_end;++it)
// 未test
#define DUMP_VVI(b) FOR(i,0,b.size()){FOR(j,0,b[i].size())printf("%d ",b[i][j]);puts("");}

// ------------------- include, typedef, define END. -------------------


bool Check(int HU_r, int HU_c, int MS_r, int MS_c, vector<string> &field){
	bool ret = false;
	int h = MS_r - HU_r;
	int w = MS_c - HU_c;
	//if (temp1.length() < 2 || temp2.length() < 2)	return false;
	int i=0;
	string temp1,temp2;
	while(HU_r+i <= MS_r-i){
		temp1 = field[HU_r+i].substr(HU_c, w+1);
		temp2 = field[MS_r-i].substr(HU_c, w+1);
		reverse(temp2.begin(), temp2.end());
		//cout << "	temp1 = " << temp1 << ", temp2 = " << temp2 << endl;
		if(temp1 != temp2){
			return false;
		}
		/*if (temp1 == temp2){
			cout << "	now!!" << endl;
			ret = true;
		}*/
		i++;
	}
	ret = true;
	return ret;
}

int solve(int R, int C, vector<string> &field){
	int ans = 0;
	FOR(HU_r, 0, field.size()){
		FOR(HU_c, 0, C - 1){
			FOR(MS_r, HU_r + 1, field.size()){
				FOR(MS_c, HU_c + 1, field[HU_r].size()){
					//cout << "check (" << HU_r << ", " << HU_c << ") ~ (" << MS_r << ", " << MS_c << ")";
					//cout << endl;
					if (Check(HU_r, HU_c, MS_r, MS_c, field))
						ans++;
				}
			}
		}
	}
	return ans;
}

int main(){
	fastIO;
	int R = 0, C = 0;
	string temp;
	// 入力
	cin >> R >> C;
	vector<string> field;
	field.reserve(R);
	FOR(i, 0, R){
		cin >> temp;
		field.push_back(temp);
	}
	// 入力おわり

	cout << solve(R, C, field) << endl;

	return 0;
}

Submission Info

Submission Time
Task H - 模様替え
User conchan_akita
Language C++ (G++ 4.6.4)
Score 15
Code Size 2384 Byte
Status TLE
Exec Time 8037 ms
Memory 992 KB

Judge Result

Set Name Sample Subtask1 Subtask2 Subtask3
Score / Max Score 0 / 0 15 / 15 0 / 30 0 / 55
Status
AC × 2
AC × 22
AC × 33
TLE × 4
AC × 34
TLE × 18
Set Name Test Cases
Sample subtask0-sample-01.txt, subtask0-sample-02.txt
Subtask1 subtask0-sample-01.txt, subtask0-sample-02.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, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt
Subtask2 subtask0-sample-01.txt, subtask0-sample-02.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, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt, subtask2-11.txt, subtask2-12.txt, subtask2-13.txt, subtask2-14.txt, subtask2-15.txt
Subtask3 subtask0-sample-01.txt, subtask0-sample-02.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, subtask1-10.txt, subtask1-11.txt, subtask1-12.txt, subtask1-13.txt, subtask1-14.txt, subtask1-15.txt, subtask1-16.txt, subtask1-17.txt, subtask1-18.txt, subtask1-19.txt, subtask1-20.txt, subtask2-01.txt, subtask2-02.txt, subtask2-03.txt, subtask2-04.txt, subtask2-05.txt, subtask2-06.txt, subtask2-07.txt, subtask2-08.txt, subtask2-09.txt, subtask2-10.txt, subtask2-11.txt, subtask2-12.txt, subtask2-13.txt, subtask2-14.txt, subtask2-15.txt, subtask3-01.txt, subtask3-02.txt, subtask3-03.txt, subtask3-04.txt, subtask3-05.txt, subtask3-06.txt, subtask3-07.txt, subtask3-08.txt, subtask3-09.txt, subtask3-10.txt, subtask3-11.txt, subtask3-12.txt, subtask3-13.txt, subtask3-14.txt, subtask3-15.txt
Case Name Status Exec Time Memory
subtask0-sample-01.txt AC 24 ms 928 KB
subtask0-sample-02.txt AC 23 ms 932 KB
subtask1-01.txt AC 23 ms 928 KB
subtask1-02.txt AC 23 ms 924 KB
subtask1-03.txt AC 29 ms 932 KB
subtask1-04.txt AC 28 ms 800 KB
subtask1-05.txt AC 56 ms 800 KB
subtask1-06.txt AC 49 ms 804 KB
subtask1-07.txt AC 32 ms 932 KB
subtask1-08.txt AC 31 ms 800 KB
subtask1-09.txt AC 51 ms 932 KB
subtask1-10.txt AC 30 ms 916 KB
subtask1-11.txt AC 32 ms 924 KB
subtask1-12.txt AC 31 ms 924 KB
subtask1-13.txt AC 52 ms 796 KB
subtask1-14.txt AC 31 ms 920 KB
subtask1-15.txt AC 33 ms 736 KB
subtask1-16.txt AC 33 ms 800 KB
subtask1-17.txt AC 32 ms 920 KB
subtask1-18.txt AC 38 ms 928 KB
subtask1-19.txt AC 32 ms 928 KB
subtask1-20.txt AC 31 ms 932 KB
subtask2-01.txt AC 1476 ms 736 KB
subtask2-02.txt AC 1996 ms 808 KB
subtask2-03.txt AC 2877 ms 760 KB
subtask2-04.txt AC 6697 ms 800 KB
subtask2-05.txt AC 6574 ms 932 KB
subtask2-06.txt TLE 8032 ms 928 KB
subtask2-07.txt AC 6650 ms 792 KB
subtask2-08.txt AC 6779 ms 916 KB
subtask2-09.txt AC 6683 ms 804 KB
subtask2-10.txt TLE 8029 ms 928 KB
subtask2-11.txt TLE 8030 ms 932 KB
subtask2-12.txt AC 6636 ms 804 KB
subtask2-13.txt TLE 8029 ms 924 KB
subtask2-14.txt AC 6550 ms 800 KB
subtask2-15.txt AC 6918 ms 916 KB
subtask3-01.txt AC 6148 ms 924 KB
subtask3-02.txt TLE 8029 ms 848 KB
subtask3-03.txt TLE 8030 ms 940 KB
subtask3-04.txt TLE 8030 ms 936 KB
subtask3-05.txt TLE 8030 ms 944 KB
subtask3-06.txt TLE 8037 ms 928 KB
subtask3-07.txt TLE 8030 ms 932 KB
subtask3-08.txt TLE 8031 ms 924 KB
subtask3-09.txt TLE 8030 ms 932 KB
subtask3-10.txt TLE 8029 ms 932 KB
subtask3-11.txt TLE 8032 ms 992 KB
subtask3-12.txt TLE 8031 ms 924 KB
subtask3-13.txt TLE 8031 ms 928 KB
subtask3-14.txt TLE 8032 ms 928 KB
subtask3-15.txt TLE 8031 ms 932 KB