oj.uz

답안 #146800

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
146800 2019-08-26T08:36:53 Z Fasho Lozinke (COCI17_lozinke) C++14
10 / 100
 96 ms 11072 KB 
#include <bits/stdc++.h>
#define N 2005
#define ll long long int 	
#define MP make_pair
#define pb push_back
#define ppb pop_back
#define sp " "
#define endl "\n"
#define fi first
#define se second
#define ii pair<int,int>
#define lli pair<ll,ll>
#define fast cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false)
#define fast2 freopen ("kmp.in","r",stdin);freopen ("kmp.out","w",stdout);
#define mod 1000000009
#define fs(x,y) for(int i=1;i<=y;i++) cin>>x[i]
#define fo(i,x,y) for(int i=x;i<=y;i++)
#define INF 1000000000005
using namespace std;

ll n,m,ar[N],sum;

string s[N],st[2001][9][9];

map<string,ll> mp,mark;

void pre()
{
	
	// cerr<<"HELLO"<<endl;
	fo(i,1,n)
		cin>>s[i];
	for(int i=1;i<=n;i++)
	{
		int x=s[i].size();
		for(int j=0;j<x;j++)	
		{
			for(int h=0;h<=j;h++)
			{
				string tmp;
				for(int g=h;g<=j;g++)
					st[i][j][h].pb(s[i][g]);
				// st[i][j][h]=tmp;
			}
		}
	}
}

int main()
{
	fast;
	cin>>n;
	pre();

	// cerr<<"HELLO"<<endl;

	fo(i,1,n)
	{
		int x=s[i].size();
		for(int j=0;j<x;j++)
		{
			for(int g=0;g<=j;g++)
			{
				string tmp=st[i][j][g];
				if(!mark[tmp])
					mark[tmp]++,mp[tmp]++;
			}
		}
		// cout<<endl;
		for(int j=0;j<x;j++)
		{
			for(int g=0;g<=j;g++)
			{
				string tmp=st[i][j][g];
				mark[tmp]=0;
			}
		}
	}
	fo(i,1,n)
		sum+=mp[s[i]]-1;
	cout<<sum;


}



/*     cd onedrive\desktop\kod
cls


*/

Subtask #1
10.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 5496 KB Output isn't correct
2 Correct 7 ms 5496 KB Output is correct
3 Incorrect 8 ms 5496 KB Output isn't correct
4 Correct 9 ms 5624 KB Output is correct
5 Incorrect 27 ms 6264 KB Output isn't correct
6 Incorrect 46 ms 6264 KB Output isn't correct
7 Incorrect 58 ms 7668 KB Output isn't correct
8 Incorrect 96 ms 9464 KB Output isn't correct
9 Runtime error 14 ms 11000 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Runtime error 18 ms 11044 KB Execution killed with signal 11 (could be triggered by violating memory limits)
11 Runtime error 14 ms 10876 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Runtime error 17 ms 11000 KB Execution killed with signal 11 (could be triggered by violating memory limits)
13 Runtime error 14 ms 11000 KB Execution killed with signal 11 (could be triggered by violating memory limits)
14 Runtime error 14 ms 10872 KB Execution killed with signal 11 (could be triggered by violating memory limits)
15 Runtime error 14 ms 10972 KB Execution killed with signal 11 (could be triggered by violating memory limits)
16 Runtime error 14 ms 11072 KB Execution killed with signal 11 (could be triggered by violating memory limits)
17 Runtime error 14 ms 11000 KB Execution killed with signal 11 (could be triggered by violating memory limits)
18 Runtime error 17 ms 10972 KB Execution killed with signal 11 (could be triggered by violating memory limits)
19 Runtime error 14 ms 11000 KB Execution killed with signal 11 (could be triggered by violating memory limits)
20 Runtime error 14 ms 10972 KB Execution killed with signal 11 (could be triggered by violating memory limits)